Category: String coding problem# Question You are tasked with implementing a Bootstrap API that aggregates data from multiple services for a given user. Given a userId, you...Input: String Output: Computed result
codingHardVerified Question#2
2. Code Craft - Driver Payment System
Category: Algorithm coding problem# Question You are in charge of implementing the Dasher payment model. Given the sequence of accepted/fulfilled order activities from a given dasher...Input: List Output: Computed result
codingMediumVerified Question#3
3. Find Closest Dasher
Category: Algorithm coding problem# Question You are given an m × n board representing a delivery area. The board contains: - 'X' - blockers (obstacles) - 'D' - DashMarts...Input: List Output: Integer
codingMediumVerified Question#4
4. Find Menu Changes
Category: Tree coding problem# Question You are given two tree structures representing an old menu and a new menu. Each tree node has: - key: identifier for the menu...Input: List Output: Computed result
codingMediumVerified Question#5
5. Location Index
Category: Graph coding problemImplement a LocationIndex class that stores a set of named points on a 2D grid. The constructor takes three arrays: names (list of location name...Input: 2D grid Output: Computed result
codingMediumVerified Question#6
6. Covered Service Zones
Category: Algorithm coding problemYou are given two binary m x n matrices: coverage and demand. A cell in demand is active if its value is 1. Active cells that are...Input: Number(s) Output: Integer
codingHardVerified Question#7
7. Wildcard Segment Counter
Category: String coding problemYou are given a template string consisting only of the characters '0', '1', and '?', and a list of integers run_lengths. A '?' in the...Input: Array of integers Output: Computed result
codingMediumVerified Question#8
8. Peak Value Processing Order
Category: Algorithm coding problemYou are given a list of unique integers values. At each step, identify all eligible values: a value is eligible if it is strictly greater than...Input: List Output: Computed result
codingHardVerified Question#9
9. Directory Registry
Category: Tree coding problemImplement a DirectoryRegistry class that manages a hierarchical key-value store modeled as a tree of paths. The root path "/" always exists with...Input: String Output: Computed result
codingHardVerified Question#10
10. Ride Earnings Calculator
Category: String coding problemYou are given records, a list of ride events. Each record is a list of three strings: [ride_id, timestamp, status]. Possible statuses are...Input: List Output: Computed result
codingMediumVerified Question#11
11. Meeting Slot Generator
Category: Interval-based coding problemGiven a start time and an end time, generate all meeting check-in slots at 5-minute intervals after start up to and including end. The...Input: List Output: Computed result
codingMediumVerified Question#12
12. Catalog Tree Diff Counter
Category: Tree coding problemYou are given two n-ary trees representing an old and a new version of a product catalog. Each node in the tree has the following fields: - key...Input: List Output: Computed result
codingHardbacktracking#1
1. [OA] Combination Sum — Optimize DoorDash promotions for maximum order collection.
DoorDash wants to create bundled promotions that maximize customer engagement while ensuring profit margins. Given an array of integers products representing the price of each product and an integer target, find all combinations of products that sum up to exactly target.Function Signature: python combinationSum(products: List[int], target: int) -> List[List[int]] Example 1: Input: products = [2, 3, 6, 7], target = 7 Output: [[7], [2, 2, 3]] Explanation: The combinations that yield 7 are the combinations of products 7 and the numbers 2 and 3 in different quantities.Constraints: - 1 <= products.length <= 30 - 2 <= products[i] <= 40 - 1 <= target <= 500
codingHardsliding window#2
2. [OA] Sliding Window — Calculate the maximum total distance of delivery for DoorDash orders.
DoorDash needs to optimize the delivery routes for drivers by calculating the maximum distance they can cover within a given time frame. Given an array orders where each entry represents the distance of an order from the restaurant and an integer Time which represents the maximum time available, calculate the maximum total distance of orders that can be completed within that time. The distance for each order is defined as distance[i] = time[i] * speed[i] where speed can be considered constant.Function Signature: python maxDeliveryDistance(orders: List[int], Time: int) -> int Example 1: Input: orders = [1, 2, 3, 4, 5], Time = 7 Output: 12 Explanation: The driver can complete orders 3, 4, and 5 within the time limit, accounting for the maximum distance covered.Constraints: - 1 <= orders.length <= 1000 - 1 <= orders[i] <= 100 - 1 <= Time <= 1000