Skip to content

Uber interview guide

Rides, Eats and Freight marketplace. Interviews: CodeSignal or HackerRank OA, medium-hard coding heavy on graphs and union-find, machine-coding LLD, hiring manager round. Updated October 2026.

Uber at a glance
Category Big Tech
Intern level Software Engineering Intern (summer; US Fall and Winter co-ops; 6-month SDE interns in India with PPO). Uber Career Prep and UberSTAR are listed as early-talent programs.
New grad level L3 (Software Engineer I)
0 to 3 years L3 Software Engineer I for 0 to about 2 yrs; L4 Software Engineer II for roughly 2 to 5 yrs (Levels.fyi lists L3 typical experience as 1 to 2 years, so '1 to 2 years' on an Engineer I posting does not rule out new grads). Senior is 5a.
Online assessment CodeSignal (US new grad and SWE II; India SDE-1 in 2025) and HackerRank (India: a 2025 Bangalore L4 OA of 4 questions in 90 minutes, India SDE-1 and intern OAs in 2026; HackerRank links also used for US 2026 intern interviews) : US: GCA-style, 4 questions of increasing difficulty. India: 3 questions in 60 to 65 minutes, medium to hard (greedy, binary search, prefix sums, 2D DP, graphs and MST, DSU, bitwise OR/XOR tricks, monotonic stack). Some L4 OAs are 2 medium-hard questions.
Coding rounds New grad: phone screen plus 2 coding rounds in the loop. India SDE-1: BPS plus 1 DSA round plus 1 LLD round. L4: 2 coding-type rounds plus LLD and HLD.
Behavioral Uber values (careers values page, archived Nov 2025): Go get it; Trip obsessed; Build with heart; Stand for safety; See the forest and the trees; One Uber; Great minds don't think alike; Do the right thing. Period. The onsite behavioral round is 'Collaboration and Leadership' with the hiring manager (75 minutes per interviewing.io). One US candidate structured stories with the CARL framework (Context, Action, Result, Learning).
Timeline interviewing.io and Aced both estimate 4 to 6 weeks, longer with team matching. India SDE-1 off-campus (2025): OA on Jun 15, elimination round on Jun 22, loop within days, offer later accepted. US L4 (Sep 2025): phone screen to onsite in 2 days, recruiter reply 3 days after debrief. SDE II (location not stated): about 2 months end to end (May 2026). US new grad (Jun 2026): phone screen result in 2 days, then 2+ weeks of silence after the final onsite amid hiring-freeze talk. Recruiting season: US intern and new grad OAs from August to December; India campus drives July to September.
New grad pay Levels.fyi US software engineer data (page read Oct 4, 2026): L3 Software Engineer I about $204K total comp (base $153K, first-year stock $29.9K, bonus plus sign-on $20.6K); L4 Software Engineer II about $271K (base $182K, first-year stock $74.9K). India (Levels.fyi USD figures at the site rate of about 94.5 INR/USD): L3 about 37 lakh INR, L4 about 71 lakh. Reported offers: India Software Engineer I (Aug 2026) base 23 lakh, about 37.5 lakh total; India 6-month SDE intern stipend 1.87 lakh INR per month (Feb 2026); US L4 with 2.5 YOE initial TC $310K year 1, negotiated to $335K year 1 (Sep 2025).
Official links Careers, Students, Official interview prep, Values

Interview process

New grad

  1. Apply. Apply on jobs.uber.com (University team filter). Uber's official hiring page lists: apply, talent team conversation, hiring manager chat, technical interview, functional exercise (role-dependent), team interview.
  2. Online assessment. US: CodeSignal, General Coding Assessment style with 4 questions (two easy, one tricky implementation, one algorithmic); solving 3 of 4 has been enough (US SWE II reports, Sep to Oct 2025). India 2025: CodeSignal, 3 medium to hard questions in 60 minutes, run in candidate batches and scored out of 600. India 2026: HackerRank (Jan to Feb 2026 reports), 2 to 3 questions in 65 minutes; some candidates get a 'waitlist' email after the OA (Mar 2026).
  3. Technical phone screen / BPS. US: 60 minute live coding screen, usually one LeetCode medium style design-a-class problem with follow-ups (Sep 2026 new grad screen ran in a Jupyter Notebook, with a shadow interviewer). India: 'BPS' (business phone screen) elimination round of 1 hour, 45 minutes coding plus 15 minutes high-level design or project discussion.
  4. Virtual onsite (business interviews). New grad loops are about 3 one-hour interviews: coding (DSA), a second coding round ('Depth in Specialization' for US backend new grads was a standard LeetCode question; India SDE-1 gets LLD or design instead), and a hiring manager behavioral round called Collaboration and Leadership. Coding rounds expect production-quality, running code.
  5. Debrief, team match, offer. Panel debrief; interviewing.io says decisions aim to be unanimous and one strong no-hire usually rejects. Results range from 3 days to several weeks; mid-2026 reports describe paused onsites and closed roles after a hire decision.

Intern

  1. Apply. US summer SWE intern postings plus Fall and Winter co-ops; India runs on-campus summer and 6-month intern drives. Uber Career Prep (first and second years) interviews include a behavioral and a technical part (Nov 2025 report).
  2. Online assessment. 2027 summer intern (college drive, Jul 2026; platform and country not stated): 3 coding questions in 65 minutes (city delivery cost queries, trucks colliding on a lane, k-th employee to receive data in a hierarchy). India 6-month intern (Feb 2026): HackerRank, 3 questions in 65 minutes, partial credit on the hard one still advanced. US 2026 interns: one Northeast applicant applied Nov 18, got the OA Nov 24, scored full marks on two problems and 9 of 15 on the third, and was invited to final rounds on Dec 5, 2025.
  3. Technical interviews. US 2026 summer: two 1-hour technical interviews on the same day, both on HackerRank links, no separate behavioral first. India 6-month intern: two rounds shaped as intro, about 10 minutes of behavioral (teamwork, conflict, decisions), then one DSA problem and discussion. US Fall 2026 co-op: 2 technical rounds; some candidates heard system design may appear.
  4. Team matching. After passing, interns go to team matching; a 2026 PhD ML intern was told Uber's match rate is effectively 100% (Reddit comment, unconfirmed). PhD ML intern loop: Round 1 LeetCode medium to hard, Round 2 code a classic ML model (k-NN, k-means, decision tree, regression) with follow-ups.

With 1 to 3 years of experience

L4 (Software Engineer II) loops add rounds: OA (CodeSignal in the US, HackerRank in India, 2 to 4 questions), a phone screen or BPS, then 4 to 5 interviews: DSA (often union-find or graphs), Depth in Specialization or LLD machine coding with running code in 60 minutes (Splitwise, parking lot, circuit breaker, pub-sub queue, in-memory file system, train-platform scheduler), HLD (restaurant recommendation with geohash, stock price alerts, grocery cart management, trending items page), a hiring manager round, and sometimes a bar raiser. A 2026 candidate quoted the official Depth in Specialization prep guide: day-to-day backend coding, implementing something from scratch, modifying an existing codebase, and discussing how to take it to production. Expect concurrency and scale follow-ups even in DSA rounds.

Online assessment

  • Platform: CodeSignal (US new grad and SWE II; India SDE-1 in 2025) and HackerRank (India: a 2025 Bangalore L4 OA of 4 questions in 90 minutes, India SDE-1 and intern OAs in 2026; HackerRank links also used for US 2026 intern interviews)
  • Format: US: GCA-style, 4 questions of increasing difficulty. India: 3 questions in 60 to 65 minutes, medium to hard (greedy, binary search, prefix sums, 2D DP, graphs and MST, DSU, bitwise OR/XOR tricks, monotonic stack). Some L4 OAs are 2 medium-hard questions.
  • Notes: Partial solutions often still advance (3 of 4 solved; 9 of 15 test cases on Q3). India 2025 OAs were run in timed group batches and proctored (camera plus screen), with complaints about cheating and 'waitlist' emails after the OA. Problems are framed in Uber domains (drivers, zones, deliveries, trucks).

Prepare with How to pass an OA and compare formats in OA formats by company.

Coding rounds

  • Rounds: New grad: phone screen plus 2 coding rounds in the loop. India SDE-1: BPS plus 1 DSA round plus 1 LLD round. L4: 2 coding-type rounds plus LLD and HLD.
  • Style: LeetCode medium to hard, usually wrapped in an Uber scenario with 2 to 3 escalating follow-ups (2D to 3D, then union-find; static k to per-station k with Dijkstra; then 10,000 concurrent requests). Heavy on graphs, BFS/DFS, union-find, heaps, sliding window with deques, intervals, binary search, and design-a-class problems over streams. Recent Uber-tagged problems repeat (First Unique Number in Feb 2025 and Sep 2026).
  • Environment: CodeSignal IDE for US screens and onsite rounds (interviewing.io), HackerRank links for some 2025 to 2026 rounds, a Jupyter Notebook in one Sep 2026 US new grad screen; Zoom or Teams video. You choose the language. Code is expected to compile and run against tests you write.
  • Graded on: Working, production-quality code; reasoning and communication more than memorized answers (a 2026 intern was selected with an incomplete solution after strong reasoning); edge cases; complexity; handling follow-ups. Uber's hiring page: 'We care as much about how you solve problems as the solution itself.'
  • Reported focus topics: Union-find (DSU) with path compression and union by rank, Graphs: BFS/DFS, multi-source BFS, Dijkstra, topological sort, MST, Grids and islands (including dynamic additions), Heaps and sliding window with monotonic deques, Intervals and room scheduling, Binary search on the answer, Design-a-class over streams and grids (first unique ID in a stream, open-restaurant counts and delivery zones, meeting-room booking), Machine-coding LLD with design patterns and concurrency, HLD with geospatial indexing (geohash, quadtree) and real-time alerts, Uber-tagged LeetCode, last 3 months (snehasishroy/leetcode-companywise-interview-questions, 8.2K stars, data as of July 12, 2026): Number of Islands II, First Unique Number, Squares of a Sorted Array, Construct Quad Tree, Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit, Minimum Edge Reversals So Every Node Is Reachable, The Earliest Moment When Everyone Become Friends, Bus Routes, Alien Dictionary, Find the Closest Palindrome, Jugal's 60-day company-wise DSA plan tags Uber with graphs (Redundant Connection, Accounts Merge, Cheapest Flights Within K Stops, Network Delay Time) and greedy or heaps (IPO, Car Pooling, Gas Station, Jump Game II, Find Median from Data Stream): https://jugaldb.substack.com/p/company-wise-dsa-patterns

Run every practice problem through the 45-minute framework and the code quality rubric.

What they ask (data)

Based on 71 distinct problems tagged to Uber in the last 6 months (4 in the last 30 days, 31 in the last 3 months, 364 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.

Difficulty mix (last 6 months): Medium 56%, Hard 37%, Easy 7%

Most tagged topics (share of problems): Array 62%, Breadth-First Search 31%, Depth-First Search 28%, Sorting 24%, Hash Table 21%, Binary Search 18%, String 17%, Matrix 15%, Design 15%, Union-Find 14%

Most frequent problems

Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.

# Problem Difficulty Last seen Topics
1 Number of Islands II Hard 30 days Array, Hash Table, Union-Find
2 Find the Safest Path in a Grid Medium 30 days Array, Binary Search, Breadth-First Search, Union-Find
3 Minimum Number of Refueling Stops Hard 30 days Array, Dynamic Programming, Greedy, Heap (Priority Queue)
4 Maximize Sum of Weights after Edge Removals Hard 30 days Dynamic Programming, Tree, Depth-First Search, Sorting
5 First Unique Number Medium 3 months Array, Hash Table, Design, Queue
6 Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Medium 3 months Array, Queue, Sliding Window, Heap (Priority Queue)
7 Minimum Edge Reversals So Every Node Is Reachable Hard 3 months Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory
8 Bus Routes Hard 3 months Array, Hash Table, Breadth-First Search
9 Construct Quad Tree Medium 3 months Array, Divide and Conquer, Tree, Matrix
10 Squares of a Sorted Array Easy 3 months Array, Two Pointers, Sorting
11 The Earliest Moment When Everyone Become Friends Medium 3 months Array, Union-Find, Sorting
12 Alien Dictionary Hard 3 months Array, String, Depth-First Search, Breadth-First Search
13 Final Prices With a Special Discount in a Shop Easy 3 months Array, Stack, Monotonic Stack
14 Number of Islands Medium 3 months Array, Depth-First Search, Breadth-First Search, Union-Find
15 Kth Smallest Element in a BST Medium 3 months Tree, Depth-First Search, Binary Search Tree, Binary Tree
16 Word Search Medium 3 months Array, String, Backtracking, Depth-First Search
17 Leftmost Column with at Least a One Medium 3 months Array, Binary Search, Matrix, Interactive
18 Making A Large Island Hard 3 months Array, Depth-First Search, Breadth-First Search, Union-Find
19 Find the Closest Palindrome Hard 3 months Math, String
20 Shuffle an Array Medium 3 months Array, Math, Design, Randomized
21 Split Array Largest Sum Hard 3 months Array, Binary Search, Dynamic Programming, Greedy
22 Minimum Operations to Reduce an Integer to 0 Medium 3 months Dynamic Programming, Greedy, Bit Manipulation
23 Find Peak Element Medium 3 months Array, Binary Search
24 Insert Delete GetRandom O(1) Medium 3 months Array, Hash Table, Math, Design
25 Word Search II Hard 3 months Array, String, Backtracking, Trie
26 Time Based Key-Value Store Medium 3 months Hash Table, String, Binary Search, Design
27 Make Lexicographically Smallest Array by Swapping Elements Medium 3 months Array, Union-Find, Sorting
28 Merge Intervals Medium 3 months Array, Sorting, Quicksort
29 Maximum Number of Points From Grid Queries Hard 3 months Array, Two Pointers, Breadth-First Search, Union-Find
30 Binary Searchable Numbers in an Unsorted Array Medium 3 months Array, Binary Search, Stack, Monotonic Stack
31 Count Paths That Can Form a Palindrome in a Tree Hard 6 months Hash Table, Bit Manipulation, Tree, Depth-First Search
32 Number of Wonderful Substrings Medium 3 months Hash Table, String, Bit Manipulation, Prefix Sum
33 Design Hit Counter Medium 6 months Array, Binary Search, Design, Queue
34 LRU Cache Medium 6 months Hash Table, Linked List, Design, Doubly-Linked List
35 Course Schedule II Medium 6 months Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort
36 Best Time to Buy and Sell Stock Easy 6 months Array, Dynamic Programming
37 Evaluate Division Medium 6 months Array, String, Depth-First Search, Breadth-First Search
38 Course Schedule Medium 6 months Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort
39 Design In-Memory File System Hard 6 months Hash Table, String, Design, Trie
40 Exam Room Medium 6 months Design, Heap (Priority Queue), Ordered Set
41 Meeting Rooms II Medium 6 months Array, Two Pointers, Greedy, Sorting
42 Roman to Integer Easy 6 months Hash Table, Math, String
43 Search in Rotated Sorted Array Medium 6 months Array, Binary Search
44 Serialize and Deserialize Binary Tree Hard 6 months String, Tree, Depth-First Search, Breadth-First Search
45 Shortest Bridge Medium 6 months Array, Depth-First Search, Breadth-First Search, Matrix
46 Shortest Path to Get All Keys Hard 6 months Array, Bit Manipulation, Breadth-First Search, Matrix
47 Meeting Rooms III Hard 6 months Array, Hash Table, Sorting, Heap (Priority Queue)
48 Rotting Oranges Medium 6 months Array, Breadth-First Search, Matrix
49 Find Median from Data Stream Hard 6 months Two Pointers, Design, Sorting, Heap (Priority Queue)
50 Maximum Number of Alloys Medium 6 months Array, Binary Search

Signature problems

Problems where Uber accounts for a large share of all recent tags across companies. These are the most Uber-specific questions in the data.

# Problem Difficulty Last seen Topics
1 Number of Islands II Hard 30 days Array, Hash Table, Union-Find
2 Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Medium 3 months Array, Queue, Sliding Window, Heap (Priority Queue)
3 First Unique Number Medium 3 months Array, Hash Table, Design, Queue
4 Alien Dictionary Hard 3 months Array, String, Depth-First Search, Breadth-First Search
5 Construct Quad Tree Medium 3 months Array, Divide and Conquer, Tree, Matrix
6 Minimum Edge Reversals So Every Node Is Reachable Hard 3 months Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory
7 Find the Safest Path in a Grid Medium 30 days Array, Binary Search, Breadth-First Search, Union-Find
8 The Earliest Moment When Everyone Become Friends Medium 3 months Array, Union-Find, Sorting
9 Final Prices With a Special Discount in a Shop Easy 3 months Array, Stack, Monotonic Stack
10 Leftmost Column with at Least a One Medium 3 months Array, Binary Search, Matrix, Interactive
11 Find the Closest Palindrome Hard 3 months Math, String
12 Making A Large Island Hard 3 months Array, Depth-First Search, Breadth-First Search, Union-Find
13 Word Search II Hard 3 months Array, String, Backtracking, Trie
14 Shuffle an Array Medium 3 months Array, Math, Design, Randomized
15 Maximize Sum of Weights after Edge Removals Hard 30 days Dynamic Programming, Tree, Depth-First Search, Sorting
16 Count Paths That Can Form a Palindrome in a Tree Hard 6 months Hash Table, Bit Manipulation, Tree, Depth-First Search
17 Maximum Number of Points From Grid Queries Hard 3 months Array, Two Pointers, Breadth-First Search, Union-Find
18 Binary Searchable Numbers in an Unsorted Array Medium 3 months Array, Binary Search, Stack, Monotonic Stack
19 Number of Wonderful Substrings Medium 3 months Hash Table, String, Bit Manipulation, Prefix Sum
20 Shortest Bridge Medium 6 months Array, Depth-First Search, Breadth-First Search, Matrix

Reported in 2025 to 2026 interviews

Questions candidates said they got, each linked to the post where it was reported.

Question Role When Source
post(id) and getEarliestSingleVisit(): earliest ID posted exactly once (First Unique Number) New grad SWE phone screen, US 2026-09 post
OA: trucks on a lane swap velocities on collision; when does the last truck leave (similar to Last Moment Before All Ants Fall Out of a Plank) SWE intern 2027 OA, college drive (country not stated) 2026-07 post
OA: minimum delivery cost between cities where moving to the unique closest city costs 1, answered for many queries SWE intern 2027 OA, college drive (country not stated) 2026-07 post
Earliest timestamp when all users are connected through shared rides (union-find), follow-up with 'cancel ride' removals SDE I (location not stated; elimination-round format matches India loops) 2026-02 post
Microservice restart cycles: services start only when dependencies are up, scanned 0 to N-1 per cycle; minimum cycles or impossible SDE I (location not stated; elimination-round format matches India loops) 2026-02 post
LLD: in-memory file system with mkdir, pwd and cd (similar to Design In-Memory File System) SDE I (location not stated; elimination-round format matches India loops) 2026-02 post
Grid with spreading poisonous gas and walls: maximum time you can wait at (0,0) and still reach (n-1,m-1) (multi-source BFS plus binary search) 6-month SDE intern with PPO, India 2026-02 post
OA: k-th largest subarray bitwise OR; index of k-th next greater element for every index; MST of a complete graph with 0/1 edge weights SDE 1 OA (location not stated) 2026-02 post
OA: zones connected when gcd of signatures > 1, return each zone's cluster size (similar to Largest Component Size by Common Factor) SWE I OA (disqualification round, 65 minutes) 2026-01 post
Alien Dictionary (phone screen) L4 SWE II, US, 2.5 YOE 2025-09 post
Find the Closest Palindrome (bar raiser DSA, follow-ups until time ran out) L4 SWE II, US, 2.5 YOE 2025-09 post
Design a restaurant recommendation system by location, then tighten latency (geohash, quadtree, sharding) L4 SWE II, US, 2.5 YOE 2025-09 post
openRestaurant(r, c) and countDeliveryZones() on a grid; interviewer wanted union-find (Number of Islands II style) SWE II backend, US (Grocery org) 2025-10 post
scheduleMeeting(start, end) across office rooms; follow-ups on 10,000 concurrent requests and binary search over sorted bookings SWE II backend, US (Grocery org) 2025-10 post
Evaluate Division, follow-up: 10 million queries to this service, how do you speed up lookups? SWE II, US (Marketplace onsite) 2025-01 post
Evaluate Division, follow-up: 10 million queries to this service, how do you speed up lookups? SWE II, US (Marketplace onsite) 2025-01 post
Longest subarray with absolute difference at most limit, framed as drivers and cabs (four approaches down to monotonic deques) SDE-2 (L4), Bangalore, 3 YOE 2025-09 post
Count islands in 2D, then 3D, then implement a 2D union-find L4 SDE-2 backend (offer) 2026-03 post
LLD: circuit breaker that opens when request count exceeds a threshold, with OPEN, CLOSED and HALF_OPEN states and concurrency questions L4 SDE-2 backend (offer) 2026-03 post
Minimum time to burn an undirected tree when you may start the fire at any node L4 screening, Bangalore hiring drive 2026-02 post
Phone screen like Minimum Number of Taps to Open to Water a Garden; onsite Maximum Points You Can Obtain from Cards and Cheapest Flights Within K Stops; parking lot LLD; stock alert HLD L4, Bangalore, 3 YOE (offer) 2025-05 post
Longest Path With Different Adjacent Characters; LLD pub-sub queue with ordered processing Uber loop via referral (reject) 2025-10 post
Max XOR-subtree scores of two non-overlapping subtrees in a rooted tree SDE-1, 2026 grad, India 2026-05 post
post(userId) and getFirstOneTimeUser() over a visitor stream (First Unique Number), same problem as the Sep 2026 new grad screen Phone interview (level not stated) 2025-02 post
Engineers in a circle play rock-paper-scissors: minimum changes so no two neighbors pick the same option (circular DP) SDE-1, India (65 LPA CTC role) 2026-03 post
Add X to any chosen subsequence once to maximize the sum of XORs of adjacent elements (DP on add or not) SDE-1, India (round not stated) 2026-05 post
Find the k-th smallest square of a sorted array in better than O(k) (Squares of a Sorted Array variant) SDE1 2025-11 post
LLD with runnable Java: train-platform management (assign trains to platforms, query train at a platform or platform of a train at a time) SDE-2 (L4), Bangalore, 3 YOE 2025-09 post
Shared-cab logs: count running cabs after each log, then the timestamp when everyone is in one cab (DSU coded from scratch) SDE-2 (L4), Bangalore, 3 YOE 2025-09 post
Round 2: code a classic ML model from scratch (k-NN, k-means, decision tree, linear or logistic regression), then follow-ups on batch processing and deriving gradient descent and the BCE loss PhD SWE ML intern, 2026 (Round 1 was a LeetCode medium-hard) 2026-01 post

Beyond LeetCode

Machine-coding LLD in 60 minutes with running code and tests (Splitwise, parking lot, circuit breaker with OPEN, CLOSED and HALF_OPEN states, pub-sub queue with ordering, in-memory file system with mkdir, cd and pwd). 'Depth in Specialization' coding round tailored to backend, frontend (for example Promise.all, widgets) or mobile (Android or iOS depth). India BPS elimination round. PhD ML intern round where you code a classic ML model from scratch. Bar raiser for experienced hires (reverse system design or deep project introspection).

System design

New grads: usually no standalone HLD round in the US, but India SDE-1 loops include 15 minutes of HLD in the BPS and a design round (design a messaging app with DB schema; LLD for a Zomato-style food delivery system with classes, tables and consistency). Clarify LLD vs HLD early: one 2025 SDE-1 candidate wrote classes when interviewers wanted a real-world schema and called it their worst round, though they still got the offer. L4: separate machine-coding LLD with running code and HLD. Hello Interview's free 'Design Uber' breakdown covers the classic ride-matching prompt.

Start with who needs system design, then the framework.

Behavioral

Framework: Uber values (careers values page, archived Nov 2025): Go get it; Trip obsessed; Build with heart; Stand for safety; See the forest and the trees; One Uber; Great minds don't think alike; Do the right thing. Period. The onsite behavioral round is 'Collaboration and Leadership' with the hiring manager (75 minutes per interviewing.io). One US candidate structured stories with the CARL framework (Context, Action, Result, Learning). (official page)

What they look for:

  • Ownership of end-to-end delivery of a project
  • Collaboration across teams and being a team player
  • Handling conflict and critical feedback well
  • A champion mindset on bad days (Go get it)
  • Judgment on trade-offs and attention to details that matter
  • Specific, verifiable stories (a 2026 hiring manager kept asking for more detail)

Questions to prepare:

  • Tell me about a time you received critical feedback from your manager and how you handled it
  • Tell me about a time you worked with someone outside your team
  • Tell me about a conflict with a coworker and how you solved it
  • How do you handle burnout on your team, and how do you stay afloat when things are stressful?
  • Design the HLD of the most complex thing you have built (hiring manager round, SWE II)
  • Tell me about a project conflict or a decision you had to make as a team (intern round)
  • What project are you most proud of?

Build your answers with the story bank. Company detail: behavioral guide.

Tips

  • Drill union-find until you can write it from memory in 5 minutes; it shows up in OAs, phone screens and onsites across 2025 to 2026 reports.
  • Solve the Uber-tagged LeetCode problems from the last 3 to 6 months; First Unique Number was reported in Feb 2025 and again in a Sep 2026 new grad screen.
  • Expect every DSA problem to get scale or concurrency follow-ups (10,000 concurrent bookings, 10 million queries); think out loud about locks and data size.
  • In machine coding, get to running code early, then refactor and add tests; interfaces and extensible classes score well.
  • Ask at the start whether a design round is LLD (classes) or HLD (schema, services); an SDE-1 candidate who misread it called that round their worst (they still got the offer).
  • Read the recruiter's prep guide for 'Depth in Specialization'; backend new grads got standard LeetCode, mobile candidates get platform depth.
  • Prepare 6 to 8 detailed stories for Collaboration and Leadership; hiring managers push for specifics to filter out invented stories.
  • Keep other processes moving: mid-2026 reports describe paused onsites and roles closed after a hire decision.

4-week plan for Uber

Do this after you finish a core list like Grind 75 or NeetCode 150.

  • Week 1: Solve problems 1 to 20 from the most frequent list. Time-box each at 30 minutes.
  • Week 2: Solve problems 21 to 40. Re-solve any you failed in week 1 without looking.
  • Week 3: Solve the signature problems and every reported question above. Do 2 timed mock interviews.
  • Week 4: Write 8 stories for the Uber values (careers values page, archived Nov 2025): Go get it; Trip obsessed; Build with heart; Stand for safety; See the forest and the trees; One Uber; Great minds don't think alike; Do the right thing. Period. The onsite behavioral round is 'Collaboration and Leadership' with the hiring manager (75 minutes per interviewing.io). One US candidate structured stories with the CARL framework (Context, Action, Result, Learning). round. Do 2 full mock loops. Review the online assessment and system design notes above.

Sources

Watch out: Most detailed public reports are India SDE-1, India and US SWE II; US new grad reports are fewer, so the US new grad loop combines a Sep 2026 phone-screen report, a May 2026 Reddit comment on the backend Depth in Specialization round, interviewing.io and Aced. OA vendor differs by region and season (CodeSignal vs HackerRank). The official values page now redirects to 'Life at Uber'; the values list comes from the Nov 2025 Wayback snapshot. Uber Career Prep and UberSTAR appear on the official early-talent page, but no current posting was verified. Hiring pauses (Jun 2026) are candidate reports, not official statements. Reddit claims (100% intern match rate 'as far as I know', HR layoffs) are unverified comments. [UNVERIFIED] Glassdoor snippets seen only in search results: US new grad CodeSignal OA about 1.5 weeks after applying, interview invite about a month after the OA, a 1-hour LeetCode screen on Zoom, and a 3-round loop of 2 LeetCode mediums plus behavioral; Glassdoor pages could not be fetched. LeetCode Discuss URLs were confirmed through LeetCode's GraphQL API because the pages block automated browsers; Reddit threads were read through Reddit's RSS feeds. jobs.uber.com pages and the Uber engineering blog return 403/406 to plain curl (bot protection) but loaded with content through a browser-style fetch on Oct 4, 2026; www.uber.com/us/en/careers/ now 301-redirects to jobs.uber.com. Fact-check Oct 4, 2026: several LeetCode posts do not name a country; roles now say 'location not stated' where India was only inferred. The Evaluate Division follow-up was 10 million queries, not equations. Added 2025 to 2026 questions from SDE-1, SDE-2 and PhD ML intern reports.

Next: All companies