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
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
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
143

Merge K Sorted Arrays

Hard % 0
142

Find the Deepest Left Node in a Binary Tree.

Medium % 0
140

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

Medium % 0
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
133

Do the Reverse Level Order Traversal in a binary tree

Medium % 0
131

Find the Height of a tree without using Recursion

Medium % 0
129

Binary Min-Max Heap Implementation

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

Construct a Special Triangle from a Given Array

Beginner % 0
122

Goldbach's Conjecture

Beginner % 0
120

Convert Decimal into Irreducible Fraction

Beginner % 0
114

Counting Sort

Medium % 0
113

Towers Of Hanoi

Beginner % 0
110

Sort 3 Integers without using if condition OR use only Max() function.

Beginner % 0
109

Euclidean algorithm - Greatest Common Divisor(GCD)

Beginner % 0
108

Implement Queue Using Stacks

Medium % 0
107

Alternate Splitting of a given Linked List

Medium % 0

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

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

Merge K Sorted Arrays

Find the Deepest Left Node in a Binary Tree.

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

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

Do the Reverse Level Order Traversal in a binary tree

Find the Height of a tree without using Recursion

Binary Min-Max Heap Implementation

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

Construct a Special Triangle from a Given Array

Goldbach's Conjecture

Convert Decimal into Irreducible Fraction

Counting Sort

Towers Of Hanoi

Sort 3 Integers without using if condition OR use only Max() function.

Euclidean algorithm - Greatest Common Divisor(GCD)

Implement Queue Using Stacks

Alternate Splitting of a given Linked List