Lyft LeetCode Questions
26 questions all-time · 0 easy · 19 medium · 7 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 100 | 56.6% |
| 2 | Time Based Key-Value Store Hash Table, String, Binary Search, Design | Medium | 94 | 49.4% |
| 3 | Read N Characters Given read4 II - Call Multiple Times Array, Simulation, Interactive | Hard | 94 | 42.9% |
| 4 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 92 | 45.4% |
| 5 | Max Stack Linked List, Stack, Design, Doubly-Linked List, Ordered Set | Hard | 80 | 45.5% |
| 6 | Convert Sorted List to Binary Search Tree Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree | Medium | 78 | 64.5% |
| 7 | Smallest Range Covering Elements from K Lists Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue) | Hard | 75 | 69.7% |
| 8 | Check Completeness of a Binary Tree Tree, Breadth-First Search, Binary Tree | Medium | 75 | 58.4% |
| 9 | String Compression Two Pointers, String | Medium | 75 | 58.1% |
| 10 | Car Pooling Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum | Medium | 75 | 56.0% |
| 11 | Range Sum Query 2D - Immutable Array, Design, Matrix, Prefix Sum | Medium | 70 | 56.5% |
| 12 | Min Stack Stack, Design | Medium | 68 | 56.4% |
| 13 | Word Ladder II Hash Table, String, Backtracking, Breadth-First Search | Hard | 64 | 27.2% |
| 14 | Longest Consecutive Sequence Array, Hash Table, Union Find | Medium | 61 | 47.0% |
| 15 | Implement Trie (Prefix Tree) Hash Table, String, Design, Trie | Medium | 56 | 67.9% |
| 16 | Water and Jug Problem Math, Depth-First Search, Breadth-First Search | Medium | 56 | 43.1% |
| 17 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 56 | 36.9% |
| 18 | Decode Ways String, Dynamic Programming | Medium | 56 | 36.5% |
| 19 | Asteroid Collision Array, Stack, Simulation | Medium | 51 | 45.5% |
| 20 | Meeting Rooms II Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 51 | 52.1% |
| 21 | Product of Array Except Self Array, Prefix Sum | Medium | 51 | 67.8% |
| 22 | Maximum Candies You Can Get from Boxes Array, Breadth-First Search, Graph | Hard | 51 | 68.8% |
| 23 | Sort List Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort | Medium | 51 | 61.8% |
| 24 | Process Tasks Using Servers Array, Heap (Priority Queue) | Medium | 43 | 41.1% |
| 25 | Find Minimum Time to Finish All Jobs Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 43 | 43.5% |
| 26 | Coordinate With Maximum Network Quality Array, Enumeration | Medium | 43 | 38.4% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.