LeetCode 882: Reachable Nodes In Subdivided Graph
A clear explanation of counting reachable original and subdivided nodes using Dijkstra's shortest path algorithm.
Tag
Shortest-Path
9 notes
LeetCode 864: Shortest Path to Get All Keys
A clear explanation of finding the minimum moves to collect all keys in a grid using BFS with key bitmasks.
LeetCode 854: K-Similar Strings
A clear explanation of finding the minimum number of swaps needed to transform one anagram string into another using BFS.
LeetCode 787: Cheapest Flights Within K Stops
A clear explanation of finding the cheapest flight route with at most k stops using bounded Bellman-Ford relaxation.
LeetCode 773: Sliding Puzzle
A clear explanation of solving the 2 x 3 sliding puzzle using breadth-first search over board states.
LeetCode 743: Network Delay Time
Find the time needed for a signal to reach all nodes in a directed weighted graph using Dijkstra's algorithm.
LeetCode 505: The Maze II
A clear explanation of finding the shortest rolling distance in a maze using Dijkstra’s algorithm.
LeetCode 499: The Maze III
A clear explanation of finding the shortest rolling-ball path to the hole using Dijkstra with lexicographic tie-breaking.
LeetCode 433: Minimum Genetic Mutation
Find the minimum number of valid one-character gene mutations using breadth-first search.