# Status Problem video Level Completes Likes
239

Find local minimum or local maximum in O(1)

Medium % 0
223

Stock Single Sell Problem - Dynamic Programming - O(n)

Medium % 2
221

Identifying Maximum Gain from Sequential Elements

Medium % 0
195

Single Threaded Binary Tree Complete Implementation

Hard % 0
161

The Word Break Problem

Hard % 0
159

Solve the Knight's Tour with Backtracking

Hard % 0
158

Backtracking - Search a Word In a Matrix

Hard % 0
157

Backtracking - N Queens Problem - Better Solution

Hard % 0
156

Backtracking - N Queens Problem

Hard % 0
149

Backtracking - Rat In A Maze Puzzle

Hard % 0
146

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 1
145

Dynamic Programming - Minimum Coin Change Problem

Medium % 1
143

Merge K Sorted Arrays

Hard % 0
134

Diameter Of a Binary Tree

Hard % 1
131

Find the Height of a tree without using Recursion

Medium % 0
116

Generate All Balanced Parentheses Combinations (N Pairs)

Medium % 1
108

Queue with Stacks: Efficient Implementation Using Stack Operations

Medium % 0
102

Merge Sort for Linked Lists (In-place Algorithm)

Medium % 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
89

Find Smallest Subarray Exceeding a Target Sum

Medium % 0
84

Elements in an Array Occurring More Than N/K Times

Hard % 0
82

Find Nodes at Distance X from a Given Node in a Tree

Hard % 0
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
36

Find the Maximum Depth OR Height of a Binary Tree

Beginner % 1

Find local minimum or local maximum in O(1)

Stock Single Sell Problem - Dynamic Programming - O(n)

Identifying Maximum Gain from Sequential Elements

Single Threaded Binary Tree Complete Implementation

The Word Break Problem

Solve the Knight's Tour with Backtracking

Backtracking - Search a Word In a Matrix

Backtracking - N Queens Problem - Better Solution

Backtracking - N Queens Problem

Backtracking - Rat In A Maze Puzzle

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Merge K Sorted Arrays

Diameter Of a Binary Tree

Find the Height of a tree without using Recursion

Generate All Balanced Parentheses Combinations (N Pairs)

Queue with Stacks: Efficient Implementation Using Stack Operations

Merge Sort for Linked Lists (In-place Algorithm)

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

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Find Smallest Subarray Exceeding a Target Sum

Elements in an Array Occurring More Than N/K Times

Find Nodes at Distance X from a Given Node in a Tree

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

Level Order Traversal, Print each level in separate line

Find the Maximum Depth OR Height of a Binary Tree