Lyft Online Assessment Questions
We hold only 1 confirmed online assessment report for Lyft so far. Below are its 15 closest coding and technical questions, which is what an OA draws from.
See everything we have on Lyft →
42 more Lyft reports behind the paywall
One payment, permanent access to this company. No subscription, nothing to cancel.
Browse Lyft OA by Year
No year-specific OA data available.
Lyft Coding & Technical Questions
#76 Minimum Window Substring
LeetCode #76: Minimum Window Substring. Difficulty: Hard. Topics: Hash Table, String, Sliding Window. Asked at Lyft in the last 6 months.
#994 Rotting Oranges
LeetCode #994: Rotting Oranges. Difficulty: Medium. Topics: Array, Breadth-First Search, Matrix. Asked at Lyft in the last 6 months.
#158 Read N Characters Given read4 II - Call Multiple Times
LeetCode #158: Read N Characters Given read4 II - Call Multiple Times. Difficulty: Hard. Topics: Array, Simulation, Interactive. Asked at Lyft in the last 6 months.
#981 Time Based Key-Value Store
LeetCode #981: Time Based Key-Value Store. Difficulty: Medium. Topics: Hash Table, String, Binary Search, Design. Asked at Lyft in the last 6 months.
#17 Letter Combinations of a Phone Number
LeetCode #17: Letter Combinations of a Phone Number. Difficulty: Medium. Topics: Hash Table, String, Backtracking. Asked at Lyft in the last 6 months.
In-Memory KV Store with Transactions (BEGIN/COMMIT/ROLLBACK)
Implement an in-memory key-value database that supports transactions with `BEGIN`, `COMMIT`, and `ROLLBACK`. Build a command processor that reads and executes commands in order. The database is initi
Rotting Oranges (OA)
You are given a 2D grid `grid` where: - `0` represents an empty cell - `1` represents a fresh orange - `2` represents a rotten orange Every minute, any fresh orange that is **4-directionally adjacen
Job Scheduler with Stable Worker Selection (Min Workers + Assignment History)
## Problem: Job Scheduler (Min #Workers + Assignment History) You are given a set of jobs, each with a start time and a duration. You need to assign jobs to workers. A worker can handle at most one j
Design an In-Memory Key-Value Store
## Problem: Design an In-Memory Key-Value Store Design and implement an **in-memory key-value store** supporting: 1. `PUT key value`: bind string key `key` to string `value` (overwrite). 2. `GET key
Implement an LRU Cache
## Problem: Implement an LRU Cache Implement an **LRU (Least Recently Used) cache** with capacity `capacity` supporting: - `get(key)`: If `key` exists, return its value and mark it as most recently
Most Common OA Topics
Lyft OA Format and Platform
The Lyft online assessment is delivered through a proctored online platform, most commonly HackerRank. Candidates receive the OA link by email after passing an initial resume review. The coding section typically contains 2 to 3 algorithmic problems with a 70 to 110 minute time limit.
Some Lyft teams include an additional work simulation section that tests judgment and decision-making rather than coding ability. This section is not present for all roles. Check the LeakCode question database filtered by role type to see what past candidates for your specific role reported.
FAQ
Does Lyft have an online assessment?
Yes. Lyft uses an OA as the first technical screen for most engineering and technical roles. It is typically sent after a resume review and before any human interviews. The format has remained consistent across recent hiring cycles.
How hard is the Lyft OA?
Based on candidate reports, Lyft OA problems range from LeetCode medium to hard. Expect at least one problem that requires an efficient algorithm (not brute force) to pass all test cases within the time limit.
Where do these OA questions come from?
All questions in the LeakCode database are sourced from actual candidate reports on 1Point3Acres, Blind, Glassdoor, Reddit, and LeetCode. They are not AI-generated. Each question links to its source where the original report is public.
Related: Lyft All Questions · All OA Questions · Browse Companies · Data Sources