Featured Lists

Top 20 Problems on Dynamic programming

Top 10 Problems on Backtracking

Top 20 Problems on Graph

Top 25 Problems on Trees

Top 10 Problems on Bits Manipulation

Top 15 Problems in LinkedList

All Problems

# Status Problem video Level Completes Likes
163

Dynamic Programming - Maximum size square sub-matrix with all 1s

Medium % 1
162

Dynamic Programming - Subset Sum Problem

Hard % 0
161

The Word Break Problem

Hard % 0
160

Dynamic Programming - Longest Increasing Subsequence

Medium % 1
159

Backtracking - Knight's Tour Problem

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
155

Find the Kth Smallest/Largest Element in an Array

Beginner % 0
154

Priority Queue in Data Structure

Beginner % 0
153

Find the Second Largest Element in an Array

Beginner % 1
152

Breadth-First Search/Traversal in a Graph.

Beginner % 1
151

Breadth-First Search/Traversal in a Binary Tree

Beginner % 0
150

Sort Names by their Last Names.

Beginner % 0
149

Backtracking - Rat In A Maze Puzzle

Hard % 0
148

Backtracking - SUDOKU Solver

Hard % 0
147

Introduction To Backtracking Programming

Beginner % 0
146

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 1
145

Dynamic Programming - Minimum Coin Change Problem

Medium % 1
144

Introduction To Dynamic Programming - Fibonacci Series

Beginner % 1
143

Merge K Sorted Arrays

Hard % 0
142

Find the Deepest Left Node in a Binary Tree.

Medium % 0
141

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

Beginner % 1
140

Rearrange the Array of Given Range N, such that A[i]=i

Medium % 0
139

Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method

Beginner % 1
138

Find the Max element in a Given Binary Tree

Beginner % 0
137

Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node

Hard % 0
136

Check If One Binary is Mirror Tree of another Binary Tree.

Beginner % 1
134

Diameter Of a Binary Tree

Hard % 1
133

Do the Reverse Level Order Traversal in a binary tree

Medium % 0
132

Find the Deepest Node in a Binary Tree.

Medium % 1
131

Find the Height of a tree without using Recursion

Medium % 0
129

Binary Min-Max Heap Implementation

Hard % 0

Dynamic Programming - Maximum size square sub-matrix with all 1s

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Dynamic Programming - Longest Increasing Subsequence

Backtracking - Knight's Tour Problem

Backtracking - Search a Word In a Matrix

Backtracking - N Queens Problem - Better Solution

Backtracking - N Queens Problem

Find the Kth Smallest/Largest Element in an Array

Priority Queue in Data Structure

Find the Second Largest Element in an Array

Breadth-First Search/Traversal in a Graph.

Breadth-First Search/Traversal in a Binary Tree

Sort Names by their Last Names.

Backtracking - Rat In A Maze Puzzle

Backtracking - SUDOKU Solver

Introduction To Backtracking Programming

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Introduction To Dynamic Programming - Fibonacci Series

Merge K Sorted Arrays

Find the Deepest Left Node in a Binary Tree.

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

Rearrange the Array of Given Range N, such that A[i]=i

Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method

Find the Max element in a Given Binary Tree

Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node

Check If One Binary is Mirror Tree of another Binary Tree.

Diameter Of a Binary Tree

Do the Reverse Level Order Traversal in a binary tree

Find the Deepest Node in a Binary Tree.

Find the Height of a tree without using Recursion

Binary Min-Max Heap Implementation