Lyft interview questions

Tech / SWE · 10 questions
Report an interview →

Browse 10 Lyft interview questions for software engineering and software development interview preparation. Questions in this collection are tagged for full-time roles. Explore the topics and stages below and filter the collection to plan your practice.

Interview stages in this collection
Phone screen, Onsite, Online assessment (OA)
Practice topics
Array (4), Hash Table (3), String (3), Breadth-First Search (2), Design (2), Heap (2), Linked List (2), Simulation (2)

Questions come from candidate contributions and online research. Reports reflect past experiences and do not guarantee what Lyft will ask. Locked question details require points. Public examples below are free to read.

Read 3 free Lyft interview question examples

Browse all Lyft questions

10 questions

Free Lyft interview question examples

Read the full problem statements and use the links to revisit or share a specific example.

Time-Based Key-Value Store

Medium · Phone screen · Onsite · Full-time

Got this design question in my Lyft onsite. Build a time-based key-value store where set stores a value at a given timestamp, and get returns the value with the largest timestamp less than or equal to the query timestamp. The interviewer pushed on what happens with concurrent writes at the same timestamp and the boundary condition when the query timestamp is smaller than all stored timestamps. Took me a minute to get the binary search right.

Rotting Oranges

Medium · Phone screen · Onsite · Full-time

Got the rotting oranges problem during my Lyft onsite. Grid of fresh and rotten oranges, rotten ones spread to adjacent fresh ones each minute, find the minimum time until all oranges are rotten or return -1 if impossible. Pretty standard BFS once you see it, but the interviewer asked about the time and space complexity and whether there was any way to do it without a queue.

Read N Chars II

Hard · Onsite · Phone screen · Full-time

This one tripped me up a bit during my Lyft technical round. You're given a read4 API that reads 4 characters at a time from a file, and you have to implement read(buf, n) that reads exactly n characters. The catch is that read can be called multiple times, so you need to buffer leftover characters from previous read4 calls. I used a small internal buffer and a pointer to track where I left off. The interviewer pushed on what happens when read is called with n smaller than 4 repeatedly.