uber logo
Uber· SDE II

🚀 Uber Interview Experience (SDE II) – 6 Rounds

Posted
20 Apr 2026
508 reads

Summary

I interviewed for an SDE II role at Uber, went through six rounds (OA, BPS, coding, LLD, HLD, hiring manager) and received an offer.

How it went

🚀 Uber Interview Experience (SDE II) – 6 Rounds

I recently went through the Uber interview process and got an offer. Sharing my experience so it can help others prepare better.


🔹 1. Online Assessment (OA)

  • 2 DSA questions
  • One was based on minimum edge reversal in a graph (standard LeetCode-type problem)
  • Difficulty: Medium–Hard

🔹 2. BPS Round (Coding + Design Discussion)

Part 1: DSA Question

đź§Ş Biological Hazards Problem

You are given n chemicals labeled from 1 to n. Some pairs are dangerous and cannot coexist in the same experiment.

  • Two arrays:
    • poisonous[]
    • allergic[]
  • Each pair (poisonous[i], allergic[i]) cannot appear together.

👉 Task: Count the number of valid contiguous intervals [L, R] such that no interval contains both elements of any forbidden pair.

Constraints

  • 1 ≤ n, m ≤ 2 * 10^5

Key Idea

  • Convert each pair (u, v) into (min(u,v), max(u,v))
  • Track for each right endpoint the maximum left boundary restriction
  • Use a sliding window / two pointers approach
  • Maintain a running valid left boundary and count intervals efficiently

Part 2: Design Discussion

  • Discussed one feature from my past work
  • Focus was on:
    • Design decisions
    • Trade‑offs
    • Scalability

🔹 3. Coding Round

  • Problem similar to Dungeon Game
  • Focus:
    • DP optimization
    • Edge cases
    • Clean code

🔹 4. LLD Round

  • Design a File System
  • Variation: support wildcard (*) searches
  • Expectations:
    • Clean class design
    • Extensibility
    • Efficient search handling

🔹 5. HLD Round

  • Design a Real-time Monitoring System

Topics discussed:

  • Push vs Pull model
  • Service Mesh (e.g., Istio)
  • Time‑series database
  • Caching strategies
  • Aggregation (5 min / 10 min windows)
  • Dashboard design

🔹 6. Hiring Manager Round

Behavioral + practical thinking:

  • Past work and challenges
  • Feedback from peers/managers
  • Debugging approach
  • Ensuring feature quality (testing, monitoring)
  • Usage of AI tools in daily work

đź’ˇ Preparation Tips

  • Strong grip on DSA (especially sliding window, graph, DP)
  • Practice real‑world design discussions
  • Be clear and structured in LLD/HLD
  • Prepare behavioral answers with examples
  • Focus on communication and trade‑offs

Verdict: Selected

Hope this helps. Happy to answer questions 👍

Questions asked (1)

  1. 01

    Biological Hazards Problem

    Data Structures & Algorithms

    You are given n chemicals labeled from 1 to n. Some pairs are dangerous and cannot coexist in the same experiment.

    Two arrays are provided:

    • poisonous[]
    • allergic[] Each pair (poisonous[i], allergic[i]) represents a forbidden combination; the two chemicals cannot appear together.

    Task: Count the number of valid contiguous intervals [L, R] (where 1 ≤ L ≤ R ≤ n) such that no interval contains both elements of any forbidden pair.

    Constraints:

    • 1 ≤ n, m ≤ 2 * 10^5

    Approach Hint: Convert each forbidden pair (u, v) to (min(u,v), max(u,v)). For each right endpoint maintain the maximum left boundary restriction imposed by any pair that ends at or before this endpoint. Use a sliding window / two‑pointer technique to keep a running left boundary and sum the counts of valid intervals efficiently.

How they prepared

Strong grip on DSA (especially sliding window, graph, DP)

Practice real‑world design discussions

Be clear and structured in LLD/HLD

Prepare behavioral answers with examples

Focus on communication and trade‑offs

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Uber recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!