VO Prep - 第10页

Doordash DoorDash VO Interview — Minimum Dasher Capacity | Binary Search | Load Distribution | Greedy Strategy

You are given a 0-indexed integer array representing the number of orders for each restaurant.You are also given an integer d, representing the number of available dashers. Each dasher can work only for one restaurant, and must handle all orders assigned to them from that restaurant. Your task is to find the minimum capacity k…

Doordash DoorDash VO Interview — Find Closest DashMart Distance | BFS on Grid | Pathfinding | 2D Matrix Interview Problem

You are given a 2D grid representing a city map.Each cell contains one of the following characters: You are allowed to move in four directions:up, down, left, right You are given a list of query locations in:[row, col] format For each query location, return the minimum distance to the nearest DashMart.If the location is out…

Doordash DoorDash VO Interview — Debugging a Load Balancer & Designing Consistent Hashing | Distributed Systems | Backend Interview Question

You are a Backend Engineer at DoorDash and notice that your service can no longer keep up with traffic.To handle the increased load, the team decides to scale horizontally by adding more pods running your service. A colleague implemented a traffic router that distributes requests to pods using a round-robin algorithm. However, the implementation does…

Doordash DoorDash VO Interview — Lowest Common Ancestor with Parent Pointer | LCA | Tree Interview Problem

You are given a binary tree where every node contains: Given two nodes in this tree, return their Lowest Common Ancestor (LCA). Below is the structure of the tree: You will be given two input nodes, and your task is to return the node that is their lowest shared ancestor in the tree. Example Input…

Doordash DoorDash VO Interview — Top K Frequent Elements | Frequency Map | Heap | System Design for Arrays

You are given an array of integers. Your task is to return the k most frequent elements from the array.If two or more elements share the same frequency, you may return them in any order.If the number of unique elements is less than k, return all unique values. Examples This DoorDash VO interview question evaluates…

Apple Apple interview #4 Sum of Two Numbers in a Sorted Array — Two-Pointer Pattern (Interview Prep | Array)

You are given a sorted array of 10 elements.Given a target number, find two distinct elements in the array whose sum equals the target. Example array Input: a target value T.Output: any pair (x, y) from Arr such that x + y = T (or report that no such pair exists). Classic two-sum in a…

Apple Apple interview #3 Modify an Array — Min Cost to Sort (Interview Prep | Array | Greedy/DP | Cheat-Sheet)

Given an array of integers, the cost to change an element is the absolute difference between its initial value and its new value.For example, if an element is initially 10, it can be changed to 7 or 13 for a cost of 3. Task. Determine the minimum total cost to make the array sorted along…

Apple Apple Interview Question: Task Dependency Resolution via Topological Sort (Apple OA / Coding Interview / Dependency Graph)

We have a list of tasks. Each task can depend on other tasks.If task A depends on task B, then B should run before A. Implement the method getTaskWithDependencies such that it returns a list of task names in the correct order. Example:If we want to execute task “application A”, the method should return: The…

Apple Apple Interview #1 SQL: Find Employee IDs with More Than One Project (GROUP BY/HAVING, Join Schema) — Apple interview, SQL practice

CoderPad provides a basic SQL sandbox with the following schema.You can also use commands like show tables and desc … Group employees_projects by employee_id and filter with HAVING COUNT(DISTINCT project_id) > 1. Use DISTINCT to guard against duplicate links; join employees only if names are needed. Add indexes on employee_id/project_id (or a composite) for performance….

Robinhood Robinhood #2 Referral Leaderboard System Design — Build Top-3 Referrer Ranking (Referral Chain Tracking + Graph Problem)

Robinhood is famous for its referral program. It’s exciting to see users spreading the word across their friends and family. One thing that is interesting about the program is the network effect it creates. We would like to build a dashboard to track the status of the program. Specifically, we would like to learn about…