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

Find the Deepest Node in a Binary Tree

Medium % 1
131

Find the Height of a tree without using Recursion

Medium % 0
130

Find and Print Full Nodes in a Binary Tree

Beginner % 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

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
124

Create a Specific Triangle Pattern from an Array

Beginner % 0
123

Colorful Numbers

Hard % 3
122

Goldbach's Conjecture

Beginner % 0
120

Convert Decimal to Irreducible Fraction (Simplified Form)

Beginner % 0
119

Clock Angle Problem

Beginner % 1
117

Stack with Max Tracking: Find the Largest Element (Optimized)

Medium % 1

Verifying Mirror Binary Trees

Find Paths with Sum in Binary Tree

Diameter Of a Binary Tree

Reverse Level Order Traversal of Binary Trees

Find the Deepest Node in a Binary Tree

Find the Height of a tree without using Recursion

Find and Print Full Nodes in a Binary Tree

Binary Min-Max Heap Implementation

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

Create a Specific Triangle Pattern from an Array

Colorful Numbers

Goldbach's Conjecture

Convert Decimal to Irreducible Fraction (Simplified Form)

Clock Angle Problem

Stack with Max Tracking: Find the Largest Element (Optimized)