| 61 |
Number of Distinct Islands II |
Hard |
Hash TableDepth-First SearchBreadth-First Search |
| 62 |
Number of Enclaves |
Medium |
ArrayDepth-First SearchBreadth-First Search |
| 63 |
Number of Good Paths |
Hard |
ArrayHash TableTree |
| 64 |
Number of Islands |
Medium |
ArrayDepth-First SearchBreadth-First Search |
| 65 |
Number of Islands II |
Hard |
ArrayHash TableUnion Find |
| 66 |
Number of Operations to Make Network Connected |
Medium |
Depth-First SearchBreadth-First SearchUnion Find |
| 67 |
Number of Provinces |
Unknown |
Depth-First SearchBreadth-First SearchUnion Find |
| 68 |
Number of Unique Categories |
Medium |
Union FindInteractiveCounting |
| 69 |
Number of Ways to Reorder Array to Get Same BST |
Hard |
ArrayMathDivide and Conquer |
| 70 |
Optimize Water Distribution in a Village |
Hard |
Union FindGraphHeap (Priority Queue) |
| 71 |
Path Existence Queries in a Graph I |
Medium |
ArrayHash TableBinary Search |
| 72 |
Path With Maximum Minimum Value |
Medium |
ArrayBinary SearchDepth-First Search |
| 73 |
Path With Minimum Effort |
Medium |
ArrayBinary SearchDepth-First Search |
| 74 |
Possible Bipartition |
Medium |
Depth-First SearchBreadth-First SearchUnion Find |
| 75 |
Process Restricted Friend Requests |
Hard |
Union FindGraph |