LeetCode 967: Numbers With Same Consecutive Differences
A clear explanation of generating all n-digit numbers whose adjacent digits differ by k.
Tag
Breadth-First-Search
31 notes
LeetCode 958: Check Completeness of a Binary Tree
A clear explanation of checking whether a binary tree is complete using level-order traversal.
LeetCode 847: Shortest Path Visiting All Nodes
A clear explanation of the Shortest Path Visiting All Nodes problem using multi-source BFS and bitmask state compression.
LeetCode 841: Keys and Rooms
A clear explanation of the Keys and Rooms problem using graph traversal from room 0.
LeetCode 827: Making A Large Island
A clear explanation of the Making A Large Island problem using connected component labeling and island size lookup.
LeetCode 924: Minimize Malware Spread
A clear explanation of minimizing malware spread by analyzing connected components with Union Find.
LeetCode 919: Complete Binary Tree Inserter
A clear explanation of maintaining a complete binary tree inserter using level-order indexing.
LeetCode 913: Cat and Mouse
A clear explanation of Cat and Mouse using game states, reverse BFS, and topological propagation.
LeetCode 909: Snakes and Ladders
A clear explanation of Snakes and Ladders using breadth-first search over board squares.
LeetCode 994: Rotting Oranges
A clear explanation of finding the minimum time for all oranges to rot using multi-source BFS.
LeetCode 993: Cousins in Binary Tree
A clear explanation of checking whether two binary tree nodes are cousins using BFS with parent tracking.
LeetCode 987: Vertical Order Traversal of a Binary Tree
A clear explanation of vertical tree traversal using coordinates, DFS, sorting, and column grouping.
LeetCode 934: Shortest Bridge
A clear explanation of solving Shortest Bridge using DFS to mark one island and BFS to expand toward the other island.
LeetCode 928: Minimize Malware Spread II
A clear explanation of solving Minimize Malware Spread II by removing each infected node and simulating the final malware spread.
LeetCode 749: Contain Virus
Simulate virus containment by repeatedly quarantining the most dangerous infected region and spreading the remaining regions.
LeetCode 742: Closest Leaf in a Binary Tree
Find the nearest leaf to a target node by converting the tree into an undirected graph and running breadth-first search.
LeetCode 733: Flood Fill
Recolor the connected component containing the starting pixel using depth-first search.
LeetCode 675: Cut Off Trees for Golf Event
A clear explanation of cutting trees in increasing height order using repeated BFS on a grid.
LeetCode 662: Maximum Width of Binary Tree
A clear explanation of computing the maximum width of a binary tree using level-order traversal and complete-tree indices.
LeetCode 637: Average of Levels in Binary Tree
A breadth-first search solution for computing the average value of nodes at each level of a binary tree.
LeetCode 559: Maximum Depth of N-ary Tree
A clear explanation of Maximum Depth of N-ary Tree using recursive depth-first search.
LeetCode 547: Number of Provinces
A clear explanation of counting connected components in an undirected graph represented by an adjacency matrix.
LeetCode 542: 01 Matrix
A clear explanation of computing the distance to the nearest zero in a binary matrix using multi-source BFS.
LeetCode 529: Minesweeper
A clear explanation of updating a Minesweeper board using DFS flood fill and adjacent mine counting.
LeetCode 365: Water and Jug Problem
A clear explanation of solving the Water and Jug Problem using Bézout's identity and greatest common divisor.
LeetCode 339: Nested List Weight Sum
A clear explanation of Nested List Weight Sum using depth-first search over a nested structure.
LeetCode 286: Walls and Gates
A multi-source BFS solution for filling each empty room with its shortest distance to the nearest gate.
LeetCode 279: Perfect Squares
A dynamic programming solution for finding the least number of perfect square numbers that sum to n.
LeetCode 100: Same Tree
A detailed guide to solving Same Tree with recursive DFS and structural comparison.
LeetCode 200: Number of Islands
A clear explanation of counting connected groups of land cells in a grid using DFS or BFS.
LeetCode 199: Binary Tree Right Side View
A clear explanation of returning the visible nodes from the right side of a binary tree using level-order traversal.