2.8) Two Trees are Same or not
Given two binary trees, determine if they are structurally identical and have the same node values at corresponding positions.
Path Sum III
Given a binary tree and a target sum, find the total number of all paths in the tree such that the sum of the values along the path equals the…
Path Sum II
Given a binary tree and a target sum, find all root-to-leaf paths where each path's sum equals the given target sum. A leaf is a node with no children.
Path Sum
Given a binary tree and a target sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given target…
Middle of the Linked List
Given a singly-linked list, find the middle node of the list. If the list contains an even number of nodes, return the second middle node.
Happy Number
A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits. Repeat the…
Linked List Cycle II
Given a linked list, determine if it contains a cycle. If a cycle is present, find the node where the cycle begins and return it. If there is no cycle,…
Linked List Cycle
Given a linked list, determine if it has a cycle in it. A cycle is when a node in the linked list points to a previously visited node, forming a…
Reverse Nodes in k-Group
Given the head of a singly linked list and an integer k, reverse the nodes of the list k at a time and return the new head of the reversed…
Reverse Linked List II
Given the head of a singly linked list and two integers left and right, reverse the nodes of the list from position left to position right, and return the new…