QUESTIONS BY COMPANY

Lyft LeetCode Questions 2026

Browse LeetCode problems frequently asked by Lyft. Filter by difficulty and timeframe to focus your interview prep.

Last updated: 20 May 2026

Timeframe

Difficulty

Problem	Difficulty	Frequency	Topics
Rotting Oranges	MEDIUM	100%	ArrayBreadth-First SearchMatrix
Minimum Window Substring	HARD	87.5%	Hash TableStringSliding Window
Convert Sorted List to Binary Search Tree	MEDIUM	75%	Linked ListDivide and ConquerTreeBinary Search TreeBinary Tree
Smallest Range Covering Elements from K Lists	HARD	75%	ArrayHash TableGreedySliding WindowSortingHeap (Priority Queue)
Word Ladder II	HARD	75%	Hash TableStringBacktrackingBreadth-First Search
Longest Consecutive Sequence	MEDIUM	50%	ArrayHash TableUnion-Find
Min Stack	MEDIUM	62.5%	StackDesign
Read N Characters Given read4 II - Call Multiple Times	HARD	87.5%	ArraySimulationInteractive
Car Pooling	MEDIUM	75%	ArraySortingHeap (Priority Queue)SimulationPrefix Sum
Max Stack	HARD	62.5%	Linked ListStackDesignDoubly-Linked ListOrdered Set
Implement Trie (Prefix Tree)	MEDIUM	37.5%	Hash TableStringDesignTrie
Meeting Rooms II	MEDIUM	37.5%	ArrayTwo PointersGreedySortingHeap (Priority Queue)Prefix Sum
Water and Jug Problem	MEDIUM	50%	MathDepth-First SearchBreadth-First Search
String Compression	MEDIUM	75%	Two PointersString
Time Based Key-Value Store	MEDIUM	87.5%	Hash TableStringBinary SearchDesign
Longest Substring Without Repeating Characters	MEDIUM	50%	Hash TableStringSliding Window
Decode Ways	MEDIUM	62.5%	StringDynamic Programming
Coordinate With Maximum Network Quality	MEDIUM	50%	ArrayEnumeration
Product of Array Except Self	MEDIUM	50%	ArrayPrefix Sum
Maximum Candies You Can Get from Boxes	HARD	50%	ArrayBreadth-First SearchGraph Theory

Need Help Solving These Problems?

CodingInterviewAI can instantly identify algorithms and generate optimal solutions for any LeetCode problem. Get step-by-step explanations and ace your next technical interview.

See How It Works