All companies
Lyft
0 Easy18 Medium6 Hard24 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 994 | Rotting Oranges | Medium | |
| 76 | Minimum Window Substring | Hard | |
| 158 | Read N Characters Given read4 II - Call Multiple Times | Hard | |
| 981 | Time Based Key-Value Store | Medium | |
| 109 | Convert Sorted List to Binary Search Tree | Medium | |
| 632 | Smallest Range Covering Elements from K Lists | Hard | |
| 1094 | Car Pooling | Medium | |
| 443 | String Compression | Medium | |
| 958 | Check Completeness of a Binary Tree | Medium | |
| 126 | Word Ladder II | Hard | |
| 155 | Min Stack | Medium | |
| 716 | Max Stack | Hard | |
| 91 | Decode Ways | Medium | |
| 128 | Longest Consecutive Sequence | Medium | |
| 253 | Meeting Rooms II | Medium | |
| 365 | Water and Jug Problem | Medium | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 1620 | Coordinate With Maximum Network Quality | Medium | |
| 238 | Product of Array Except Self | Medium | |
| 1298 | Maximum Candies You Can Get from Boxes | Hard | |
| 148 | Sort List | Medium | |
| 208 | Implement Trie (Prefix Tree) | Medium | |
| 17 | Letter Combinations of a Phone Number | Medium | |
| 2101 | Detonate the Maximum Bombs | Medium |