Ask pavan
Revise
Using queue
Uses BFS
Awesome solution
solution using preorder traversal
Practice one more time
See algorithm
Trivial
Revise if you have time
Recursion.
Interesting solution... uses factorial
Unlikely to come.. complicated algo.... ask pavan
Revise solution
Interesting and easy
Simple
ask pavan
Imp revise
Interesting solution
geeksforgeeks
Tree
-
Connect nodes at same level using constant extra space
geeksforgeeks.org
-
Check whether a given Binary Tree is Complete or not
geeksforgeeks.org
-
Linked complete binary tree & its creation - GeeksforGeeks
geeksforgeeks.org
-
Iterative Method to find Height of Binary Tree
geeksforgeeks.org
-
Convert a given Binary Tree to Doubly Linked List
geeksforgeeks.org
-
Sum of all the numbers that are formed from root to leaf paths
geeksforgeeks.org
-
9 more
TreeAsk pavan
Revise
Using queue
Uses BFS
Awesome solution
solution using preorder traversal
Arrays
-
Count Inversions in an array | Set 1 (Using Merge Sort) - GeeksforGeeks
geeksforgeeks.org
ArraysPractice one more time
Heap
-
Sort a nearly sorted (or K sorted) array
geeksforgeeks.org
-
Merge k sorted arrays | Set 1 - GeeksforGeeks
geeksforgeeks.org
-
Print all elements in sorted order from row and column wise sorted matrix
geeksforgeeks.org
-
Why is Binary Heap Preferred over BST for Priority Queue?
geeksforgeeks.org
-
Check if a given Binary Tree is Heap
geeksforgeeks.org
HeapBST
-
Inorder Tree Traversal without recursion and without stack!
geeksforgeeks.org
-
Construct all possible BSTs for keys 1 to N
geeksforgeeks.org
-
Count BST subtrees that lie in given range
geeksforgeeks.org
-
Transform a BST to greater sum tree
geeksforgeeks.org
-
Check for Identical BSTs without building the trees
geeksforgeeks.org
-
Remove BST keys outside the given range
geeksforgeeks.org
-
6 more
BSTSee algorithm
Trivial
String
-
Find the smallest window in a string containing all characters of another string
geeksforgeeks.org
-
Print all interleavings of given two strings
geeksforgeeks.org
-
Lexicographic rank of a string
geeksforgeeks.org
-
An in-place algorithm for String Transformation
geeksforgeeks.org
-
Given a sequence of words, print all anagrams together
geeksforgeeks.org
-
String matching where one string contains wildcard characters
geeksforgeeks.org
-
11 more
StringRevise if you have time
Recursion.
Interesting solution... uses factorial
Unlikely to come.. complicated algo.... ask pavan
Revise solution
Stacks
-
The Stock Span Problem
geeksforgeeks.org
-
Iterative Postorder Traversal | Set 2 (Using One Stack) - GeeksforGeeks
geeksforgeeks.org
-
Largest Rectangular Area in a Histogram
geeksforgeeks.org
-
Print ancestors of a given binary tree node without recursion
geeksforgeeks.org
-
Length of the longest valid substring
geeksforgeeks.org
-
Sort a stack using recursion
geeksforgeeks.org
-
2 more
StacksInteresting and easy
Simple
ask pavan
Imp revise
Interesting solution