2290. 到达角落的最少障碍移除次数
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Shortest Path
2577. 访问网格中单元格的最短时间
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
1334. 在阈值距离内邻居最少的城市
Medium | Dynamic Programming, Graph Theory, Shortest Path
1368. 使网格中至少有一条有效路径的最小代价
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
1514. 最大概率路径
Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path
1786. 从第一个节点到最后一个节点的受限路径数
Medium | Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path
743. 网络延迟时间
Medium | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path
787. K 站中转内最便宜的航班
Medium | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path
882. 细分图中的可达节点
Hard | Graph Theory, Heap (Priority Queue), Shortest Path
399. 除法求值
Medium | Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Path