Lyft Software Engineer interview questions

13 Software Engineers have shared notes from their Lyft interviews, with the questions they were asked in each round. That is 59% of the 22 Lyft interview notes on Screna AI.

13 Software Engineer interview notes

Lyft·Software Engineer·Online Assessment (OA)

Jun 2026
Did an OA for a software engineer role at Lyft. Just one problem, Rotting Oranges, nothing else to report.
  • Given a grid of oranges where some are rotten and some are fresh, determine how many minutes it takes for all fresh oranges to rot (each minute, rotten oranges spread to adjacent fresh ones). Return -1 if it's impossible.

“Classic BFS multi-source problem.”

View Post

Lyft·Software Engineer·Technical Phone Screen

Jun 2026
Lyft SWE coding round last month. The problem was a classic key-value store thing you've probably seen before, but the twist nobody warns you about is that you also have to write and actually run your own test cases, which ate up way more time than the actual coding.
  • Implement a key-value store that parses command strings line by line, where each line can be a standalone command, a command with a key and value, or a command with a single value. You also need to write and execute your own test cases.

“The parsing part is where I lost it.”

View Post

Lyft·Software Engineer·Take-home Assignment

Jun 2026
Lyft sent over a take-home written exercise instead of a coding screen, which I was not expecting at all. You get a doc full of PM comments and have to respond in-line, basically simulating a real async back-and-forth with a stakeholder. Weird format but kind of refreshing compared to grinding leetcode.
  • Given a document with a Product Manager's comments, questions, and pushback on technical decisions, how do you respond in writing to clarify your reasoning, agree or disagree with feedback, propose alternatives, and ask follow-up questions where needed?

“The format threw me off more than the actual content.”

View Post

Lyft·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Lyft coding round for a software engineer role, 90 minutes, centered entirely on building an in-memory key-value store from scratch. The interviewer pushed pretty hard on design decisions and wanted a second implementation approach, which I wasn't fully expecting.
  • Implement an in-memory key-value store with put, get, and delete operations. Walk through your data structure choice and then sketch out an alternative implementation with trade-off discussion.

“Went with a hashmap first, which felt obvious, and it was.”

View Post

Lyft·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Lyft system design round, one big question that sprawled into about five different topics. The payment reliability stuff was where I spent most of my time and honestly felt like I was just barely keeping up with the follow-ups.
  • Design a charity donation website that uses an external payment SDK as a black-box dependency. How do you handle payment failures, partial failures, and ensure no donations are lost or recorded with wrong amounts?
  • How would you design the system to handle sudden traffic spikes during a high-profile fundraising campaign?
  • Design the APIs for donating, viewing donation history, and generating receipts.
  • What does your data model look like for donations, donors, and campaigns?
  • How would you approach observability for this system, and what fraud signals would you watch for?

“This is where I got turned around.”

View Post

Lyft·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Lyft gave me a 1.5-hour laptop coding round for a software engineer role and it was rougher than I expected. The problem itself wasn't exotic but the edge cases piled up fast and I ran out of time before I had something fully working.
  • Build an in-memory key-value database that supports transactions, including begin, commit, and rollback operations.

“I knew the basic idea going in but underestimated how many edge cases show up once you start implementing.”

View Post

Lyft·Software Engineer·Technical Phone Screen

May 2026
Lyft SWE interview with a scheduling/assignment problem that looks straightforward until you actually have to implement it cleanly under pressure. Classic greedy with a heap, but the details trip you up.
  • Given a list of jobs each with a start time and end time, assign jobs to workers so no worker handles two overlapping jobs simultaneously. Use the fewest workers possible and return the worker assignment for each job.

“I knew the general shape of the solution pretty fast, sort by start time, use a min-heap tracking when each worker becomes free, greedily assign to whoever's free earliest.”

View Post

Lyft·Software Engineer·Technical Phone Screen

May 2026
One coding round at Lyft for a software engineer role, about an hour total but felt like it wrapped up well before that. Pretty standard as far as these things go.
  • Design and implement an LRU cache with O(1) get and put operations, supporting a fixed capacity with least-recently-used eviction.

“Classic problem so I'd seen it before, which helped.”

View Post

Lyft·Software Engineer·Technical Phone Screen

May 2026
Lyft coding interview, pretty standard algorithmic problem but they had me write my own test cases in the environment which I wasn't expecting.
  • Given an array of intervals, merge all overlapping ones and return a list of non-overlapping intervals that cover the full input.

“The algorithm itself isn't bad once you remember to sort by start time first.”

View Post

Lyft·Software Engineer·Technical Phone Screen

Apr 2026
Lyft SWE phone screen that looked like a standard scheduling problem but had a sneaky twist baked in. The core algorithm was Meeting Rooms II but with a custom assignment rule that changes which data structures you actually need.
  • You're given a stream of job records in CSV format where each line encodes a start time and duration (e.g. '1030 30' means start at 10:30, run for 30 minutes). Parse the stream, then answer two things: what's the minimum number of workers needed to cover all jobs, and print the full assignment log showing which worker handled which job. Catch: when multiple workers are free at the same moment a new job starts, you must assign the one with the smallest worker ID, not the one who became free earliest.

“I jumped straight into the standard Meeting Rooms II solution with a single min-heap keyed on end time and the interviewer let me get pretty far before asking how I'd print the assignment history.”

View Post