DSA Doctor
Verified Company Vault
Lyft DSA Interview Questions
24 curated coding interview questions directly asked in Lyft technical rounds, sorted by frequency with recency and difficulty diagnostics.
24
Total Questions
0 (0%)
Easy Problems
18 (75%)
Medium Problems
6 (25%)
Hard Problems
🔥 Most Tested Topics:
Arrays (7)Strings (6)Trees (5)Core DSA (5)Linked List (3)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 100.0% | 3m |
| 158 | Read N Characters Given read4 II - Call Multiple Times | Hard | Strings | Hashing / Sliding Window | 43.3% | 87.5% | 3m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 75.0% | 3m |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 75.0% | 3m |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 75.0% | 6m |
| 109 | Convert Sorted List to Binary Search Tree | Medium | Arrays; Trees; Linked List; Binary Search | Sorting / Prefix / Scan; DFS / BFS; Two Pointers; Binary Search | 66.6% | 75.0% | all |
| 632 | Smallest Range Covering Elements from K Lists | Hard | Linked List | Two Pointers | 70.1% | 75.0% | all |
| 126 | Word Ladder II | Hard | Strings | Hashing / Sliding Window | 27.7% | 75.0% | all |
| 1094 | Car Pooling | Medium | Core DSA | Implementation / Reasoning | 56.4% | 75.0% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 75.0% | all |
| 958 | Check Completeness of a Binary Tree | Medium | Trees | DFS / BFS | 59.2% | 75.0% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 62.5% | all |
| 716 | Max Stack | Hard | Stack / Queue | Monotonic Stack / Simulation | 45.9% | 62.5% | all |
| 91 | Decode Ways | Medium | Dynamic Programming | State Transition | 38.0% | 62.5% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | all |
| 365 | Water and Jug Problem | Medium | Core DSA | Implementation / Reasoning | 45.7% | 50.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 50.0% | all |
| 1620 | Coordinate With Maximum Network Quality | Medium | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 39.6% | 50.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 50.0% | all |
| 1298 | Maximum Candies You Can Get from Boxes | Hard | Arrays | Sorting / Prefix / Scan | 67.5% | 50.0% | all |
| 148 | Sort List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 64.4% | 50.0% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 37.5% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 37.5% | all |
| 2101 | Detonate the Maximum Bombs | Medium | Arrays | Sorting / Prefix / Scan | 50.2% | 37.5% | all |