Bfs

LeetCode note for Jump Game II, rebuilt from the original learning note

LeetCode 3905 note: multi-source BFS one layer at a time, collecting the maximum color per cell before writing the layer back

LeetCode 3820 note: three BFS runs give every node’s distance to the three targets

LeetCode 865 note: BFS to the last level and climb together, or one DFS returning (depth, node)

LeetCode 1161 note: pushing None into the next level creates a fake level with sum 0

LeetCode 1306 note: indices are nodes and the two jumps are edges; BFS or DFS decides whether a zero is reachable

LeetCode 3619 note: flood fill each island and sum its values; with up to 10^5 cells, iterate to avoid deep recursion

LeetCode 958 note: completeness is a global property, so check with BFS whether any node follows the first gap