Uber Coding & Algorithms Interview Questions

Uber Coding & Algorithms interview questions center on practical problem solving at scale: expect timed coding exercises that mirror real engineering tasks rather than brainteasers. Interviews often use an online assessment (CodeSignal) and live 30–45 minute coding sessions on a whiteboard or shared editor, followed by deeper loop interviews for onsite or virtual rounds. What’s distinctive is the emphasis on clear, production-minded solutions that consider runtime and memory, edge cases, and how an approach would behave under Uber’s low-latency, geo-distributed constraints. For interview preparation, focus on algorithmic patterns (arrays, strings, trees, graphs, dynamic programming, hashing, sliding windows, and heaps) and on communicating trade-offs, complexity, and correctness as you code. Practice timed problems, run mock interviews, and rehearse explaining design choices and optimizations aloud. Senior candidates should also be ready to connect coding choices to system-level concerns like scaling and reliability. Good preparation shows up as concise planning, clean code, thoughtful test cases, and calm recovery from mistakes.

142 Questions 1 Company07.03.2026
Showing 20 results
Role
Uber logo
Uber
Medium
Software EngineerIntern

Last Truck to Leave a One-Dimensional Lane

Last Truck to Leave a One-Dimensional Lane Implement last_exit_time(lane_length, positions, velocities). Distinct trucks start at integer positions st...

Coding & Algorithms
24
0
429 people solved
Jul 3, 2026
Uber logo
Uber
Medium
Software EngineerIntern

Minimum Delivery Cost Between Cities

Minimum Delivery Cost Between Cities Implement minimum_delivery_costs(delivery_charges, queries). There are n cities indexed from 0 to n - 1, and city...

Coding & Algorithms
15
1
124 people solved
Jul 3, 2026
Uber logo
Uber
Medium
Software EngineerIntern

Kth Employee Reached in an Ordered Hierarchy

Kth Employee Reached in an Ordered Hierarchy Implement kth_recipients(boss, queries). Employees are numbered 0 through n - 1. boss[0] == -1; for every...

Coding & Algorithms
11
0
155 people solved
Jul 3, 2026
Uber logo
Uber
Medium
Software EngineerSenior+ Locked

Shortest Path in a Grid with Blocked Cells

This question tests a candidate's practical grasp of graph traversal algorithms applied to 2D grid problems, specifically BFS for unweighted shortest-...

Coding & Algorithms
0
0
10 people solved
Jun 19, 2026
Uber logo
Uber
Medium
Software EngineerSenior+

Solve stock profit and vertical tree traversal

You have a 60-minute coding interview with two algorithm questions: 1) Max profit from one stock trade - Input: an integer array prices, where prices[...

Coding & Algorithms
13
0
138 people solved
Feb 9, 2026
Uber logo
Uber
Medium
Software EngineerSenior+ Locked

Implement stream queries and bounded-difference subarrays

This question evaluates proficiency in data structures and algorithmic problem-solving, covering streaming uniqueness tracking (first-non-repeated ele...

Coding & Algorithms
9
0
60 people solved
May 8, 2026
Uber logo
Uber
Hard
Software Engineer Locked

Schedule Non-Overlapping Meetings Efficiently

This question evaluates understanding of interval scheduling and overlap detection, proficiency in selecting efficient data structures for dynamic ord...

Coding & Algorithms
9
0
66 people solved
May 2, 2026
Uber logo
Uber
Medium
Software Engineer Locked

Deep Equality of Two Records

This coding question tests a software engineer's ability to implement recursive structural comparison across nested, heterogeneous data types. It eval...

Coding & Algorithms
1
0
12 people solved
Jun 23, 2026
Uber logo
Uber
Medium
Software Engineer Locked

Design and Implement an LRU Cache

This question evaluates a candidate's ability to design and implement an LRU cache data structure with O(1) time complexity for both reads and writes....

Coding & Algorithms
0
0
9 people solved
Jun 8, 2026
Uber logo
Uber
Hard
Software Engineer Locked

Solve Wonderful Strings and Grid Queries

This question evaluates algorithm design and data-structure competencies through two problems: a parity-constrained minimum-cost string transformation...

Coding & Algorithms
3
0
26 people solved
May 13, 2026
Uber logo
Uber
Hard
Software Engineer Locked

Build Quadtree and Find Grid Words

This question evaluates divide-and-conquer tree construction and recursive spatial data structures for the quadtree task, and grid-based search and ba...

Coding & Algorithms
7
0
87 people solved
Jan 26, 2026
Uber logo
Uber
Medium
Software Engineer Locked

Choose root to minimize edge reversals

This question evaluates understanding of directed versus undirected graph representations, tree rooting, and optimization of edge orientations, testin...

Coding & Algorithms
6
0
110 people solved
Feb 11, 2026
Uber logo
Uber
Medium
Software EngineerSenior+

Quadtree for 2D Geospatial Points

Quadtree for 2D Geospatial Points Design and implement a point quadtree that stores geographic locations on a 2D plane and supports efficient axis-ali...

Coding & Algorithms
0
0
6 people solved
Jun 28, 2026
Uber logo
Uber
Medium
Software Engineer Locked

Solve BST and Grid Query Problems

This question evaluates understanding of binary search tree order-statistics and grid reachability under threshold constraints, testing competencies i...

Coding & Algorithms
5
0
43 people solved
Apr 19, 2026
Uber logo
Uber
Medium
Software Engineer Locked

Solve Several Algorithm Problems

This collection evaluates proficiency in string processing (longest palindromic substrings), graph connectivity and union‑find style concepts for 2D p...

Coding & Algorithms
4
0
58 people solved
Mar 17, 2026
Uber logo
Uber
Medium
Software Engineer

Design top-K tracker with linked lists

Design top-K tracker with linked lists Design a data structure that tracks the top-K most frequent keys in a stream. Support operations increment(key)...

Coding & Algorithms
12
0
100 people solved
Aug 1, 2025
Uber logo
Uber
Medium
Software Engineer

Solve BFS and grid tasks

The coding rounds included several algorithmic problems: 1. Threshold search with binary search: You are given floors 1..n and an API canOperate(floor...

Coding & Algorithms
12
0
91 people solved
Feb 22, 2026
Uber logo
Uber
Hard
Software Engineer Locked

Solve Two OA Algorithm Problems

These problems evaluate algorithmic optimization and graph connectivity competencies, specifically cost-constrained integer resource allocation for th...

Coding & Algorithms
2
0
52 people solved
Jan 7, 2026
Uber logo
Uber
Medium
Backend Engineer Locked

Replace Dashes With Nearest Letters

This question evaluates a candidate's competence in grid traversal, distance computation using Manhattan metrics, and handling tie-breaking rules incl...

Coding & Algorithms
0
0
10 people solved
May 25, 2026
Uber logo
Uber
Medium
Software Engineer

Enforce ordered execution across threads

Enforce ordered execution across threads Implement a class with three methods alpha(), beta(), and gamma() that may be called by three different threa...

Coding & Algorithms
8
0
83 people solved
Aug 1, 2025

Frequently Asked Questions

How difficult are Uber Coding & Algorithms interview questions?
Uber Coding & Algorithms interview questions are often rated medium to hard, with difficulty rising by level and role. For entry level positions you can expect many LeetCode medium problems and a few harder variations; for senior roles expect a heavier mix of challenging graph, dynamic programming, and optimization problems. Interviewers evaluate correctness, algorithmic choice, code quality, time and space complexity, and your ability to iterate under pressure. Performance is judged not only on solving the problem but on clear explanations, tradeoff awareness, and handling edge cases and follow-up optimizations.
What is the typical interview process and where do Coding & Algorithms questions appear?
Coding and algorithms show up across multiple stages of Uber's hiring funnel. Many candidates see an initial online assessment or screening task, followed by one or two technical phone or virtual interviews focused on coding. Onsite or loop interviews usually include two to three algorithmic coding rounds, sometimes a machine-coding or pair-programming exercise, plus system or design rounds for higher levels. Recruiters may also schedule a bar-raiser or hiring manager discussion. Expect to write working code while talking through your approach, and to face follow-up constraints or optimization prompts during the same session.
How should I schedule my preparation timeline for Uber Coding & Algorithms?
A focused timeline of three to twelve weeks works well depending on background and target level. Begin with two to four weeks strengthening fundamentals: arrays, strings, trees, graphs, hashing, sorting, and complexity analysis. Spend the next three to six weeks solving medium and hard problems, practising timed sessions and mock interviews. Reserve the final one to two weeks for system-level polishing: reviewing common patterns, running full mock interviews, and rehearsing clear explanations and edge-case testing. Adjust intensity if you are aiming for senior roles; add more systems and advanced algorithm practice accordingly.
What key subtopics in Coding & Algorithms should I focus on for Uber interviews?
Prepare core algorithmic areas that frequently appear: array and string manipulations, two pointers, sliding windows, hashing, sorting, trees and binary search trees, heaps, graphs (BFS, DFS, shortest paths), and dynamic programming. Also practice design of efficient data structures, complexity tradeoffs, recursion vs iterative solutions, and bit manipulation. Pay attention to implementation details such as null and boundary handling, memory constraints, and test-case generation. For some teams, geospatial, routing or pathfinding nuances are emphasized, so be comfortable mapping problems to appropriate graph or greedy strategies.
What standout tips and common pitfalls should I keep in mind for Uber coding interviews?
Communicate clearly: state assumptions, describe the plan, and verbalize complexity tradeoffs before coding. Start with a correct brute force then optimize, and validate with quick examples and edge cases. Manage time by setting micro-deadlines in the interview and avoid premature over-optimization. Common pitfalls include not asking clarifying questions, skipping tests, ignoring space constraints, and failing to explain design choices. For coding rounds, write clean, modular code and handle bounds and nulls explicitly. If stuck, outline alternatives and test partial solutions to demonstrate progress and problem-solving mindset.

Explore more Uber Coding & Algorithms interview questions

Real questions from candidate reports, grouped by role, topic and company.

By role
Other categories at Uber
Coding & Algorithms questions at other companies
Browse all