Uber Interview Questions
Curated from verified interview reports: a CodeSignal-style Online Assessment-heavy slate plus algorithmic Coding rounds - graphs, palindromes, greedy/DP optimization, and string processing.
17 real interview questions reported from Uber Software Engineer interviews (Coding, OA rounds): 1 easy, 11 medium, 5 hard. Each question shows its interview round and how often it was reported, and coding questions come with runnable tests.
Uber Coding round questions (7)
- Annotate First Pattern Match - Easy, free preview
Scan each word for the first matching pattern and bracket only that first hit. - Next Palindrome Number - Medium, free preview
Build the next palindrome above a number given as a decimal string - the least one that is strictly bigger. - Palindrome Paths From Query - Hard
For each query on a tree, decide whether the letters found along the path between two nodes could be reordered to spell a palindrome. - Process CPU Time Calculator - Medium
Compute each process name’s exclusive CPU time from nested enter/exit logs. - Straight Line Sequence Search - Medium
Search for a word that must continue in one fixed direction across the grid. - Unimodal Cost Function Minimum - Medium
Run a continuous search over a convex quadratic and return a point that lies within the given tolerance of its minimizer. - Weight Partition Check - Medium
Decide whether some subset of distinct weights adds exactly to the target capacity.
Uber OA round questions (10)
- OA [CodeSignal] Adventure Levels - Hard
For every starting level, compute how many consecutive stages you can clear before your energy check fails. - OA [CodeSignal] Balanced Numbers in Permutation - Hard
For every k, decide whether the values 1..k occupy one contiguous block inside the permutation. - OA [CodeSignal] Count Palindrome Paths in Tree - Hard
Count node pairs whose path characters have at most one odd frequency. - OA [CodeSignal] Final Prices After Discount - Medium
Replace each price with its discounted value, where the discount is the nearest following price that does not exceed it. - OA [CodeSignal] Jump Game - Medium
Maximize your landing-score sum while moving by one step or by jumps whose length ends in 3. - OA [CodeSignal] Longest Subsequence With Limited Sum - Medium
Sort the numbers once and answer each query with a prefix-sum upper bound. - OA [CodeSignal] Minimum Edge Reversal Root - Hard
Choose the tree root that minimizes how many directed edges must be reversed to point outward. - OA [CodeSignal] Minimum Operation To Reduce n To 0 - Medium
Reach zero in the fewest moves by adding or subtracting powers of two. - OA [CodeSignal] Prime Jumps - Medium
Maximize the landing-score sum while jumping by 1 or by prime distances that end in digit 3. - OA [CodeSignal] Shortest Good Subarray - Medium
Find the length of the shortest contiguous window holding k or more different integers.