- Maximize the Topmost Element After K Moves
- Valid Compressed String
- Shortest Impossible Sequence of Rolls
- IPO
- Partition String Into Substrings With Values at Most K
- The Number of Weak Characters in the Game
- Gas Station
- Stamping The Sequence
- Reduce Array Size to The Half
- Max length chain
- N meetings in one room
- Largest number with given sum
- Job Sequencing Problem
- Huffman Decoding
- Fractional Knapsack
- Activity Selection
- Strongly connected component (Tarjans's Algo)
- Minimum Cost Path
- Bridge edge in a graph