Problem database last updated: June 20, 2025

LLyft logo

Lyft Coding Interview Questions

23 problems · 0 Easy, 18 Medium, 5 Hard · Ranked #83 of 458

Difficulty breakdown

0 Easy

0% · avg 23%

18 Medium

78% · avg 59%

5 Hard

22% · avg 18%

Top topics

array
47.8%
hash-table
30.4%
string
30.4%
breadth-first-search
21.7%2.6x
design
17.4%3x
sliding-window
13%2.8x

Interview profile

Based on 23 reported problems, Lyft interviews are slightly harder than average - 22% Hard vs 18% across all companies. The majority (78%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.

Compared to the industry average, Lyft puts unusual emphasis on prefix-sum (13% of problems, 3.9x the industry average), design (17.4% of problems, 3x the industry average), sliding-window (13% of problems, 2.8x the industry average). If you're short on time, these are the categories to double down on.

The most common topics are array (47.8%), hash-table (30.4%), string (30.4%), breadth-first-search (21.7%). Problems below are sorted by frequency, the ones at the top are asked most often.

All 23 problems

Rotting Oranges

Solve

You are given an m x n grid where each cell can have one of three values:

MediumVery Likely
arraybreadth-first-searchmatrix

Time Based Key-Value Store

Solve

Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain...

MediumVery Likely
hash-tablestringbinary-search

Minimum Window Substring

Solve

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is inc...

HardVery Likely
hash-tablestringsliding-window

Convert Sorted List to Binary Search Tree

Solve

Given the head of a singly linked list where elements are sorted in ascending order, convert it to a height-balanced binary search tree.

MediumVery Likely
linked-listdivide-and-conquertree

Car Pooling

Solve

There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).

MediumLikely
arraysortingheap-priority-queue

Check Completeness of a Binary Tree

Solve

Given the root of a binary tree, determine if it is a complete binary tree.

MediumLikely
treebreadth-first-searchbinary-tree

String Compression

Solve

Given an array of characters chars, compress it using the following algorithm:

MediumLikely
two-pointersstring

Smallest Range Covering Elements from K Lists

Solve

You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists.

HardLikely
arrayhash-tablegreedy

Range Sum Query 2D - Immutable

Solve

Given a 2D matrix matrix, handle multiple queries of the following type:

MediumLikely
arraydesignmatrix

Min Stack

Solve

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

MediumLikely
stackdesign

Word Ladder II

Solve

A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:

HardLikely
hash-tablestringbacktracking

Longest Consecutive Sequence

Solve

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.

MediumLikely
arrayhash-tableunion-find

Longest Substring Without Repeating Characters

Solve

Given a string s, find the length of the longest substring without duplicate characters.

MediumLikely
hash-tablestringsliding-window

Decode Ways

Solve

You have intercepted a secret message encoded as a string of numbers. The message is decoded via the following mapping:

MediumLikely
stringdynamic-programming

Implement Trie (Prefix Tree)

Solve

A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various appl...

MediumLikely
hash-tablestringdesign

Water and Jug Problem

Solve

You are given two jugs with capacities x liters and y liters. You have an infinite water supply. Return whether the total amount of water in both jugs may reach...

MediumLikely
mathdepth-first-searchbreadth-first-search

Asteroid Collision

Solve

We are given an array asteroids of integers representing asteroids in a row. The indices of the asteroid in the array represent their relative position in space...

MediumLikely
arraystacksimulation

Product of Array Except Self

Solve

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].

MediumLikely
arrayprefix-sum

Sort List

Solve

Given the head of a linked list, return the list after sorting it in ascending order.

MediumLikely
linked-listtwo-pointersdivide-and-conquer

Maximum Candies You Can Get from Boxes

Solve

You have n boxes labeled from 0 to n - 1. You are given four arrays: status, candies, keys, and containedBoxes where:

HardLikely
arraybreadth-first-searchgraph

Find Minimum Time to Finish All Jobs

Solve

You are given an integer array jobs, where jobs[i] is the amount of time it takes to complete the ith job.

HardSometimes
arraydynamic-programmingbacktracking

Coordinate With Maximum Network Quality

Solve

You are given an array of network towers towers, where towers[i] = [xi, yi, qi] denotes the ith network tower with location (xi, yi) and quality factor qi. All...

MediumSometimes
arrayenumeration

Process Tasks Using Servers

Solve

You are given two 0-indexed integer arrays servers and tasks of lengths n​​​​​​ and m​​​​​​ respectively. servers[i] is the weight of the i​​​​​​th​​​​ server,...

MediumSometimes
arrayheap-priority-queue

How often are these problems asked?

Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Lyft interviews.

Very Likely

75-100%

Likely

50-74%

Sometimes

25-49%

Rare

0-24%

Preparing for your Lyft coding interview

Lyft interviews focus heavily on array, hash-table, string problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.

Beyond solving problems, practice explaining your approach. Lyft interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.

Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.

Frequently Asked Questions

What coding problems does Lyft ask in interviews?add

Lyft has been reported to ask 23 distinct coding problems. The most common topics are array, hash-table, string. 0 are Easy difficulty, 18 are Medium, and 5 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.

How hard are Lyft coding interviews?add

Based on 23 reported problems, Lyft interviews are slightly harder than average - 22% Hard vs 18% across all companies. 78% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.

How should I prepare for a Lyft coding interview?add

Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.

Other companies to explore

Ready to ace your Lyft interview?

Simulate a real Lyft coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.

Simulate a Lyft interview with AIarrow_forward