I recently went through the Uber interview process and got an offer. Sharing my experience so it can help others prepare better.
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^5Key Idea
(u, v) into (min(u,v), max(u,v))Part 2: Design Discussion
Discussed one feature from my past work
Focus was on:
Problem similar to Dungeon Game
Focus:
Design a File System
Variation: support wildcard (*) searches
Expectations:
Topics discussed:
Behavioral + practical thinking:
Hope this helps. Happy to answer questions 👍