Lyft
25 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 994. Rotting Oranges | Medium | 100% | TopicsArrayBreadth-First SearchMatrix |
| 76. Minimum Window Substring | Hard | 94.1% | TopicsHash TableStringSliding Window |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 91.9% | TopicsArraySimulationInteractive |
| 981. Time Based Key-Value Store | Medium | 86.6% | TopicsHash TableStringBinary SearchDesign |
| Convert Sorted List to Binary Search Tree | Medium | 76.1% | TopicsLinked ListDivide and ConquerTreeBinary Search TreeBinary Tree |
| 958. Check Completeness of a Binary Tree | Medium | 74.3% | TopicsTreeBreadth-First SearchBinary Tree |
| Smallest Range Covering Elements from K Lists | Hard | 70% | TopicsArrayHash TableGreedySliding WindowSortingHeap (Priority Queue) |
| 1094. Car Pooling | Medium | 70% | TopicsArraySortingHeap (Priority Queue)SimulationPrefix Sum |
| 443. String Compression | Medium | 70% | TopicsTwo PointersString |
| Max Stack | Hard | 67.4% | TopicsLinked ListStackDesignDoubly-Linked ListOrdered Set |
| Word Ladder II | Hard | 64.4% | TopicsHash TableStringBacktrackingBreadth-First SearchBidirectional Search |
| 91. Decode Ways | Medium | 64.4% | TopicsStringDynamic Programming |
| 155. Min Stack | Medium | 60.9% | TopicsStackDesign |
| 1620. Coordinate With Maximum Network Quality | Medium | 51.1% | TopicsArrayEnumeration |
| 148. Sort List | Medium | 51.1% | TopicsLinked ListTwo PointersDivide and ConquerSortingMerge Sort |
| 98. Validate Binary Search Tree | Medium | 51.1% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| Longest Consecutive Sequence | Medium | 43.4% | TopicsArrayHash TableUnion-Find |
| Implement Trie (Prefix Tree) | Medium | 43.4% | TopicsHash TableStringDesignTrie |
| Meeting Rooms II | Medium | 43.4% | TopicsArrayTwo PointersGreedySortingHeap (Priority Queue)Prefix Sum |
| 365. Water and Jug Problem | Medium | 43.4% | TopicsMathDepth-First SearchBreadth-First SearchBézout's LemmaEuclidean AlgorithmGreatest Common DivisorExtended Euclidean Algorithm |
| 3. Longest Substring Without Repeating Characters | Medium | 43.4% | TopicsHash TableStringSliding Window |
| 17. Letter Combinations of a Phone Number | Medium | 43.4% | TopicsHash TableStringBacktracking |
| 2101. Detonate the Maximum Bombs | Medium | 43.4% | TopicsArrayMathDepth-First SearchBreadth-First SearchGraph TheoryGeometry |
| Range Sum Query 2D - Immutable | Medium | 43.4% | TopicsArrayDesignMatrixPrefix Sum |
| 1008. Construct Binary Search Tree from Preorder Traversal | Medium | 43.4% | TopicsArrayStackTreeBinary Search TreeMonotonic StackBinary Tree |
