# Status Problem video Level Completes Likes
162

Dynamic Programming - Subset Sum Problem

Hard % 0
161

The Word Break Problem

Hard % 0
159

Backtracking - Knight's Tour Problem

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

Backtracking - SUDOKU Solver

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 a Number occurring odd number of times in a Given array

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

Find numbers that are palindrome in the decimal and octal Representations

Beginner % 0
126

Find All the Well Ordered Permutations of a Given String.

Medium % 0
125

Find the Increasing Triplet Sub-sequence in an array

Medium % 0
123

Colorful Numbers

Hard % 2
108

Implement Queue Using Stacks

Medium % 0
102

Merge Sort in a Linked list

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

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

Medium % 0
84

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.

Hard % 0
79

Find the Distance between Two Nodes of 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

Find the number of occurrences of a number in a given sorted array.

Medium % 0
44

Inorder Successor in Binary Tree

Medium % 0

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Backtracking - Knight's Tour Problem

Backtracking - N Queens Problem - Better Solution

Backtracking - N Queens Problem

Backtracking - Rat In A Maze Puzzle

Backtracking - SUDOKU Solver

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Merge K Sorted Arrays

Find a Number occurring odd number of times in a Given array

Diameter Of a Binary Tree

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

Find numbers that are palindrome in the decimal and octal Representations

Find All the Well Ordered Permutations of a Given String.

Find the Increasing Triplet Sub-sequence in an array

Colorful Numbers

Implement Queue Using Stacks

Merge Sort in a Linked list

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

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.

Find the Distance between Two Nodes of 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.

Find the number of occurrences of a number in a given sorted array.

Inorder Successor in Binary Tree