Uber software engineer interviews cover algorithms, data structures, system design, and coding problems drawn from real interview rounds.
OA [CodeSignal] Adventure Levels You start with initial energy K. You need to clear a series of adventure levels. For each level i: -...
OA [CodeSignal] Balanced Numbers in Permutation Given a permutation p of integers from 1 to n. A number k (where 1 <= k <= n) is called...
n nodes where each node has a lowercase English character c[i]. A path is palindromic if the characters along the path can...Input: Listthroughput[i] - Cost to scale up by 1 unit scalecost[i] You have a fixed...Input: Listprices: array of...Input: Arrayn. You can use either the lift or stairs. Lift: - Takes t1 time per floor -...Input: Given inputLongest Valid Container Nesting You are given a string consisting only of the characters {, }, [, ], (, ). These represent three levels...
Palindrome Paths From Query A disk stores hierarchical data in an undirected tree with tree_nodes nodes numbered from 0 to tree_nodes - 1,...
n users numbered 0 through n - 1 and a chronological list of interaction events. Initially, there are no active connections. Each event is a tuple (timestamp, operation, u, v):"add" activates an undirected connection between users u and v."remove" deactivates that connection.-1 if this never occurs. If n == 1, return 0, because the network is already connected before any events.All events are available before processing begins. Your algorithm must handle removals correctly; connectivity is not monotonic over time.Function signatureearliest_connected(n: int, events: list[tuple[int, str, int, int]]) -> int{
"n": 3,
"events": [
[2, "add", 0, 1],
[4, "remove", 1, 0],
[6, "add", 1, 2],
[9, "add", 0, 2]
]
}Output:9Explanation: At time
2, user 2 is isolated. At time 4, the only connection disappears. At time 6, user 0 is isolated. At time 9, connections 1–2 and 0–2 connect all three users. A union-find that ignores removals would incorrectly return 6.Example 2:Input:{
"n": 4,
"events": [
[1, "add", 0, 1],
[3, "add", 2, 3],
[5, "remove", 0, 1],
[7, "add", 1, 2]
]
}Output:-1Explanation: At time
3, there are two components: {0, 1} and {2, 3}. The connection 0–1 disappears before 1–2 appears. At time 7, user 0 remains isolated, so the graph never becomes connected.Constraints:1 <= n <= 200000.0 <= len(events) <= 200000.[1, 10^18] and are strictly increasing."add" or "remove".0 <= u, v < n and u != v.Scenario
Part 1 — Citywide coverage checks
event_id and action. An activate record also has row and col, encoded as decimal integer strings. A query record has no coordinates.activate enables a cell. Activating an already enabled cell is a no-op. query changes nothing.active_cells, components, and largest_component, where component size is measured in enabled cells. All three metrics are zero when coverage is empty.FRAGMENTED if components > 2. Emit THIN_SUPPLY if active_cells > 0 and largest_component < 3. These are planning-model labels, not claims about Uber's production policies. Return flags in lexicographic order.evaluate_coverage(records: list[dict[str, str]]). The return type is up to you; discuss your choice. The examples use a JSON list of snapshots.Example 1:
{
"records": [
{"event_id": "e0", "action": "query"},
{"event_id": "e1", "action": "activate", "row": "0", "col": "0"},
{"event_id": "e2", "action": "activate", "row": "0", "col": "1"},
{"event_id": "e3", "action": "activate", "row": "0", "col": "3"},
{"event_id": "e4", "action": "activate", "row": "1", "col": "0"},
{"event_id": "e5", "action": "activate", "row": "3", "col": "0"}
]
}[
{"event_id": "e0", "active_cells": 0, "components": 0, "largest_component": 0, "flags": []},
{"event_id": "e1", "active_cells": 1, "components": 1, "largest_component": 1, "flags": ["THIN_SUPPLY"]},
{"event_id": "e2", "active_cells": 2, "components": 1, "largest_component": 2, "flags": ["THIN_SUPPLY"]},
{"event_id": "e3", "active_cells": 3, "components": 2, "largest_component": 2, "flags": ["THIN_SUPPLY"]},
{"event_id": "e4", "active_cells": 4, "components": 2, "largest_component": 3, "flags": []},
{"event_id": "e5", "active_cells": 5, "components": 3, "largest_component": 3, "flags": ["FRAGMENTED"]}
]e4, cells (0,0), (0,1), and (1,0) form a component of size 3; (0,3) is separate. At e5, (3,0) creates a third component, exceeding the component cap of 2.Part 2 — Reversible coverage and pickup-zone readiness
evaluate_zoned_coverage(records: list[dict[str, str]], zones: list[dict[str, str]]), retaining every Part 1 behavior and flag:deactivate, with row and col fields. It disables the cell; disabling an already disabled cell is a no-op.zone_id, cells, and min_active. cells is a nonempty semicolon-separated list of distinct row,col coordinates, such as "0,0;0,1". min_active is a positive decimal integer no larger than the zone's number of cells.READY when this count is at least min_active, otherwise UNDER_COVERED. Zone readiness does not depend on connectivity, and zones may overlap.zone_id order. The examples place the unchanged Part 1 snapshot under global and add a zones list.Example 2:
{
"records": [
{"event_id": "r1", "action": "activate", "row": "0", "col": "0"},
{"event_id": "r2", "action": "activate", "row": "0", "col": "1"},
{"event_id": "r3", "action": "activate", "row": "0", "col": "2"},
{"event_id": "r4", "action": "deactivate", "row": "0", "col": "1"}
],
"zones": [
{"zone_id": "station", "cells": "0,0;0,1", "min_active": "2"}
]
}[
{"global": {"event_id": "r1", "active_cells": 1, "components": 1, "largest_component": 1, "flags": ["THIN_SUPPLY"]}, "zones": [{"zone_id": "station", "active_cells": 1, "min_active": 2, "status": "UNDER_COVERED"}]},
{"global": {"event_id": "r2", "active_cells": 2, "components": 1, "largest_component": 2, "flags": ["THIN_SUPPLY"]}, "zones": [{"zone_id": "station", "active_cells": 2, "min_active": 2, "status": "READY"}]},
{"global": {"event_id": "r3", "active_cells": 3, "components": 1, "largest_component": 3, "flags": []}, "zones": [{"zone_id": "station", "active_cells": 2, "min_active": 2, "status": "READY"}]},
{"global": {"event_id": "r4", "active_cells": 2, "components": 2, "largest_component": 1, "flags": ["THIN_SUPPLY"]}, "zones": [{"zone_id": "station", "active_cells": 1, "min_active": 2, "status": "UNDER_COVERED"}]}
]3 - 1 = 2 enabled cells in two singleton components. The station count falls from 2 to 2 - 1 = 1, below its minimum of 2. Two components do not exceed the fragmentation cap, but a largest component of 1 triggers THIN_SUPPLY.Example 3:
{
"records": [
{"event_id": "s1", "action": "activate", "row": "0", "col": "0"},
{"event_id": "s2", "action": "activate", "row": "0", "col": "2"},
{"event_id": "s3", "action": "activate", "row": "2", "col": "0"},
{"event_id": "s4", "action": "deactivate", "row": "9", "col": "9"},
{"event_id": "s5", "action": "query"}
],
"zones": [
{"zone_id": "airport", "cells": "0,0;0,1", "min_active": "2"}
]
}[
{"global": {"event_id": "s1", "active_cells": 1, "components": 1, "largest_component": 1, "flags": ["THIN_SUPPLY"]}, "zones": [{"zone_id": "airport", "active_cells": 1, "min_active": 2, "status": "UNDER_COVERED"}]},
{"global": {"event_id": "s2", "active_cells": 2, "components": 2, "largest_component": 1, "flags": ["THIN_SUPPLY"]}, "zones": [{"zone_id": "airport", "active_cells": 1, "min_active": 2, "status": "UNDER_COVERED"}]},
{"global": {"event_id": "s3", "active_cells": 3, "components": 3, "largest_component": 1, "flags": ["FRAGMENTED", "THIN_SUPPLY"]}, "zones": [{"zone_id": "airport", "active_cells": 1, "min_active": 2, "status": "UNDER_COVERED"}]},
{"global": {"event_id": "s4", "active_cells": 3, "components": 3, "largest_component": 1, "flags": ["FRAGMENTED", "THIN_SUPPLY"]}, "zones": [{"zone_id": "airport", "active_cells": 1, "min_active": 2, "status": "UNDER_COVERED"}]},
{"global": {"event_id": "s5", "active_cells": 3, "components": 3, "largest_component": 1, "flags": ["FRAGMENTED", "THIN_SUPPLY"]}, "zones": [{"zone_id": "airport", "active_cells": 1, "min_active": 2, "status": "UNDER_COVERED"}]}
]s3, the total is 1 + 1 + 1 = 3 isolated cells. Both citywide rules fire: 3 > 2 components and 1 < 3 cells in the largest component. Only (0,0) belongs to the airport zone, so its count remains 1 < 2. Removing absent cell (9,9) and issuing a query change nothing.Notes:
k.def max_rides_in_window(rides: List[int], k: int) -> intk.Example 1:rides = [2, 1, 5, 1, 3, 2], k = 39rides = [1, 2, 3, 4, 5], k = 291 <= len(rides) <= 10^51 <= rides[i], k <= 10^4.def dijkstra(graph: Dict[int, List[Tuple[int, int]]], start: int, destination: int) -> intstart to destination.Example 1:graph = {0: [(1, 1), (2, 4)], 1: [(2, 2), (3, 6)], 2: [(3, 1)], 3: []}, start = 0, destination = 33graph = {0: [(1, 2)], 1: [(2, 3)], 2: [(3, 1)], 3: []}, start = 0, destination = 361 <= len(graph) <= 10^40 <= start, destination < len(graph)class Feed:def add_category(self, user_id: int, category: str) -> None — Add a category to the user's subscription.def remove_category(self, user_id: int, category: str) -> None — Remove a category from the user's subscription.def get_feed(self, user_id: int) -> List[str] — Return the feed of updates for the user.Example 1:feed = Feed(), feed.add_category(1, 'Ride'), feed.add_category(1, 'Promo'), feed.get_feed(1)['Ride', 'Promo']feed.remove_category(1, 'Promo'), feed.get_feed(1)['Ride']1 <= user_id <= 10^4.1 <= category_count <= 100.class LRUCache:def __init__(self, capacity: int) — Initializes the LRU cache.def get(self, key: int) -> int — Returns the value of the key if the key exists.def put(self, key: int, value: int) — Updates the value of the key or adds the key-value pair.Example 1:lru = LRUCache(2), lru.put(1, 1), lru.put(2, 2), lru.get(1)1lru.put(3, 3), lru.get(2)-11 <= capacity <= 10^4.1 <= key, value <= 10^5.Sign up for free to access walkthroughs, AI-generated questions, and more.
Get Started Free