# Status Problem video Level Completes Likes
162

Dynamic Programming - Subset Sum Problem

Hard % 0
161

The Word Break Problem

Hard % 0
159

Solve the Knight's Tour with Backtracking

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
148

Solve Sudoku Puzzles with Backtracking

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
141

Find the Single Occurrence Element in an Array (Odd One Out)

Beginner % 1
134

Diameter Of a Binary Tree

Hard % 1
128

Magic Index - Find Index In Sorted Array Such That A[i] = i

Beginner % 0
127

Numbers Palindrome in Both Decimal and Octal

Beginner % 0
126

Generate All Permutations of a String (Well-Ordered)

Medium % 0
125

Find the Increasing Triplet Sub-sequence in an array

Medium % 0
123

Colorful Numbers

Hard % 3
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
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
85

Find Maximum Distance Between Increasing Elements in Array

Medium % 0
84

Elements in an Array Occurring More Than N/K Times

Hard % 0
79

Calculate Distance Between Nodes in a Binary Tree

Hard % 0
74

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Hard % 0
73

Lowest Common Ancestor in a Binary Search Tree.

Medium % 0
72

Make a Binary Tree from Given Inorder and Preorder Traversal

Hard % 0
66

Convert a Sorted Doubly Linked List to Balanced BST

Medium % 1
53

Count occurrences of a number in a sorted array

Medium % 0
44

Inorder Successor in Binary Tree

Medium % 0

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Solve the Knight's Tour with Backtracking

Backtracking - N Queens Problem - Better Solution

Backtracking - N Queens Problem

Backtracking - Rat In A Maze Puzzle

Solve Sudoku Puzzles with Backtracking

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Merge K Sorted Arrays

Find the Single Occurrence Element in an Array (Odd One Out)

Diameter Of a Binary Tree

Magic Index - Find Index In Sorted Array Such That A[i] = i

Numbers Palindrome in Both Decimal and Octal

Generate All Permutations of a String (Well-Ordered)

Find the Increasing Triplet Sub-sequence in an array

Colorful Numbers

Generate All Balanced Parentheses Combinations (N Pairs)

Queue with Stacks: Efficient Implementation Using Stack Operations

Merge Sort for Linked Lists (In-place Algorithm)

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

Find Maximum Distance Between Increasing Elements in Array

Elements in an Array Occurring More Than N/K Times

Calculate Distance Between Nodes in a Binary Tree

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Lowest Common Ancestor in a Binary Search Tree.

Make a Binary Tree from Given Inorder and Preorder Traversal

Convert a Sorted Doubly Linked List to Balanced BST

Count occurrences of a number in a sorted array

Inorder Successor in Binary Tree