| 106 |
Minimum Path Cost in a Hidden Grid |
Medium |
ArrayDepth-First SearchBreadth-First Search |
| 107 |
Minimum Runes to Add to Cast Spell |
Hard |
ArrayDepth-First SearchBreadth-First Search |
| 108 |
Minimum Score of a Path Between Two Cities |
Medium |
Depth-First SearchBreadth-First SearchUnion Find |
| 109 |
Minimum Time to Break Locks II |
Hard |
ArrayDepth-First SearchGraph |
| 110 |
Minimum Time to Transport All Individuals |
Hard |
ArrayDynamic ProgrammingBit Manipulation |
| 111 |
Minimum Time to Visit a Cell In a Grid |
Hard |
ArrayBreadth-First SearchGraph |
| 112 |
Minimum Time to Visit Disappearing Nodes |
Medium |
ArrayGraphHeap (Priority Queue) |
| 113 |
Minimum Weighted Subgraph With the Required Paths |
Hard |
GraphShortest Path |
| 114 |
Modify Graph Edge Weights |
Hard |
GraphHeap (Priority Queue)Shortest Path |
| 115 |
Most Profitable Path in a Tree |
Medium |
ArrayTreeDepth-First Search |
| 116 |
Most Stones Removed with Same Row or Column |
Medium |
Hash TableDepth-First SearchUnion Find |
| 117 |
Network Delay Time |
Medium |
Depth-First SearchBreadth-First SearchGraph |
| 118 |
Node With Highest Edge Score |
Medium |
Hash TableGraph |
| 119 |
Number of Connected Components in an Undirected Graph |
Medium |
Depth-First SearchBreadth-First SearchUnion Find |
| 120 |
Number of Good Paths |
Hard |
ArrayHash TableTree |