Google - Depth-First Search
Depth-First Search questions asked by Google
Total: 220
Easy: 52
Medium: 129
Hard: 39
Progress: 0%
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Longest Balanced Substring After One Swap | Visit | Medium | |
| 2 | Construct Uniform Parity Array I | Visit | Easy | |
| 3 | Minimum Bitwise OR From Grid | Visit | Medium | |
| 4 | Lexicographically Smallest Permutation Greater Than Target | Visit | Medium | |
| 5 | Maximum Total from Optimal Activation Order | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 220 questions for free!
Log In