Uber
336 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1519. Number of Nodes in the Sub-Tree With the Same Label | Medium | 49.9% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchCountingDP on Trees |
| 1579. Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 49.9% | TopicsUnion-FindGraph Theory |
| Hopper Company Queries I | Hard | 49.9% | TopicsDatabase |
| Hopper Company Queries II | Hard | 49.9% | TopicsDatabase |
| Hopper Company Queries III | Hard | 49.9% | TopicsDatabase |
| 1719. Number Of Ways To Reconstruct A Tree | Hard | 49.9% | TopicsArrayHash TableTreeGraph TheorySimulation |
| 1705. Maximum Number of Eaten Apples | Medium | 49.9% | TopicsArrayGreedyHeap (Priority Queue) |
| 1829. Maximum XOR for Each Query | Medium | 49.9% | TopicsArrayBit ManipulationPrefix Sum |
| 1818. Minimum Absolute Sum Difference | Medium | 49.9% | TopicsArrayBinary SearchSortingOrdered Set |
| 1926. Nearest Exit from Entrance in Maze | Medium | 49.9% | TopicsArrayBreadth-First SearchMatrix |
| Check for Contradictions in Equations | Hard | 49.9% | TopicsArrayStringDepth-First SearchUnion-FindGraph Theory |
| 1968. Array With Elements Not Equal to Average of Neighbors | Medium | 49.9% | TopicsArrayGreedySorting |
| 1961. Check If String Is a Prefix of Array | Easy | 49.9% | TopicsArrayTwo PointersString |
| 1967. Number of Strings That Appear as Substrings in Word | Easy | 49.9% | TopicsArrayString |
| 2196. Create Binary Tree From Descriptions | Medium | 49.9% | TopicsArrayHash TableTreeBinary Tree |
| 2248. Intersection of Multiple Arrays | Easy | 49.9% | TopicsArrayHash TableSortingCounting |
| 2261. K Divisible Elements Subarrays | Medium | 49.9% | TopicsArrayHash TableTrieRolling HashHash FunctionEnumeration |
| 2243. Calculate Digit Sum of a String | Easy | 49.9% | TopicsStringSimulation |
| 2333. Minimum Sum of Squared Difference | Medium | 49.9% | TopicsArrayBinary SearchGreedySortingHeap (Priority Queue) |
| Number of People That Can Be Seen in a Grid | Medium | 49.9% | TopicsArrayStackMatrixMonotonic Stack |
| 2555. Maximize Win From Two Segments | Medium | 49.9% | TopicsArrayBinary SearchSliding Window |
| Number of Ways to Reach Destination in the Grid | Hard | 49.9% | TopicsMathDynamic ProgrammingCombinatorics |
| Find Pattern in Infinite Stream I | Medium | 49.9% | TopicsArraySliding WindowRolling HashString MatchingInteractiveHash Function |
| Find Pattern in Infinite Stream II | Hard | 49.9% | TopicsArraySliding WindowRolling HashString MatchingInteractiveHash Function |
| Maximum Increasing Triplet Value | Medium | 49.9% | TopicsArrayOrdered Set |
