Uber - Depth-First Search
Depth-First Search questions asked by Uber
Total: 64
Easy: 10
Medium: 43
Hard: 11
Progress: 0%
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Minimum Operations to Make Binary Array Elements Equal to One I | Visit | Medium | |
| 2 | Divide Nodes Into the Maximum Number of Groups | Visit | Hard | |
| 3 | Longest Path With Different Adjacent Characters | Visit | Hard | |
| 4 | Detonate the Maximum Bombs | Visit | Medium | |
| 5 | Minimum Number of Operations to Make Array Continuous | Visit | Hard | |
| 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 64 questions for free!
Log In