Uber - Tree
Tree questions asked by Uber
Total: 44
Easy: 10
Medium: 29
Hard: 5
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 | Maximum Number of Accepted Invitations | Visit | Medium | |
| 4 | Merge Strings Alternately | Visit | Easy | |
| 5 | Final Prices With a Special Discount in a Shop | Visit | Easy | |
| 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 44 questions for free!
Log In