Uber - All Time
Uber - All Time
Problems
Interview
Contest
Discuss
Store
0
72
Uber
Problems
Discuss
Notice
We've improved our algorithm that calculates company tags and their frequencies to
be more accurate and current.
All time
1135 Connecting Cities With Union FindGraphHeap (Priority Queue)Minimum Spanning 61.0%
Minimum Cost Tree
218 The Skyline Problem ArrayDivide and ConquerBinary Indexed TreeSegment 39.2%
TreeLine SweepHeap (Priority Queue)Ordered Set
SortCounting
173 Binary Search Tree Iterator StackTreeDesignBinary Search TreeBinary TreeIterator 68.5%
315 Count of Smaller Numbers After ArrayBinary SearchDivide and ConquerBinary Indexed 42.9%
Self TreeSegment TreeMerge SortOrdered Set
Digits of an Integer
99 Recover Binary Search Tree TreeDepth-First SearchBinary Search TreeBinary Tree 49.8%
23 Merge k Sorted Lists Linked ListDivide and ConquerHeap (Priority Queue)Merge 48.0%
Sort
295 Find Median from Data Stream Two PointersDesignSortingHeap (Priority Queue)Data 50.9%
Stream
230 Kth Smallest Element in a BST TreeDepth-First SearchBinary Search TreeBinary Tree 68.8%
121 Best Time to Buy and Sell Stock ArrayDynamic Programming 54.4%
863 All Nodes Distance K in Binary TreeDepth-First SearchBreadth-First SearchBinary Tree 61.9%
Tree
1385 Find the Distance Value Between ArrayTwo PointersBinary SearchSorting 65.3%
Two Arrays
347 Top K Frequent Elements ArrayHash TableDivide and ConquerSortingHeap (Priority 64.9%
Queue)Bucket SortCountingQuickselect
378 Kth Smallest Element in a Sorted ArrayBinary SearchSortingHeap (Priority Queue)Matrix 61.4%
Matrix
432 All O`one Data Structure Hash TableLinked ListDesignDoubly-Linked List 36.6%
889 Construct Binary Tree from ArrayHash TableDivide and ConquerTreeBinary Tree 70.6%
Preorder and Postorder Traversal
1878 Get Biggest Three Rhombus ArrayMathSortingHeap (Priority Queue)MatrixPrefix Sum 46.2%
Sums in a Grid
122 Best Time to Buy and Sell Stock ArrayDynamic ProgrammingGreedy 62.9%
II
215 Kth Largest Element in an Array ArrayDivide and ConquerSortingHeap (Priority 65.4%
Queue)Quickselect
124 Binary Tree Maximum Path Sum Dynamic ProgrammingTreeDepth-First SearchBinary Tree 38.2%
138 Copy List with Random Pointer Hash TableLinked List 49.8%
847 Shortest Path Visiting All Nodes Dynamic ProgrammingBit ManipulationBreadth-First 61.3%
SearchGraphBitmask
105 Construct Binary Tree from ArrayHash TableDivide and ConquerTreeBinary Tree 60.1%
Preorder and Inorder Traversal
199 Binary Tree Right Side View TreeDepth-First SearchBreadth-First SearchBinary Tree 60.9%
1008 Construct Binary Search Tree ArrayStackTreeBinary Search TreeMonotonic StackBinary 80.8%
from Preorder Traversal Tree
114 Flatten Binary Tree to Linked Linked ListStackTreeDepth-First SearchBinary Tree 60.6%
List
# Title Tags Acceptanc
188 Best Time to Buy and Sell Stock ArrayDynamic Programming 35.2%
IV
287 Find the Duplicate Number ArrayTwo PointersBinary SearchBit Manipulation 59.1%
123 Best Time to Buy and Sell Stock ArrayDynamic Programming 44.3%
III
Sum
659 Split Array into Consecutive ArrayHash TableGreedyHeap (Priority Queue) 50.5%
Subsequences
# Title Tags Acceptanc
160 Intersection of Two Linked Lists Hash TableLinked ListTwo Pointers 52.6%
209 Minimum Size Subarray Sum ArrayBinary SearchSliding WindowPrefix Sum 44.2%
235 Lowest Common Ancestor of a TreeDepth-First SearchBinary Search TreeBinary Tree 59.6%
Binary Search Tree
864 Shortest Path to Get All Keys Bit ManipulationBreadth-First Search 45.3%
# Title Tags Acceptanc
98 Validate Binary Search Tree TreeDepth-First SearchBinary Search TreeBinary Tree 31.5%
930 Binary Subarrays With Sum ArrayHash TableSliding WindowPrefix Sum 50.3%
617 Merge Two Binary Trees TreeDepth-First SearchBreadth-First SearchBinary Tree 78.4%
373 Find K Pairs with Smallest Sums ArrayHeap (Priority Queue) 38.4%
662 Maximum Width of Binary Tree TreeDepth-First SearchBreadth-First SearchBinary Tree 40.4%
103 Binary Tree Zigzag Level Order TreeBreadth-First SearchBinary Tree 54.7%
Traversal
104 Maximum Depth of Binary Tree TreeDepth-First SearchBreadth-First SearchBinary Tree 72.8%
List
653 Two Sum IV - Input is a BST Hash TableTwo PointersTreeDepth-First SearchBreadth-First 59.3%
SearchBinary Search TreeBinary Tree
1334 Find the City With the Smallest Dynamic ProgrammingGraphShortest Path 52.5%
Number of Neighbors at a
Threshold Distance
Rotated
1829 Maximum XOR for Each Query ArrayBit ManipulationPrefix Sum 76.6%
United States