| 1 |
Cheapest Flights Within K Stops |
Medium |
Dynamic ProgrammingDepth-First SearchBreadth-First Search |
| 2 |
Design Graph With Shortest Path Calculator |
Hard |
GraphDesignHeap (Priority Queue) |
| 3 |
Digit Operations to Make Two Integers Equal |
Medium |
MathGraphHeap (Priority Queue) |
| 4 |
Evaluate Division |
Medium |
ArrayStringDepth-First Search |
| 5 |
Find a Safe Walk Through a Grid |
Medium |
ArrayBreadth-First SearchGraph |
| 6 |
Find Edges in Shortest Paths |
Hard |
Depth-First SearchBreadth-First SearchGraph |
| 7 |
Find Minimum Time to Reach Last Room I |
Medium |
ArrayGraphHeap (Priority Queue) |
| 8 |
Find Minimum Time to Reach Last Room II |
Medium |
ArrayGraphHeap (Priority Queue) |
| 9 |
Find Shortest Path with K Hops |
Hard |
GraphHeap (Priority Queue)Shortest Path |
| 10 |
Find the City With the Smallest Number of Neighbors at a Threshold Distance |
Medium |
Dynamic ProgrammingGraphShortest Path |
| 11 |
Find the Closest Marked Node |
Medium |
ArrayGraphHeap (Priority Queue) |
| 12 |
Jump Game VIII |
Medium |
ArrayDynamic ProgrammingStack |
| 13 |
Minimize the Maximum Edge Weight of Graph |
Medium |
Binary SearchDepth-First SearchBreadth-First Search |
| 14 |
Minimum Cost of a Path With Special Roads |
Medium |
ArrayGraphHeap (Priority Queue) |
| 15 |
Minimum Cost to Buy Apples |
Medium |
ArrayGraphHeap (Priority Queue) |