- Assign Cookies
- Lemonade Change
- Fractional Knapsack
- Jump Game I
- Heapify Algorithm
- Shortest Job First
- Job Sequencing Problem
- N Meetings in One Room
- Non-overlapping Intervals
- Insert Interval
- Merge Intervals
- Minimum Number of Platforms Required for a Railway
- Number of Provinces
- Number of Islands
- Flood Fill Algorithm
- Detect a Cycle in an Undirected Graph
- Build Heap from a Given Array
- Implement Min Heap
- Number of Enclaves
- Rotten Oranges
- Distance of Nearest Cell Having One
- Surrounded Regions
- Number of Distinct Islands
- Bipartite Graph
- Topological Sort / Kahn's Algorithm
- Detect a Cycle in a Directed Graph
- Dijkstra's Algorithm
- Print Shortest Path
- Shortest Distance in a Binary Maze
- Network Delay Time
- Implement Max Heap
- Check if an Array Represents a Min Heap
- Top K Frequent Elements
- Climbing Stairs
- Frog Jump
- Frog Jump with K Distances
- Maximum Sum of Non-Adjacent Elements
- House Robber
- Convert Min Heap to Max Heap
- Minimum Cost to Connect Sticks
- No required study targets. Enjoy your break!
| 0055-jump-game |
| 0860-lemonade-change |
| 0055-jump-game |
| 0860-lemonade-change |
| 0055-jump-game |