← Back to Lyft

Array

30 questions

1Rotting OrangesMedium
ArrayBreadth-First SearchMatrix
Solve →
2Rotting OrangesMedium
ArrayBreadth-First SearchMatrix
Solve →
3Read N Characters Given read4 II - Call Multiple TimesHard
ArraySimulationInteractive
Solve →
4Rotting OrangesMedium
ArrayBreadth-First SearchMatrix
Solve →
5Read N Characters Given read4 II - Call Multiple TimesHard
ArraySimulationInteractive
Solve →
6Read N Characters Given read4 II - Call Multiple TimesHard
ArraySimulationInteractive
Solve →
7Rotting OrangesMedium
ArrayBreadth-First SearchMatrix
Solve →
8Range Sum Query 2D - ImmutableMedium
ArrayDesignMatrix
Solve →
9Longest Consecutive SequenceMedium
ArrayHash TableUnion Find
Solve →
10Meeting Rooms IIMedium
ArrayTwo PointersGreedy
Solve →
11Asteroid CollisionMedium
ArrayStackSimulation
Solve →
12Process Tasks Using ServersMedium
ArrayHeap (Priority Queue)
Solve →
13Car PoolingMedium
ArraySortingHeap (Priority Queue)
Solve →
14Smallest Range Covering Elements from K ListsHard
ArrayHash TableGreedy
Solve →
15Find Minimum Time to Finish All JobsHard
ArrayDynamic ProgrammingBacktracking
Solve →
16Product of Array Except SelfMedium
ArrayPrefix Sum
Solve →
17Maximum Candies You Can Get from BoxesHard
ArrayBreadth-First SearchGraph
Solve →
18Rotting OrangesMedium
ArrayBreadth-First SearchMatrix
Solve →
19Read N Characters Given read4 II - Call Multiple TimesHard
ArraySimulationInteractive
Solve →
20Smallest Range Covering Elements from K ListsHard
ArrayHash TableGreedy
Solve →
21Car PoolingMedium
ArraySortingHeap (Priority Queue)
Solve →
22Range Sum Query 2D - ImmutableMedium
ArrayDesignMatrix
Solve →
23Longest Consecutive SequenceMedium
ArrayHash TableUnion Find
Solve →
24Asteroid CollisionMedium
ArrayStackSimulation
Solve →
25Meeting Rooms IIMedium
ArrayTwo PointersGreedy
Solve →
26Product of Array Except SelfMedium
ArrayPrefix Sum
Solve →
27Maximum Candies You Can Get from BoxesHard
ArrayBreadth-First SearchGraph
Solve →
28Process Tasks Using ServersMedium
ArrayHeap (Priority Queue)
Solve →
29Find Minimum Time to Finish All JobsHard
ArrayDynamic ProgrammingBacktracking
Solve →
30Coordinate With Maximum Network QualityMedium
ArrayEnumeration
Solve →