Home - Algorithms

	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

#	Problem	Level	Completes	Likes
71	Sort the two dimensional (2D) array - In-place	Medium	%	0
72	Implement/Design the version control map system	Medium	%	0
73	Given an array, count the number of pairs with a given sum.	Beginner	%	0
74	Sort Map as per values - Java Program	Medium	%	0
75	Two Sum Problem	Beginner	%	0
76	Find if any two intervals overlap in given intervals	Medium	%	0
77	Given an array, find the number of all pairs with odd sum.	Medium	%	0
78	Given an array, find all unique subsets with a given sum with allowed repeated digits.	Medium	%	0
79	Print all steps to convert one string to another string	Medium	%	0
80	Lexicographically next permutation With One swap	Medium	%	1
81	Find all subsets of size K from a given number N (1 to N)	Medium	%	0
82	Sum of distinct elements among two given sets	Beginner	%	0
83	Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed	Medium	%	0
84	Stable Marriage Problem - Gale–Shapley Algorithm - Java	Hard	%	0
85	Insert a node in the given sorted linked list.	Beginner	%	1
86	Construct the largest number from the given array.	Medium	%	0
87	Given an array, find three-element sum closest to Zero	Medium	%	1
88	Print sorted unique elements of a given array	Beginner	%	0
89	Given an array, print all unique subsets with a given sum.	Medium	%	0
90	Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K.	Medium	%	0
91	Replace array elements with maximum element on the right.	Medium	%	0
92	Find all unique combinations of numbers (from 1 to 9 ) with sum to N	Medium	%	0
93	Number of Intervals in which given value lies	Beginner	%	0
94	Activity Selection Problem	Medium	%	0
95	Find the sum of overlapping elements in two sets	Beginner	%	0
96	Given two coordinates, Print the line equation	Beginner	%	0
97	Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)	Hard	%	0
98	Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm	Medium	%	0
99	Check If Given Undirected Graph is a tree	Medium	%	0
100	Print all middle elements of the given matrix/2D array.	Beginner	%	1
101	Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution	Beginner	%	1
102	Articulation Points OR Cut Vertices in a Graph	Hard	%	0
103	Check the completeness of given binary tree \| Set 2 - Using Level Order Traversal	Medium	%	0
104	Find the number of distinct Islands OR connected components.	Hard	%	0
105	Print All Paths in Dijkstra's Shortest Path Algorithm	Hard	%	0