# Status Problem video Level Completes Likes
102

Merge Sort for Linked Lists (In-place Algorithm)

Medium % 0
101

Merge a Linked list into another Linked List at Alternate Positions

Medium % 0
99

Construct a binary tree from given Inorder and Level Order Traversal

Hard % 0
98

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)

Hard % 0
97

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Hard % 0
93

Inorder Predecessor and Successor in Binary Search Tree

Hard % 0
92

Check if Array Contains All Elements Of Some Given Range

Medium % 0
91

Check if Array is Consecutive Integers

Beginner % 0
90

Find Subarray with Sum Equal to a Target Value

Medium % 0
88

Rearrange Array: Positive and Negative Elements Alternating

Hard % 0
87

Find Intersection of Two Sorted Arrays

Beginner % 0
85

Find Maximum Distance Between Increasing Elements in Array

Medium % 0
84

Elements in an Array Occurring More Than N/K Times

Hard % 0
81

Find Nodes X Levels Up from Leaf Nodes in a Tree

Medium % 0
80

Find Nodes at Distance X from Root in a Tree

Medium % 0
79

Calculate Distance Between Nodes in a Binary Tree

Hard % 0
78

Root-to-Node Distance in Binary Tree: How to Find

Medium % 0
44

Inorder Successor in Binary Tree

Medium % 0
41

Sorted Array to Binary Search Tree of Minimal Height

Medium % 1
40

In a Binary Tree, Create Linked Lists of all the nodes at each depth

Hard % 0
39

Level Order Traversal, Print each level in separate line

Medium % 0
38

Determining Binary Tree Balance

Medium % 0
36

Find the Maximum Depth OR Height of a Binary Tree

Beginner % 1
35

Adding Two Numbers with Linked Lists

Medium % 0
34

Add two numbers represented by a linked list, Numbers are Stored in REVERSE order

Medium % 0
31

Reverse a Linked List Using Recursion

Medium % 0
30

Swap Every Kth Node in a LinkedList

Medium % 0
29

Delete a Node in the Middle of a Linked List Without Access to Head Node

Beginner % 0
28

Determine the Nth Node from the Tail in a Linked List

Beginner % 0

Merge Sort for Linked Lists (In-place Algorithm)

Merge a Linked list into another Linked List at Alternate Positions

Construct a binary tree from given Inorder and Level Order Traversal

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Inorder Predecessor and Successor in Binary Search Tree

Check if Array Contains All Elements Of Some Given Range

Check if Array is Consecutive Integers

Find Subarray with Sum Equal to a Target Value

Rearrange Array: Positive and Negative Elements Alternating

Find Intersection of Two Sorted Arrays

Find Maximum Distance Between Increasing Elements in Array

Elements in an Array Occurring More Than N/K Times

Find Nodes X Levels Up from Leaf Nodes in a Tree

Find Nodes at Distance X from Root in a Tree

Calculate Distance Between Nodes in a Binary Tree

Root-to-Node Distance in Binary Tree: How to Find

Inorder Successor in Binary Tree

Sorted Array to Binary Search Tree of Minimal Height

In a Binary Tree, Create Linked Lists of all the nodes at each depth

Level Order Traversal, Print each level in separate line

Determining Binary Tree Balance

Find the Maximum Depth OR Height of a Binary Tree

Adding Two Numbers with Linked Lists

Add two numbers represented by a linked list, Numbers are Stored in REVERSE order

Reverse a Linked List Using Recursion

Swap Every Kth Node in a LinkedList

Delete a Node in the Middle of a Linked List Without Access to Head Node

Determine the Nth Node from the Tail in a Linked List