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
375

String to Integer (AtoI - ASCII to Integer)

Beginner % 1
369

Find duplicates Characters in the given String

Beginner % 0
357

Count Set bits in a given Number

Beginner % 1
346

Valid Brackets – Part 2 | Stack Method

Beginner % 0
331

Find Largest and Smallest word in a given String

Beginner % 0
325

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Medium % 1
323

Reverse the given String using Stack

Beginner % 0
271

Snake and Ladder Problem

Hard % 1
267

Graph – Depth First Search using Recursion

Beginner % 1
254

Sum of all sub arrays in O(n) Time

Hard % 0
246

Dynamic programming – Minimum Jumps to reach to end

Hard % 0
223

Stock Single Sell Problem - Dynamic Programming - O(n)

Medium % 2
209

Find longest Snake sequence in a given matrix

Medium % 1
208

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Medium % 1
207

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Medium % 1
199

Dynamic Programming - Maximum Subarray Problem

Medium % 0
198

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
189

Convert BST to Greater Sum Tree

Medium % 0
188

Shortest Range in K-sorted Lists

Hard % 1
184

Get the Sum of all left leaves in a Binary tree

Beginner % 1
183

Convert binary tree to its Sum tree

Medium % 1
175

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
174

Dynamic Programming - Maximum Product Cutting Problem.

Medium % 1
170

Dynamic Programming - Rod Cutting Problem

Medium % 1
169

Dynamic Programming - Coin Change Problem

Medium % 1
168

Dynamic Programming - Minimum Cost Path Problem

Medium % 1
163

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

Medium % 1
160

Dynamic Programming - Longest Increasing Subsequence

Medium % 1
152

Breadth-First Search/Traversal in a Graph.

Beginner % 1
149

Backtracking - Rat In A Maze Puzzle

Hard % 0
146

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 1
145

Dynamic Programming - Minimum Coin Change Problem

Medium % 1
132

Find the Deepest Node in a Binary Tree.

Medium % 1
112

Generate All Strings of n bits

Medium % 1

String to Integer (AtoI - ASCII to Integer)

Find duplicates Characters in the given String

Count Set bits in a given Number

Valid Brackets – Part 2 | Stack Method

Find Largest and Smallest word in a given String

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Reverse the given String using Stack

Snake and Ladder Problem

Graph – Depth First Search using Recursion

Sum of all sub arrays in O(n) Time

Dynamic programming – Minimum Jumps to reach to end

Stock Single Sell Problem - Dynamic Programming - O(n)

Find longest Snake sequence in a given matrix

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Dynamic Programming - Maximum Subarray Problem

Kadane's Algorithm - Maximum Subarray Problem

Convert BST to Greater Sum Tree

Shortest Range in K-sorted Lists

Get the Sum of all left leaves in a Binary tree

Convert binary tree to its Sum tree

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Maximum Product Cutting Problem.

Dynamic Programming - Rod Cutting Problem

Dynamic Programming - Coin Change Problem

Dynamic Programming - Minimum Cost Path Problem

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

Dynamic Programming - Longest Increasing Subsequence

Breadth-First Search/Traversal in a Graph.

Backtracking - Rat In A Maze Puzzle

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Find the Deepest Node in a Binary Tree.

Generate All Strings of n bits