Lyft
26 LeetCode interview questions
Curated Lists
Categories
All Questions
Topics
- Rotting OrangesMedium56.6%100.0%
- Time Based Key-Value StoreMedium49.4%94.3%
- Read N Characters Given read4 II - Call Multiple TimesHard42.9%93.5%
- Minimum Window SubstringHard45.4%91.9%
- Max StackHard45.5%79.8%
- Convert Sorted List to Binary Search TreeMedium64.5%78.2%
- Smallest Range Covering Elements from K ListsHard69.7%74.6%
- Check Completeness of a Binary TreeMedium58.4%74.6%
- String CompressionMedium58.1%74.6%
- Car PoolingMedium56.0%74.6%
- Range Sum Query 2D - ImmutableMedium56.5%70.1%
- Min StackMedium56.4%67.5%
- Word Ladder IIHard27.2%64.4%
- Longest Consecutive SequenceMedium47.0%60.8%
- Implement Trie (Prefix Tree)Medium67.9%56.4%
- Water and Jug ProblemMedium43.1%56.4%
- Longest Substring Without Repeating CharactersMedium36.9%56.4%
- Decode WaysMedium36.5%56.4%
- Asteroid CollisionMedium45.5%50.7%
- Meeting Rooms IIMedium52.1%50.7%
- Product of Array Except SelfMedium67.8%50.7%
- Maximum Candies You Can Get from BoxesHard68.8%50.7%
- Sort ListMedium61.8%50.7%
- Process Tasks Using ServersMedium41.1%42.7%
- Find Minimum Time to Finish All JobsHard43.5%42.7%
- Coordinate With Maximum Network QualityMedium38.4%42.7%
Showing 26 of 26 questions.