| 46 |
Minimize Maximum Value in a Grid |
Hard |
ArrayUnion FindGraph |
| 47 |
Minimum Cost Walk in Weighted Graph |
Hard |
ArrayBit ManipulationUnion Find |
| 48 |
Minimum Number of Visited Cells in a Grid |
Hard |
ArrayDynamic ProgrammingStack |
| 49 |
Minimum Reverse Operations |
Hard |
ArrayHash TableBreadth-First Search |
| 50 |
Minimum Runes to Add to Cast Spell |
Hard |
ArrayDepth-First SearchBreadth-First Search |
| 51 |
Minimum Score of a Path Between Two Cities |
Medium |
Depth-First SearchBreadth-First SearchUnion Find |
| 52 |
Most Stones Removed with Same Row or Column |
Medium |
Hash TableDepth-First SearchUnion Find |
| 53 |
Number of Closed Islands |
Medium |
ArrayDepth-First SearchBreadth-First Search |
| 54 |
Number of Connected Components in an Undirected Graph |
Medium |
Depth-First SearchBreadth-First SearchUnion Find |
| 55 |
Number of Distinct Islands |
Unknown |
Hash TableDepth-First SearchBreadth-First Search |
| 56 |
Number of Distinct Islands II |
Hard |
Hash TableDepth-First SearchBreadth-First Search |
| 57 |
Number of Enclaves |
Medium |
ArrayDepth-First SearchBreadth-First Search |
| 58 |
Number of Good Paths |
Hard |
ArrayHash TableTree |
| 59 |
Number of Islands |
Medium |
ArrayDepth-First SearchBreadth-First Search |
| 60 |
Number of Islands II |
Hard |
ArrayHash TableUnion Find |