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
153

Find the Second Largest Element in an Array

Beginner % 1
152

Breadth-First Search/Traversal in a Graph.

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

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

Beginner % 1
139

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

Beginner % 1
136

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

Beginner % 1
134

Diameter Of a Binary Tree

Hard % 1
132

Find the Deepest Node in a Binary Tree.

Medium % 1
119

Clock Angle Problem

Beginner % 1
117

Track the Maximum Element in a Stack.

Medium % 1
112

Generate All Strings of n bits

Medium % 1
111

Find The Missing Duplicate in a Given Array.

Beginner % 1
69

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Medium % 1
66

Convert a Sorted Doubly Linked List to Balanced BST.

Medium % 1
48

Determine whether given binary tree is binary search tree(BST) or not

Medium % 1
41

Sorted Array to Binary Search Tree of Minimal Height

Medium % 1
36

Find the Maximum Depth OR Height of a Binary Tree

Beginner % 1
33

Reverse the binary representation of a number.

Medium % 1
26

Check if one string is Rotation of another string

Beginner % 1
23

Find Whether Two Strings are Permutation of each other

Beginner % 1
19

Exploring All Paths, Including Diagonal, from Top Left to Bottom Right in 2D Array

Medium % 1
2

Merge Sort - Updated - Most Efficient ways to Implement

Medium % 1
552

Stock Single Sell Problem - Divide and Conquer

Medium % 0
551

Reverse a linked list using stack

Medium % 0
549

Dynamic Programming - Minimum Cost for Climbing Stairs

Medium % 0
546

Converting to Non-Decreasing Array with One Change

Medium % 0
533

In an array, Duplicate the zeroes without expanding it

Beginner % 0
532

Maximum Depth of Valid Nested Parentheses in an arithmetic expression

Medium % 0
530

Maximum Consecutive Ones in a given array

Beginner % 0
528

Minimum Increments to make all array elements unique

Medium % 0
526

Maximum Surpasser in the given array

Hard % 0

Find the Second Largest Element in an Array

Breadth-First Search/Traversal in a Graph.

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Introduction To Dynamic Programming - Fibonacci Series

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

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

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

Diameter Of a Binary Tree

Find the Deepest Node in a Binary Tree.

Clock Angle Problem

Track the Maximum Element in a Stack.

Generate All Strings of n bits

Find The Missing Duplicate in a Given Array.

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Convert a Sorted Doubly Linked List to Balanced BST.

Determine whether given binary tree is binary search tree(BST) or not

Sorted Array to Binary Search Tree of Minimal Height

Find the Maximum Depth OR Height of a Binary Tree

Reverse the binary representation of a number.

Check if one string is Rotation of another string

Find Whether Two Strings are Permutation of each other

Exploring All Paths, Including Diagonal, from Top Left to Bottom Right in 2D Array

Merge Sort - Updated - Most Efficient ways to Implement

Stock Single Sell Problem - Divide and Conquer

Reverse a linked list using stack

Dynamic Programming - Minimum Cost for Climbing Stairs

Converting to Non-Decreasing Array with One Change

In an array, Duplicate the zeroes without expanding it

Maximum Depth of Valid Nested Parentheses in an arithmetic expression

Maximum Consecutive Ones in a given array

Minimum Increments to make all array elements unique

Maximum Surpasser in the given array