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
456		Find the Index from which 0 starts	Beginner	%	0
457		Find the increasing OR decreasing point in an array	Beginner	%	0
458		Find remainder without using modulo operator	Beginner	%	0
459		Swap two numbers without using extra variable	Beginner	%	0
460		Maximum difference between two elements where larger element appears after the smaller element	Medium	%	0
461		Find the two repeating elements in a given array | 6 Approaches	Medium	%	1
462		Find the element which appears maximum number of times in the array.	Medium	%	0
463		Find duplicates in an given array in O(n) time and O(1) extra space.	Medium	%	0
464		Find the last non repeating character in a given string.	Beginner	%	0
465		Find the last repeating character in a given string.	Beginner	%	0
466		k-Nearest Neighbors	Hard	%	0
467		Reverse the given Array without using built in function	Beginner	%	0
468		Dynamic Programming - Split the String into Minimum number of Palindromes.	Hard	%	0
469		Convert Binary Tree into Threaded Binary Tree	Hard	%	0
470		Double Threaded Binary Tree Complete Implementation	Hard	%	0
471		Single Threaded Binary Tree Complete Implementation	Hard	%	0
472		Introduction to Threaded Binary Tree	Medium	%	0
473		Implement Stack Using Linked List	Beginner	%	0
474		Doubly Linked List Complete Implementation	Beginner	%	0
475		Circular Linked List Complete Implementation	Beginner	%	0
476		Generate Maximum revenue by selling K tickets from N windows	Medium	%	0
477		Search the Element in a binary tree - With and Without Recursion	Beginner	%	0
478		Generate Well Ordered Passwords of a Given Length K	Medium	%	0
479		All N Length Strings from Given String of Length K	Medium	%	0
480		Backtracking - N Queens Problem	Hard	%	0
481		Find the Kth Smallest/Largest Element in an Array	Beginner	%	0
482		Priority Queue in Data Structure	Beginner	%	0
483		Sort Names by their Last Names.	Beginner	%	0
484		Find the Deepest Left Node in a Binary Tree.	Medium	%	0
485		Rearrange the Array of Given Range N, such that A[i]=i	Medium	%	0
486		Find the Max element in a Given Binary Tree	Beginner	%	0
487		Do the Reverse Level Order Traversal in a binary tree	Medium	%	0
488		Find the Height of a tree without using Recursion	Medium	%	0
489		Binary Min-Max Heap Implementation	Hard	%	0
490		Magic Index - Find Index In Sorted Array Such That A[i] = i.	Beginner	%	0

Find the Index from which 0 starts

Find the increasing OR decreasing point in an array

Find remainder without using modulo operator

Swap two numbers without using extra variable

Maximum difference between two elements where larger element appears after the smaller element

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

Find the element which appears maximum number of times in the array.

Find duplicates in an given array in O(n) time and O(1) extra space.

Find the last non repeating character in a given string.

Find the last repeating character in a given string.

k-Nearest Neighbors

Reverse the given Array without using built in function

Dynamic Programming - Split the String into Minimum number of Palindromes.

Convert Binary Tree into Threaded Binary Tree

Double Threaded Binary Tree Complete Implementation

Single Threaded Binary Tree Complete Implementation

Introduction to Threaded Binary Tree

Implement Stack Using Linked List

Doubly Linked List Complete Implementation

Circular Linked List Complete Implementation

Generate Maximum revenue by selling K tickets from N windows

Search the Element in a binary tree - With and Without Recursion

Generate Well Ordered Passwords of a Given Length K

All N Length Strings from Given String of Length K

Backtracking - N Queens Problem

Find the Kth Smallest/Largest Element in an Array

Priority Queue in Data Structure

Sort Names by their Last Names.

Find the Deepest Left Node in a Binary Tree.

Rearrange the Array of Given Range N, such that A[i]=i

Find the Max element in a Given Binary Tree

Do the Reverse Level Order Traversal in a binary tree

Find the Height of a tree without using Recursion

Binary Min-Max Heap Implementation

Magic Index - Find Index In Sorted Array Such That A[i] = i.

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