https://leetcode-solutions-5zk.pages.dev/tags/breadth-first-search/Recent content in Breadth-First Search on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://leetcode-solutions-5zk.pages.dev/posts/1263-minimum-moves-to-move-a-box-to-their-target-location/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1263-minimum-moves-to-move-a-box-to-their-target-location/Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1631-path-with-minimum-effort/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1631-path-with-minimum-effort/Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1765-map-of-highest-peak/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1765-map-of-highest-peak/Medium | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1926-nearest-exit-from-entrance-in-maze/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1926-nearest-exit-from-entrance-in-maze/Medium | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1992-find-all-groups-of-farmland/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1992-find-all-groups-of-farmland/Medium | Array, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2039-the-time-when-the-network-becomes-idle/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2039-the-time-when-the-network-becomes-idle/Medium | Array, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2045-second-minimum-time-to-reach-destination/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2045-second-minimum-time-to-reach-destination/Hard | Breadth-First Search, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2059-minimum-operations-to-convert-number/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2059-minimum-operations-to-convert-number/Medium | Array, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2092-find-all-people-with-secret/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2092-find-all-people-with-secret/Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2146-k-highest-ranked-items-within-a-price-range/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2146-k-highest-ranked-items-within-a-price-range/Medium | Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2258-escape-the-spreading-fire/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2258-escape-the-spreading-fire/Hard | Array, Binary Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1034-coloring-a-border/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1034-coloring-a-border/Medium | Array, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1129-shortest-path-with-alternating-colors/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1129-shortest-path-with-alternating-colors/Medium | Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1162-as-far-from-land-as-possible/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1162-as-far-from-land-as-possible/Medium | Array, Dynamic Programming, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0126-word-ladder-ii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0126-word-ladder-ii/Hard | Hash Table, String, Backtracking, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1267-count-servers-that-communicate/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1267-count-servers-that-communicate/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/0127-word-ladder/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0127-word-ladder/Hard | Hash Table, String, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1443-minimum-time-to-collect-all-apples-in-a-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1443-minimum-time-to-collect-all-apples-in-a-tree/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1483-kth-ancestor-of-a-tree-node/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1483-kth-ancestor-of-a-tree-node/Hard | Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Designhttps://leetcode-solutions-5zk.pages.dev/posts/1559-detect-cycles-in-2d-grid/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1559-detect-cycles-in-2d-grid/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1568-minimum-number-of-days-to-disconnect-island/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1568-minimum-number-of-days-to-disconnect-island/Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Componenthttps://leetcode-solutions-5zk.pages.dev/posts/1625-lexicographically-smallest-string-after-applying-operations/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1625-lexicographically-smallest-string-after-applying-operations/Medium | String, Depth-First Search, Breadth-First Search, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/0199-binary-tree-right-side-view/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0199-binary-tree-right-side-view/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0407-trapping-rain-water-ii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0407-trapping-rain-water-ii/Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0463-island-perimeter/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0463-island-perimeter/Easy | Array, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0488-zuma-game/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0488-zuma-game/Hard | String, Dynamic Programming, Stack, Breadth-First Search, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/0513-find-bottom-left-tree-value/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0513-find-bottom-left-tree-value/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0514-freedom-trail/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0514-freedom-trail/Hard | String, Dynamic Programming, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0542-01-matrix/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0542-01-matrix/Medium | Array, Dynamic Programming, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0547-number-of-provinces/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0547-number-of-provinces/Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0559-maximum-depth-of-n-ary-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0559-maximum-depth-of-n-ary-tree/Easy | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0695-max-area-of-island/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0695-max-area-of-island/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0749-contain-virus/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0749-contain-virus/Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/0785-is-graph-bipartite/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0785-is-graph-bipartite/Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0827-making-a-large-island/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0827-making-a-large-island/Hard | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0839-similar-string-groups/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0839-similar-string-groups/Hard | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Findhttps://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/Hard | Array, Bit Manipulation, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0886-possible-bipartition/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0886-possible-bipartition/Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0934-shortest-bridge/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0934-shortest-bridge/Medium | Array, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0959-regions-cut-by-slashes/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0959-regions-cut-by-slashes/Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0994-rotting-oranges/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0994-rotting-oranges/Medium | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3203-find-minimum-diameter-after-merging-two-trees/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3203-find-minimum-diameter-after-merging-two-trees/Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3235-check-if-the-rectangle-corner-is-reachable/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3235-check-if-the-rectangle-corner-is-reachable/Hard | Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometryhttps://leetcode-solutions-5zk.pages.dev/posts/3243-shortest-distance-after-road-addition-queries-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3243-shortest-distance-after-road-addition-queries-i/Medium | Array, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3283-maximum-number-of-moves-to-kill-all-pawns/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3283-maximum-number-of-moves-to-kill-all-pawns/Hard | Array, Math, Bit Manipulation, Breadth-First Search, Game Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/Medium | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3310-remove-methods-from-project/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3310-remove-methods-from-project/Medium | Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i/Medium | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii/Hard | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3376-minimum-time-to-break-locks-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3376-minimum-time-to-break-locks-i/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Breadth-First Search, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3387-maximize-amount-after-two-days-of-conversions/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3387-maximize-amount-after-two-days-of-conversions/Medium | Array, String, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3419-minimize-the-maximum-edge-weight-of-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3419-minimize-the-maximum-edge-weight-of-graph/Medium | Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3493-properties-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3493-properties-graph/Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3528-unit-conversion-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3528-unit-conversion-i/Medium | Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3552-grid-teleportation-traversal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3552-grid-teleportation-traversal/Medium | Array, Hash Table, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3568-minimum-moves-to-clean-the-classroom/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3568-minimum-moves-to-clean-the-classroom/Medium | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3607-power-grid-maintenance/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3607-power-grid-maintenance/Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3619-count-islands-with-total-value-divisible-by-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3619-count-islands-with-total-value-divisible-by-k/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3629-minimum-jumps-to-reach-end-via-prime-teleportation/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3629-minimum-jumps-to-reach-end-via-prime-teleportation/Medium | Array, Hash Table, Math, Breadth-First Search, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3666-minimum-operations-to-equalize-binary-string/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3666-minimum-operations-to-equalize-binary-string/Hard | Math, String, Breadth-First Search, Union-Find, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3690-split-and-merge-array-transformation/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3690-split-and-merge-array-transformation/Medium | Array, Hash Table, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3710-maximum-partition-factor/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3710-maximum-partition-factor/Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3820-pythagorean-distance-nodes-in-a-tree/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3820-pythagorean-distance-nodes-in-a-tree/Medium | Tree, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2998-minimum-number-of-operations-to-make-x-and-y-equal/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2998-minimum-number-of-operations-to-make-x-and-y-equal/Medium | Dynamic Programming, Breadth-First Search, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/3015-count-the-number-of-houses-at-a-certain-distance-i/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3015-count-the-number-of-houses-at-a-certain-distance-i/Medium | Breadth-First Search, Graph Theory, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3123-find-edges-in-shortest-paths/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3123-find-edges-in-shortest-paths/Hard | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2641-cousins-in-binary-tree-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2641-cousins-in-binary-tree-ii/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2658-maximum-number-of-fish-in-a-grid/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2658-maximum-number-of-fish-in-a-grid/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2685-count-the-number-of-complete-components/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2685-count-the-number-of-complete-components/Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2812-find-the-safest-path-in-a-grid/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2812-find-the-safest-path-in-a-grid/Medium | Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2858-minimum-edge-reversals-so-every-node-is-reachable/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2858-minimum-edge-reversals-so-every-node-is-reachable/Hard | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2101-detonate-the-maximum-bombs/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2101-detonate-the-maximum-bombs/Medium | Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometryhttps://leetcode-solutions-5zk.pages.dev/posts/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph/Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2328-number-of-increasing-paths-in-a-grid/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2328-number-of-increasing-paths-in-a-grid/Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2360-longest-cycle-in-a-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2360-longest-cycle-in-a-graph/Hard | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2368-reachable-nodes-with-restrictions/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2368-reachable-nodes-with-restrictions/Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2385-amount-of-time-for-binary-tree-to-be-infected/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2385-amount-of-time-for-binary-tree-to-be-infected/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2415-reverse-odd-levels-of-binary-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2415-reverse-odd-levels-of-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2458-height-of-binary-tree-after-subtree-removal-queries/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2458-height-of-binary-tree-after-subtree-removal-queries/Hard | Array, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2467-most-profitable-path-in-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2467-most-profitable-path-in-a-tree/Medium | Array, Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2477-minimum-fuel-cost-to-report-to-the-capital/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2477-minimum-fuel-cost-to-report-to-the-capital/Medium | Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2492-minimum-score-of-a-path-between-two-cities/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2492-minimum-score-of-a-path-between-two-cities/Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2493-divide-nodes-into-the-maximum-number-of-groups/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2493-divide-nodes-into-the-maximum-number-of-groups/Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2503-maximum-number-of-points-from-grid-queries/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2503-maximum-number-of-points-from-grid-queries/Hard | Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/Medium | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2583-kth-largest-sum-in-a-binary-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2583-kth-largest-sum-in-a-binary-tree/Medium | Tree, Breadth-First Search, Sorting, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2596-check-knight-tour-configuration/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2596-check-knight-tour-configuration/Medium | Array, Depth-First Search, Breadth-First Search, Matrix, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2608-shortest-cycle-in-a-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2608-shortest-cycle-in-a-graph/Hard | Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2612-minimum-reverse-operations/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2612-minimum-reverse-operations/Hard | Array, Hash Table, Breadth-First Search, Union-Find, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2617-minimum-number-of-visited-cells-in-a-grid/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2617-minimum-number-of-visited-cells-in-a-grid/Hard | Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/Hard | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1293-shortest-path-in-a-grid-with-obstacles-elimination/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1293-shortest-path-in-a-grid-with-obstacles-elimination/Hard | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1298-maximum-candies-you-can-get-from-boxes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1298-maximum-candies-you-can-get-from-boxes/Hard | Array, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1302-deepest-leaves-sum/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1302-deepest-leaves-sum/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1306-jump-game-iii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1306-jump-game-iii/Medium | Array, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1311-get-watched-videos-by-your-friends/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1311-get-watched-videos-by-your-friends/Medium | Array, Hash Table, Breadth-First Search, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1315-sum-of-nodes-with-even-valued-grandparent/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1315-sum-of-nodes-with-even-valued-grandparent/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1319-number-of-operations-to-make-network-connected/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1319-number-of-operations-to-make-network-connected/Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1345-jump-game-iv/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1345-jump-game-iv/Hard | Array, Hash Table, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1361-validate-binary-tree-nodes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1361-validate-binary-tree-nodes/Medium | Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1376-time-needed-to-inform-all-employees/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1376-time-needed-to-inform-all-employees/Medium | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1377-frog-position-after-t-seconds/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1377-frog-position-after-t-seconds/Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1391-check-if-there-is-a-valid-path-in-a-grid/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1391-check-if-there-is-a-valid-path-in-a-grid/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1448-count-good-nodes-in-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1448-count-good-nodes-in-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1457-pseudo-palindromic-paths-in-a-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1457-pseudo-palindromic-paths-in-a-binary-tree/Medium | Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1462-course-schedule-iv/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1462-course-schedule-iv/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero/Medium | Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1519-number-of-nodes-in-the-sub-tree-with-the-same-label/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1519-number-of-nodes-in-the-sub-tree-with-the-same-label/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1609-even-odd-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1609-even-odd-tree/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1654-minimum-jumps-to-reach-home/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1654-minimum-jumps-to-reach-home/Medium | Array, Hash Table, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1905-count-sub-islands/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1905-count-sub-islands/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1970-last-day-where-you-can-still-cross/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1970-last-day-where-you-can-still-cross/Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1971-find-if-path-exists-in-graph/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1971-find-if-path-exists-in-graph/Easy | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1993-operations-on-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1993-operations-on-tree/Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Designhttps://leetcode-solutions-5zk.pages.dev/posts/1020-number-of-enclaves/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1020-number-of-enclaves/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1036-escape-a-large-maze/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1036-escape-a-large-maze/Hard | Array, Hash Table, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1042-flower-planting-with-no-adjacent/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1042-flower-planting-with-no-adjacent/Medium | Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1091-shortest-path-in-binary-matrix/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1091-shortest-path-in-binary-matrix/Medium | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1096-brace-expansion-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1096-brace-expansion-ii/Hard | Hash Table, String, Backtracking, Stack, Breadth-First Search, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1123-lowest-common-ancestor-of-deepest-leaves/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1123-lowest-common-ancestor-of-deepest-leaves/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1161-maximum-level-sum-of-a-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1161-maximum-level-sum-of-a-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1202-smallest-string-with-swaps/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1202-smallest-string-with-swaps/Medium | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1203-sort-items-by-groups-respecting-dependencies/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1203-sort-items-by-groups-respecting-dependencies/Hard | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/1210-minimum-moves-to-reach-target-with-rotations/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1210-minimum-moves-to-reach-target-with-rotations/Hard | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1254-number-of-closed-islands/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1254-number-of-closed-islands/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1261-find-elements-in-a-contaminated-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1261-find-elements-in-a-contaminated-binary-tree/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Design, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0721-accounts-merge/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0721-accounts-merge/Medium | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0733-flood-fill/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0733-flood-fill/Easy | Array, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0743-network-delay-time/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0743-network-delay-time/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0752-open-the-lock/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0752-open-the-lock/Medium | Array, Hash Table, String, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0765-couples-holding-hands/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0765-couples-holding-hands/Hard | Greedy, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0773-sliding-puzzle/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0773-sliding-puzzle/Hard | Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0778-swim-in-rising-water/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0778-swim-in-rising-water/Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0783-minimum-distance-between-bst-nodes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0783-minimum-distance-between-bst-nodes/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/Medium | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0797-all-paths-from-source-to-target/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0797-all-paths-from-source-to-target/Medium | Backtracking, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0802-find-eventual-safe-states/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0802-find-eventual-safe-states/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0815-bus-routes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0815-bus-routes/Hard | Array, Hash Table, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0841-keys-and-rooms/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0841-keys-and-rooms/Medium | Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0847-shortest-path-visiting-all-nodes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0847-shortest-path-visiting-all-nodes/Hard | Dynamic Programming, Bit Manipulation, Breadth-First Search, Graph Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0854-k-similar-strings/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0854-k-similar-strings/Hard | Hash Table, String, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0863-all-nodes-distance-k-in-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0863-all-nodes-distance-k-in-binary-tree/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0865-smallest-subtree-with-all-the-deepest-nodes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0865-smallest-subtree-with-all-the-deepest-nodes/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0909-snakes-and-ladders/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0909-snakes-and-ladders/Medium | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0919-complete-binary-tree-inserter/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0919-complete-binary-tree-inserter/Medium | Tree, Breadth-First Search, Design, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0924-minimize-malware-spread/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0924-minimize-malware-spread/Hard | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0928-minimize-malware-spread-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0928-minimize-malware-spread-ii/Hard | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0958-check-completeness-of-a-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0958-check-completeness-of-a-binary-tree/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0965-univalued-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0965-univalued-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0967-numbers-with-same-consecutive-differences/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0967-numbers-with-same-consecutive-differences/Medium | Backtracking, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0987-vertical-order-traversal-of-a-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0987-vertical-order-traversal-of-a-binary-tree/Hard | Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0993-cousins-in-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0993-cousins-in-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0515-find-largest-value-in-each-tree-row/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0515-find-largest-value-in-each-tree-row/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0529-minesweeper/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0529-minesweeper/Medium | Array, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0530-minimum-absolute-difference-in-bst/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0530-minimum-absolute-difference-in-bst/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0617-merge-two-binary-trees/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0617-merge-two-binary-trees/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0623-add-one-row-to-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0623-add-one-row-to-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0637-average-of-levels-in-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0637-average-of-levels-in-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0653-two-sum-iv-input-is-a-bst/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0653-two-sum-iv-input-is-a-bst/Easy | Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0655-print-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0655-print-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0662-maximum-width-of-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0662-maximum-width-of-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0672-bulb-switcher-ii/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0672-bulb-switcher-ii/Medium | Math, Bit Manipulation, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0675-cut-off-trees-for-golf-event/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0675-cut-off-trees-for-golf-event/Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0684-redundant-connection/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0684-redundant-connection/Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0685-redundant-connection-ii/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0685-redundant-connection-ii/Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0690-employee-importance/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0690-employee-importance/Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0322-coin-change/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0322-coin-change/Medium | Array, Dynamic Programming, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0329-longest-increasing-path-in-a-matrix/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0329-longest-increasing-path-in-a-matrix/Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0365-water-and-jug-problem/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0365-water-and-jug-problem/Medium | Math, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0399-evaluate-division/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0399-evaluate-division/Medium | Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0404-sum-of-left-leaves/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0404-sum-of-left-leaves/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0417-pacific-atlantic-water-flow/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0417-pacific-atlantic-water-flow/Medium | Array, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0429-n-ary-tree-level-order-traversal/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0429-n-ary-tree-level-order-traversal/Medium | Tree, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0433-minimum-genetic-mutation/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0433-minimum-genetic-mutation/Medium | Hash Table, String, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0449-serialize-and-deserialize-bst/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0449-serialize-and-deserialize-bst/Medium | String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0100-same-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0100-same-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0101-symmetric-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0101-symmetric-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0102-binary-tree-level-order-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0102-binary-tree-level-order-traversal/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0103-binary-tree-zigzag-level-order-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0103-binary-tree-zigzag-level-order-traversal/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0104-maximum-depth-of-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0104-maximum-depth-of-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0107-binary-tree-level-order-traversal-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0107-binary-tree-level-order-traversal-ii/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0111-minimum-depth-of-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0111-minimum-depth-of-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0112-path-sum/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0112-path-sum/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0116-populating-next-right-pointers-in-each-node/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0116-populating-next-right-pointers-in-each-node/Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0117-populating-next-right-pointers-in-each-node-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0117-populating-next-right-pointers-in-each-node-ii/Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0130-surrounded-regions/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0130-surrounded-regions/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0133-clone-graph/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0133-clone-graph/Medium | Hash Table, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0200-number-of-islands/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0200-number-of-islands/Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0207-course-schedule/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0207-course-schedule/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0210-course-schedule-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0210-course-schedule-ii/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0226-invert-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0226-invert-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0279-perfect-squares/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0279-perfect-squares/Medium | Math, Dynamic Programming, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0297-serialize-and-deserialize-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0297-serialize-and-deserialize-binary-tree/Hard | String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0301-remove-invalid-parentheses/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0301-remove-invalid-parentheses/Hard | String, Backtracking, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0310-minimum-height-trees/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0310-minimum-height-trees/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort