Uber software engineer interviews cover algorithms, data structures, system design, and coding problems drawn from real interview rounds.
Move Through Array You are given an array where each element represents the number of steps you can move from that position. Positive numbers move...
Input: ArrayOA [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: Listprices where prices[i] is the price of an item. For each item at index i, find the first item at index j > i such that...Input: Arrayi in an array. From each position, you can jump to: - i + 1 (one step forward) - Any position i + k where k ends in digit...Input: Arraynums (containing positive integers) and queries (each containing a target sum). For each query, return the maximum...Input: Arraythroughput[i] - Cost to scale up by 1 unit scalecost[i] You have a fixed...Input: Listn, in one operation you may replace n with either: - n = n + 2^i, or - n = n - 2^i for any integer i >= 0. Find...Input: Integer(s)prices: array of...Input: Arrayarr and an integer k, a subarray is called good if it contains at least k distinct integers. Return the length of the...Input: Arrayn. You can use either the lift or stairs. Lift: - Takes t1 time per floor -...Input: Given inputO = Robot - E =...Input: ArrayMeeting Reservation System Design a meeting reservation system that manages meeting rooms and schedules. Implement a MeetingReservationSystem...
Unimodal Cost Function Minimum You are given a unimodal cost function f(x) = A * (x - C)^2 + D defined over the interval [lo, hi], where `A >...
Hierarchy Path Finder You are given an org chart represented as a tree. Each node in the tree has a unique integer ID and a display name. You are...
Input: ListWeight Partition Check You are given a list of distinct positive integer weights and a capacity value. Determine whether any subset of the weights...
Input: ListStraight Line Sequence Search You are given an m x n grid of characters and a target sequence string. Determine whether the sequence appears in...
Longest Valid Container Nesting You are given a string consisting only of the characters {, }, [, ], (, ). These represent three levels...
Next Palindrome Number Given a string num representing a positive integer, find and return the smallest palindrome that is strictly greater than...
Annotate First Pattern Match You are given a string text containing words separated by spaces, and a list of patterns. For each word in text,...
Nested Arithmetic Expression Evaluator You are given a string expression containing nested calls to two functions: plus(a, b) and minus(a, b)....
[process_name, action, timestamp],...Input: Array of stringsOA [CodeSignal] Prime Jumps A game is played with the following rules: - A player starts at cell 0 with a score of 0. - There is a row of n cells...
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.Sign up for free to access walkthroughs, AI-generated questions, and more.
Get Started Free