Selected problems from GeeksforGeeks website
| # | Solution | Tags | Note |
|---|---|---|---|
| 001 | Top Down View Of Binary Search Tree | BFS |
readme |
| 002 | Connect N Ropes with Minimum Cost | Greedy |
readme |
| 003 | Amplitude of Binary Tree | Binary Search |
|
| 007 | Divide Integer Without Multiply | Math Bit Manipulation |
|
| 008 | Football Score | Backtracking |
|
| 009 | Walking Range | BFS |
|
| 010 | Word Break III | Dynamic Programming |
|
| 011 | Find Duplicates For Less Than N | swap-until II |
readme |
| 012 | Find Duplicates For Less Than N II | swap-until II |