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
323

How to Reverse Text: Stack Method for String Reversal

Beginner % 0
307

Swap two numbers using Bitwise XOR Operator

Medium % 1
298

Left Shift (<<) and Right Shift (>>) Operators

Beginner % 1
271

Snake and Ladder Problem

Hard % 1
270

Weighted Graph Implementation – JAVA

Beginner % 1
268

Topological Sort

Medium % 1
264

Graph Implementation – Adjacency List - Better| Set 2

Beginner % 0
254

Sum of all sub arrays in O(n) Time

Hard % 0
246

Dynamic programming – Minimum Jumps to reach to end

Hard % 0
228

Find the only element in array which appears only once

Beginner % 1
199

Dynamic Programming - Maximum Subarray Problem

Medium % 0
198

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
188

Shortest Range in K-sorted Lists

Hard % 1
184

Get the Sum of all left leaves in a Binary tree

Beginner % 1
179

Binary Tree Deletion

Beginner % 0
176

Find the Size of a Binary Tree without Recursion

Beginner % 0
175

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
172

Dynamic Programming - Longest Common Substring

Medium % 0
171

Dynamic Programming - Longest Common Subsequence

Medium % 0
168

Dynamic Programming - Minimum Cost Path Problem

Medium % 1
149

Backtracking - Rat In A Maze Puzzle

Hard % 0
139

Find Missing Numbers in Sequences - XOR Method

Beginner % 1
135

Find Paths with Sum in Binary Tree

Medium % 0
132

Find the Deepest Node in a Binary Tree

Medium % 1
112

Generate All n-Bit Binary Strings

Medium % 1
111

Find Unique Number in Array with Duplicates (Except One)

Beginner % 1
97

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Hard % 0
93

Inorder Predecessor and Successor in Binary Search Tree

Hard % 0
68

Transforming a Binary Tree into its Mirror Image

Beginner % 0
67

Printing Nodes without Siblings in a Binary Tree

Beginner % 0
66

Convert a Sorted Doubly Linked List to Balanced BST

Medium % 1
62

In a Binary Tree, Check if Two nodes has the same parent or are siblings

Medium % 0
61

Determine If Two Nodes are Cousins

Medium % 0
44

Inorder Successor in Binary Tree

Medium % 0
38

Determining Binary Tree Balance

Medium % 0

How to Reverse Text: Stack Method for String Reversal

Swap two numbers using Bitwise XOR Operator

Left Shift (<<) and Right Shift (>>) Operators

Snake and Ladder Problem

Weighted Graph Implementation – JAVA

Topological Sort

Graph Implementation – Adjacency List - Better| Set 2

Sum of all sub arrays in O(n) Time

Dynamic programming – Minimum Jumps to reach to end

Find the only element in array which appears only once

Dynamic Programming - Maximum Subarray Problem

Kadane's Algorithm - Maximum Subarray Problem

Shortest Range in K-sorted Lists

Get the Sum of all left leaves in a Binary tree

Binary Tree Deletion

Find the Size of a Binary Tree without Recursion

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Longest Common Substring

Dynamic Programming - Longest Common Subsequence

Dynamic Programming - Minimum Cost Path Problem

Backtracking - Rat In A Maze Puzzle

Find Missing Numbers in Sequences - XOR Method

Find Paths with Sum in Binary Tree

Find the Deepest Node in a Binary Tree

Generate All n-Bit Binary Strings

Find Unique Number in Array with Duplicates (Except One)

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Inorder Predecessor and Successor in Binary Search Tree

Transforming a Binary Tree into its Mirror Image

Printing Nodes without Siblings in a Binary Tree

Convert a Sorted Doubly Linked List to Balanced BST

In a Binary Tree, Check if Two nodes has the same parent or are siblings

Determine If Two Nodes are Cousins

Inorder Successor in Binary Tree

Determining Binary Tree Balance