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
167

Generate Well Ordered Passwords of a Given Length K

Medium % 0
166

All N Length Strings from Given String of Length K

Medium % 0
165

Generate all combinations of length N

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

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
155

Find the Kth Smallest/Largest Element in an Array Using Heap

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

Solve Sudoku Puzzles with Backtracking

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

Locate the Farthest Left Node on the Bottom Level

Medium % 0
141

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

Beginner % 1
140

Rearrange Array Elements (A[i] = i) | In-place Approach

Medium % 0
139

Find Missing Numbers in Sequences - XOR Method

Beginner % 1
138

Find the Maximum Value in a Binary Tree

Beginner % 0
137

Populate Next Right Pointers in Each Node

Hard % 0
136

Verifying Mirror Binary Trees

Beginner % 1
135

Find Paths with Sum in Binary Tree

Medium % 0
134

Diameter Of a Binary Tree

Hard % 1
133

Reverse Level Order Traversal of Binary Trees

Medium % 0

Generate Well Ordered Passwords of a Given Length K

All N Length Strings from Given String of Length K

Generate all combinations of length N

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

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Dynamic Programming - Longest Increasing Subsequence

Solve the Knight's Tour with Backtracking

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 Using Heap

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

Solve Sudoku Puzzles with Backtracking

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

Locate the Farthest Left Node on the Bottom Level

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

Rearrange Array Elements (A[i] = i) | In-place Approach

Find Missing Numbers in Sequences - XOR Method

Find the Maximum Value in a Binary Tree

Populate Next Right Pointers in Each Node

Verifying Mirror Binary Trees

Find Paths with Sum in Binary Tree

Diameter Of a Binary Tree

Reverse Level Order Traversal of Binary Trees