- Reducing Dishes
- Geek hates too many 1s
- Avoid Fire
- Count Subarrays With Fixed Bounds
- Walls Coloring II
- Shortest Impossible Sequence of Rolls
- IPO
- Fixing Two Swapped nodes of a BST
- Naming a Company
- Largest Sum Cycle
- Select Nodes
- LFU Cache
- Scrambled String
- Data Stream as Disjoint Intervals
- Concatenated Words
- Stamping The Sequence
- Number of Turns in Binary Tree
- Substring with Concatenation of All Words
- Contiguous Elements XOR
- Solve the Sudoku
- Strongly connected component (Tarjans's Algo)
- Articulation Point - II
- Articulation Point - I
- Find median in a stream
- Minimum BST Sum Subtree
- Merge two BST 's
- Fixing Two nodes of a BST
- Binary Tree to DLL
- Maximum of minimum for every window size
- Clone a linked list with next and random pointer
- Pattern Search KMP
- Merge Without Extra Space
- Median of Two sorted arrays
- Allocate minimum number of pages
- Max Circular Subarray Sum
- Stream of Characters
- Odd Even Linked List
- Maximal Rectangle
- Permutation Sequence
- Dungeon Game
- Kth Smallest Number in Multiplication Table
- Edit Distance
- Unique Paths III
- Longest Duplicate Substring
- Find Minimum in Rotated Sorted Array II
- Best Time to Buy and Sell Stock III
- Median of Two Sorted Arrays
- Word Search II
- Two Sum