Lyft Coding & Algorithms Interview Questions
Master your tech interview with our curated database of real questions from top companies.
Optimize Driver Repositioning for Minimal Pickup Time
Scenario Design and implement algorithms for ride-sharing dispatch and capacity planning. Question Given historical rider demand density and current d...
Implement a nested key-value store
Design and implement a nested key–value store that supports set(path, value), get(path), and delete(path), where path is dot-delimited (e.g., "a.b.c")...
Implement pagination and a time-versioned key-value store
Implement two coding tasks: 1) Transaction pagination: Given an in-memory collection of transaction records with fields (txn_id: string, user_id: stri...
Implement command-driven in-memory key-value database
Implement a command-driven in-memory key–value database. Supported commands (one per line): 1) SET key value 2) GET key → print value or NULL 3) DELET...
Solve grid compromise spread with BFS
You are given an m×n grid representing a data center: 0 = empty rack, 1 = secure server, 2 = compromised server. Each minute, any secure server that i...
Implement paginated retrieval of transactions
Given a large list of transaction records (id, userId, amount, createdAt), implement APIs to return transactions in reverse chronological order with p...
Design a temporal key-value store with historical reads
Implement a key–value store supporting set(key, value, timestamp) and get(key, timestamp) -> the value at the greatest timestamp ≤ the given timestamp...