L

Lyft

26 questions tracked23 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 26 of 26 questions

1
MediumRotting Orangesβœ“ Our Solution
100
ArrayBreadth-First SearchMatrix
2
MediumTime Based Key-Value Storeβœ“ Our Solution
94
Hash TableStringBinary SearchDesign
3
HardRead N Characters Given read4 II - Call Multiple Times
94
ArraySimulationInteractive
4
HardMinimum Window Substringβœ“ Our Solution
92
Hash TableStringSliding Window
5
HardMax Stack
80
Linked ListStackDesignDoubly-Linked List+1
6
MediumConvert Sorted List to Binary Search Treeβœ“ Our Solution
78
Linked ListDivide and ConquerTreeBinary Search Tree+1
7
HardSmallest Range Covering Elements from K Listsβœ“ Our Solution
75
ArrayHash TableGreedySliding Window+2
8
MediumCheck Completeness of a Binary Treeβœ“ Our Solution
75
TreeBreadth-First SearchBinary Tree
9
MediumString Compressionβœ“ Our Solution
75
Two PointersString
10
MediumCar Poolingβœ“ Our Solution
75
ArraySortingHeap (Priority Queue)Simulation+1
11
MediumRange Sum Query 2D - Immutableβœ“ Our Solution
70
ArrayDesignMatrixPrefix Sum
12
MediumMin Stackβœ“ Our Solution
68
StackDesign
13
HardWord Ladder IIβœ“ Our Solution
64
Hash TableStringBacktrackingBreadth-First Search
14
MediumLongest Consecutive Sequenceβœ“ Our Solution
61
ArrayHash TableUnion Find
15
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
56
Hash TableStringDesignTrie
16
MediumWater and Jug Problemβœ“ Our Solution
56
MathDepth-First SearchBreadth-First Search
17
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
56
Hash TableStringSliding Window
18
MediumDecode Waysβœ“ Our Solution
56
StringDynamic Programming
19
MediumAsteroid Collisionβœ“ Our Solution
51
ArrayStackSimulation
20
MediumMeeting Rooms II
51
ArrayTwo PointersGreedySorting+2
21
MediumProduct of Array Except Selfβœ“ Our Solution
51
ArrayPrefix Sum
22
HardMaximum Candies You Can Get from Boxesβœ“ Our Solution
51
ArrayBreadth-First SearchGraph
23
MediumSort Listβœ“ Our Solution
51
Linked ListTwo PointersDivide and ConquerSorting+1
24
MediumProcess Tasks Using Serversβœ“ Our Solution
43
ArrayHeap (Priority Queue)
25
HardFind Minimum Time to Finish All Jobsβœ“ Our Solution
43
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
26
MediumCoordinate With Maximum Network Qualityβœ“ Our Solution
43
ArrayEnumeration