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
1		Maximizing Contiguous Ones with a Single Flip in a Binary Array	Medium	%	3
2		Counting the Largest Number Groups by Digit Sum	Medium	%	2
3		Find an extra element in two almost similar arrays	Beginner	%	2
4		Find the number of pairs with odd XOR	Beginner	%	2
5		Longest substring with at most K unique characters	Medium	%	2
6		Graph – Depth First Traversal	Medium	%	2
7		Stock Single Sell Problem - O(n) Solution	Hard	%	2
8		Dynamic Programming - Edit Distance Problem	Hard	%	2
9		Graph Representation - Adjacency Matrix and Adjacency List	Beginner	%	2
10		Minimum Number of Halls Required for Lecture Scheduling	Hard	%	1
11		Adding One to a Number Represented by an Array	Medium	%	1
12		find the Arithmetic Progression sequence	Beginner	%	1
13		Find The Minimum time difference	Medium	%	1
14		Departure and Destination Cities in a given itinerary	Beginner	%	1
15		Given an array, rank its elements	Beginner	%	1
16		Find Three Consecutive Odd Numbers in an array	Beginner	%	1
17		Convert to Non-decreasing Array with one change	Beginner	%	1
18		Convert a Decimal number to its binary representation	Beginner	%	1
19		Duplicate even elements in an array	Beginner	%	1
20		In a number, add digits until it becomes a single digit	Beginner	%	1
21		Maximum CPU Load Problem in a jobs list	Medium	%	1
22		Maximum distance from the nearest person.	Medium	%	1
23		Find the Number of Contiguous Parking Areas	Medium	%	1
24		Minimum Deletions to make the occurrence of each character unique.	Hard	%	1
25		Compare two version numbers of a software	Medium	%	1
26		Minimum number of adjacent swaps to sort the given array	Hard	%	1
27		Minimum number of times String A is repeated to such that B is substring of A	Medium	%	1
28		Check if the given playlist of programs is valid	Beginner	%	1
29		Construct the Largest number from the given digits	Beginner	%	1
30		Print all subarrays using recursion	Medium	%	1
31		Job Sequencing algorithm - Java	Medium	%	1
32		Lexicographically next permutation With One swap	Medium	%	1
33		Insert a node in the given sorted linked list.	Beginner	%	1
34		Given an array, find three-element sum closest to Zero	Medium	%	1
35		Print all middle elements of the given matrix/2D array.	Beginner	%	1

Maximizing Contiguous Ones with a Single Flip in a Binary Array

Counting the Largest Number Groups by Digit Sum

Find an extra element in two almost similar arrays

Find the number of pairs with odd XOR

Longest substring with at most K unique characters

Graph – Depth First Traversal

Stock Single Sell Problem - O(n) Solution

Dynamic Programming - Edit Distance Problem

Graph Representation - Adjacency Matrix and Adjacency List

Minimum Number of Halls Required for Lecture Scheduling

Adding One to a Number Represented by an Array

find the Arithmetic Progression sequence

Find The Minimum time difference

Departure and Destination Cities in a given itinerary

Given an array, rank its elements

Find Three Consecutive Odd Numbers in an array

Convert to Non-decreasing Array with one change

Convert a Decimal number to its binary representation

Duplicate even elements in an array

In a number, add digits until it becomes a single digit

Maximum CPU Load Problem in a jobs list

Maximum distance from the nearest person.

Find the Number of Contiguous Parking Areas

Minimum Deletions to make the occurrence of each character unique.

Compare two version numbers of a software

Minimum number of adjacent swaps to sort the given array

Minimum number of times String A is repeated to such that B is substring of A

Check if the given playlist of programs is valid

Construct the Largest number from the given digits

Print all subarrays using recursion

Job Sequencing algorithm - Java

Lexicographically next permutation With One swap

Insert a node in the given sorted linked list.

Given an array, find three-element sum closest to Zero

Print all middle elements of the given matrix/2D array.

• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• 12
• 13
• 14
• 15
• 16