Featured Lists

Top 20 Problems on Dynamic programming

Top 10 Problems on Backtracking

Top 20 Problems on Graph

Top 25 Problems on Trees

All Problems

# Status Problem Level Completes Likes
71

Graph – Print all paths between source and destination

Medium % 1
72

Find two non-repeating numbers in an array in O(n) time and O(1) space

Hard % 1
73

Number of bit to be flipped to convert one number to another.

Beginner % 1
74

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Hard % 1
75

Find the only element in array which appears only once

Beginner % 1
76

Algorithm to calculate power(k,n).

Beginner % 1
77

Number of 1’s in bit representation of a number

Beginner % 1
78

Find the right most unset bit OR zero bit of a number

Beginner % 1
79

Find the two repeating elements in a given array | 6 Approaches

Medium % 1
80

Find the right most set bit of a number

Beginner % 1
81

Find two elements whose sum is closest to zero

Medium % 1
82

Find longest Snake sequence in a given matrix

Medium % 1
83

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

Medium % 1
84

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

Medium % 1
86

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
87

Shortest Range in K-sorted Lists

Hard % 1
88

Get the Sum of all left leaves in a Binary tree

Beginner % 1
89

Convert binary tree to its Sum tree

Medium % 1
90

Tree Traversals

Beginner % 1
91

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
92

Dynamic Programming - Maximum Product Cutting Problem.

Medium % 1
93

Dynamic Programming - Rod Cutting Problem

Medium % 1
94

Dynamic Programming - Coin Change Problem

Medium % 1
95

Dynamic Programming - Minimum Cost Path Problem

Medium % 1
96

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

Medium % 1
97

Dynamic Programming - Longest Increasing Subsequence

Medium % 1
98

Find the Second Largest Element in an Array

Beginner % 1
99

Breadth-First Search/Traversal in a Graph.

Beginner % 1
100

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 1
101

Dynamic Programming - Minimum Coin Change Problem

Medium % 1
102

Introduction To Dynamic Programming - Fibonacci Series

Beginner % 1
103

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

Beginner % 1
104

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

Beginner % 1
105

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

Beginner % 1

Graph – Print all paths between source and destination

Find two non-repeating numbers in an array in O(n) time and O(1) space

Number of bit to be flipped to convert one number to another.

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Find the only element in array which appears only once

Algorithm to calculate power(k,n).

Number of 1’s in bit representation of a number

Find the right most unset bit OR zero bit of a number

Find the two repeating elements in a given array | 6 Approaches

Find the right most set bit of a number

Find two elements whose sum is closest to zero

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

Kadane's Algorithm - Maximum Subarray Problem

Shortest Range in K-sorted Lists

Get the Sum of all left leaves in a Binary tree

Convert binary tree to its Sum tree

Tree Traversals

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

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.