Uber - Prefix Sum
Prefix Sum questions asked by Uber
Total: 15
Easy: 2
Medium: 10
Hard: 3
Progress: 0%
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Number of Subarrays That Match a Pattern I | Visit | Medium | |
| 2 | Minimum Operations to Reduce an Integer to 0 | Visit | Medium | |
| 3 | Add Edges to Make Degrees of All Nodes Even | Visit | Hard | |
| 4 | Amount of Time for Binary Tree to Be Infected | Visit | Medium | |
| 5 | Binary Searchable Numbers in an Unsorted Array | 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 15 questions for free!
Log In