← Back to all experiences
Rejected
Uber Interview
SDE-2
Process Overview
- Recent
Interview Rounds Breakdown
Screening (DSA)
GraphsData 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)
Solve GraphsDSU
Backend Problem Solving
Dynamic ProgrammingTrees
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 StructuresAPI DesignTime 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 DesignConcurrencyCaching
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.