TechJobs
Hiring
Remote
Experiences
Post Opp.
/
Interview Exp.
Toggle Menu
← Back to all experiences
Rejected
Uber Interview Experience
SDE-2
Process Overview
Recent
Interview Rounds Breakdown
Screening (DSA)
Graphs
Data Structures
The interviewer required an optimized solution rather than a brute-force approach.
Proficiency in Disjoint Set Union (DSU), specifically path compression and union by rank, was essential for solving the problem efficiently.
Questions Asked
Number of Islands II (Dynamic graph connectivity)
Graphs
DSU
Solve
Backend Problem Solving
Dynamic Programming
Trees
The problem was a variation of the Optimal Binary Search Tree (OBST) problem.
The candidate needed to identify the underlying DP structure to minimize the weighted cost of the tree.
The interviewer evaluated the ability to translate a business-logic cost formula into a mathematical DP formulation.
Questions Asked
API + Data Structure Design
Data Structures
API Design
Time Complexity
The candidate over-engineered the solution by focusing on LLD (Low-Level Design) patterns instead of meeting the O(1) time complexity constraint.
The interviewer prioritized the correct choice of data structures (HashMaps/Reverse mappings) over clean code aesthetics.
High-Level Design (In-Memory Cache)
System Design
Concurrency
Caching
The candidate incorrectly applied the CAP theorem to a single-node system where it was not relevant.
The interviewer expected a focus on locking strategies, read-write contention, and eviction mechanics rather than distributed systems theory.
Key Takeaways & Advice
Candidate Advice
Time management under pressure is more critical than complex logic.
Clarity and correctness take precedence over code beauty.
Ensure the scope of the system design problem is understood before applying theoretical frameworks like CAP.
Treat interview failures as opportunities to identify gaps in technical depth.
Final Verdict
The candidate was unfortunately rejected.
Similar Experiences
Harness
SDE - 1 • 1-3 Years
Read Experience →
Tower Research LLC
SDE 1 (Backend Post Trade) • 1-3 Years
Read Experience →
Construct an Optimal Binary Search Tree given words and costs to minimize weighted depth.
Dynamic Programming
Trees
Solve
A major lesson was to solve for constraints first and refactor only if time permits.
Questions Asked
Design APIs for employee-manager relationships with O(1) operations for get, changeManager, and addEmployee.
Data Structures
API Design
The candidate learned to clarify the scope of the system (distributed vs. single-node) before applying high-level architectural patterns.
Questions Asked
Design an in-memory cache with support for eviction strategies and concurrency.
System Design
Caching
Solve
Preparation Tips
Practice DSU, DP, and classic CS problems.
Be ruthless about time complexity requirements.
Avoid over-engineering in coding rounds; prioritize functionality over clean code.
Think out loud and justify every decision made during the design process.