https://leetcode-solutions-5zk.pages.dev/tags/graph-theory/Recent content in Graph Theory on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://leetcode-solutions-5zk.pages.dev/posts/1728-cat-and-mouse-ii/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1728-cat-and-mouse-ii/Hard | Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1719-number-of-ways-to-reconstruct-a-tree/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1719-number-of-ways-to-reconstruct-a-tree/Hard | Array, Hash Table, Tree, Graph Theory, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/1976-number-of-ways-to-arrive-at-destination/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1976-number-of-ways-to-arrive-at-destination/Medium | Dynamic Programming, Graph Theory, Topological Sort, Shortest Pathhttps://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/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/2242-maximum-score-of-a-node-sequence/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2242-maximum-score-of-a-node-sequence/Hard | Array, Graph Theory, Sorting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2359-find-closest-node-to-given-two-nodes/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2359-find-closest-node-to-given-two-nodes/Medium | Depth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2392-build-a-matrix-with-conditions/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2392-build-a-matrix-with-conditions/Hard | Array, Graph Theory, Topological Sort, 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/1192-critical-connections-in-a-network/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1192-critical-connections-in-a-network/Hard | Depth-First Search, Graph Theory, Biconnected Componenthttps://leetcode-solutions-5zk.pages.dev/posts/1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/Hard | Union-Find, Graph Theory, Sorting, Minimum Spanning Tree, Strongly Connected Componenthttps://leetcode-solutions-5zk.pages.dev/posts/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable/Hard | Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1916-count-ways-to-build-rooms-in-an-ant-colony/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1916-count-ways-to-build-rooms-in-an-ant-colony/Hard | Array, Math, Dynamic Programming, Tree, Depth-First Search, Graph Theory, Topological Sort, Combinatoricshttps://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/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/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/0913-cat-and-mouse/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0913-cat-and-mouse/Hard | Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Game Theoryhttps://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/3241-time-taken-to-mark-all-nodes/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3241-time-taken-to-mark-all-nodes/Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://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/3244-shortest-distance-after-road-addition-queries-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/Hard | Array, Greedy, Graph Theory, Ordered Sethttps://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/3311-construct-2d-grid-matching-graph-layout/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3311-construct-2d-grid-matching-graph-layout/Hard | Array, Hash Table, Graph Theory, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/Medium | Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Pathhttps://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/3435-frequencies-of-shortest-supersequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3435-frequencies-of-shortest-supersequences/Hard | Array, String, Bit Manipulation, Graph Theory, Topological Sort, Enumerationhttps://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/3530-maximum-profit-from-valid-topological-order-in-dag/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3530-maximum-profit-from-valid-topological-order-in-dag/Hard | Array, Dynamic Programming, Bit Manipulation, Graph Theory, Topological Sort, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3532-path-existence-queries-in-a-graph-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3532-path-existence-queries-in-a-graph-i/Medium | Array, Hash Table, Binary Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3534-path-existence-queries-in-a-graph-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3534-path-existence-queries-in-a-graph-ii/Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Greedy, Bit Manipulation, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3543-maximum-weighted-k-edge-path/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3543-maximum-weighted-k-edge-path/Medium | Hash Table, Dynamic Programming, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3547-maximum-sum-of-edge-values-in-a-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3547-maximum-sum-of-edge-values-in-a-graph/Hard | Math, Greedy, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/Hard | Array, Bit Manipulation, Graph Theory, Heap (Priority Queue), Shortest Path, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3600-maximize-spanning-tree-stability-with-upgrades/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3600-maximize-spanning-tree-stability-with-upgrades/Hard | Binary Search, Greedy, Union-Find, Graph Theory, Minimum Spanning Treehttps://leetcode-solutions-5zk.pages.dev/posts/3604-minimum-time-to-reach-destination-in-directed-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3604-minimum-time-to-reach-destination-in-directed-graph/Medium | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://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/3608-minimum-time-for-k-connected-components/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3608-minimum-time-for-k-connected-components/Medium | Binary Search, Union-Find, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3613-minimize-maximum-component-cost/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3613-minimize-maximum-component-cost/Medium | Binary Search, Union-Find, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3615-longest-palindromic-path-in-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3615-longest-palindromic-path-in-graph/Hard | String, Dynamic Programming, Bit Manipulation, Graph Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3620-network-recovery-pathways/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3620-network-recovery-pathways/Hard | Array, Binary Search, Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3650-minimum-cost-path-with-edge-reversals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3650-minimum-cost-path-with-edge-reversals/Medium | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://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/3812-minimum-edge-toggles-on-a-tree/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3812-minimum-edge-toggles-on-a-tree/Hard | Tree, Depth-First Search, Graph Theory, Topological Sort, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3887-incremental-even-weighted-cycle-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3887-incremental-even-weighted-cycle-queries/Hard | Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2976-minimum-cost-to-convert-string-i/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2976-minimum-cost-to-convert-string-i/Medium | Array, String, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2977-minimum-cost-to-convert-string-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2977-minimum-cost-to-convert-string-ii/Hard | Array, String, Dynamic Programming, Graph Theory, Trie, Shortest Pathhttps://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/3017-count-the-number-of-houses-at-a-certain-distance-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3017-count-the-number-of-houses-at-a-certain-distance-ii/Hard | Graph Theory, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3108-minimum-cost-walk-in-weighted-graph/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3108-minimum-cost-walk-in-weighted-graph/Hard | Array, Bit Manipulation, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3112-minimum-time-to-visit-disappearing-nodes/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3112-minimum-time-to-visit-disappearing-nodes/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://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/2642-design-graph-with-shortest-path-calculator/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2642-design-graph-with-shortest-path-calculator/Hard | Graph Theory, Design, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2646-minimize-the-total-price-of-the-trips/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2646-minimize-the-total-price-of-the-trips/Hard | Array, Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2662-minimum-cost-of-a-path-with-special-roads/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2662-minimum-cost-of-a-path-with-special-roads/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://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/2699-modify-graph-edge-weights/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2699-modify-graph-edge-weights/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://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/2876-count-visited-nodes-in-a-directed-graph/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2876-count-visited-nodes-in-a-directed-graph/Hard | Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/2924-find-champion-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2924-find-champion-ii/Medium | Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2959-number-of-possible-sets-of-closing-branches/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2959-number-of-possible-sets-of-closing-branches/Hard | Bit Manipulation, Graph Theory, Heap (Priority Queue), Enumeration, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2050-parallel-courses-iii/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2050-parallel-courses-iii/Hard | Array, Dynamic Programming, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2065-maximum-path-quality-of-a-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2065-maximum-path-quality-of-a-graph/Hard | Array, Backtracking, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2076-process-restricted-friend-requests/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2076-process-restricted-friend-requests/Hard | Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2097-valid-arrangement-of-pairs/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2097-valid-arrangement-of-pairs/Hard | Array, Depth-First Search, Graph Theory, Eulerian Circuithttps://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/2115-find-all-possible-recipes-from-given-supplies/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2115-find-all-possible-recipes-from-given-supplies/Medium | Array, Hash Table, String, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2127-maximum-employees-to-be-invited-to-a-meeting/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2127-maximum-employees-to-be-invited-to-a-meeting/Hard | Array, Dynamic Programming, Depth-First Search, Graph Theory, Topological Sorthttps://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/2203-minimum-weighted-subgraph-with-the-required-paths/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2203-minimum-weighted-subgraph-with-the-required-paths/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2246-longest-path-with-different-adjacent-characters/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2246-longest-path-with-different-adjacent-characters/Hard | Array, String, Tree, Depth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2285-maximum-total-importance-of-roads/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2285-maximum-total-importance-of-roads/Medium | Greedy, Graph Theory, Sorting, Heap (Priority Queue)https://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/2374-node-with-highest-edge-score/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2374-node-with-highest-edge-score/Medium | Hash Table, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2421-number-of-good-paths/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2421-number-of-good-paths/Hard | Array, Hash Table, Tree, Union-Find, Graph Theory, Sortinghttps://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/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/2497-maximum-star-sum-of-a-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2497-maximum-star-sum-of-a-graph/Medium | Array, Greedy, Graph Theory, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2508-add-edges-to-make-degrees-of-all-nodes-even/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2508-add-edges-to-make-degrees-of-all-nodes-even/Hard | Hash Table, Graph Theoryhttps://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/2603-collect-coins-in-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2603-collect-coins-in-a-tree/Hard | Array, Tree, Graph Theory, Topological Sorthttps://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/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/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/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/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/Medium | Dynamic Programming, Graph Theory, Shortest Pathhttps://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/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/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/1494-parallel-courses-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1494-parallel-courses-ii/Hard | Dynamic Programming, Bit Manipulation, Graph Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1514-path-with-maximum-probability/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1514-path-with-maximum-probability/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1557-minimum-number-of-vertices-to-reach-all-nodes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1557-minimum-number-of-vertices-to-reach-all-nodes/Medium | Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1584-min-cost-to-connect-all-points/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1584-min-cost-to-connect-all-points/Medium | Array, Union-Find, Graph Theory, Minimum Spanning Treehttps://leetcode-solutions-5zk.pages.dev/posts/1591-strange-printer-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1591-strange-printer-ii/Hard | Array, Graph Theory, Topological Sort, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1615-maximal-network-rank/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1615-maximal-network-rank/Medium | Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1632-rank-transform-of-a-matrix/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1632-rank-transform-of-a-matrix/Hard | Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1697-checking-existence-of-edge-length-limited-paths/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1697-checking-existence-of-edge-length-limited-paths/Hard | Array, Two Pointers, Union-Find, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1761-minimum-degree-of-a-connected-trio-in-a-graph/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1761-minimum-degree-of-a-connected-trio-in-a-graph/Hard | Graph Theory, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/1782-count-pairs-of-nodes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1782-count-pairs-of-nodes/Hard | Array, Hash Table, Two Pointers, Binary Search, Graph Theory, Sorting, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/Medium | Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1791-find-center-of-star-graph/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1791-find-center-of-star-graph/Easy | Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1857-largest-color-value-in-a-directed-graph/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1857-largest-color-value-in-a-directed-graph/Hard | Hash Table, String, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1928-minimum-cost-to-reach-destination-in-time/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1928-minimum-cost-to-reach-destination-in-time/Hard | Array, Dynamic Programming, Graph Theoryhttps://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/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/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/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/0753-cracking-the-safe/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0753-cracking-the-safe/Hard | String, Depth-First Search, Graph Theory, Eulerian Circuithttps://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/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/0834-sum-of-distances-in-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0834-sum-of-distances-in-tree/Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://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/0851-loud-and-rich/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0851-loud-and-rich/Medium | Array, Depth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0882-reachable-nodes-in-subdivided-graph/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0882-reachable-nodes-in-subdivided-graph/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://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/0947-most-stones-removed-with-same-row-or-column/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0947-most-stones-removed-with-same-row-or-column/Medium | Hash Table, Depth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0990-satisfiability-of-equality-equations/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0990-satisfiability-of-equality-equations/Medium | Array, String, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0997-find-the-town-judge/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0997-find-the-town-judge/Easy | Array, Hash Table, Graph Theoryhttps://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/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/0332-reconstruct-itinerary/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0332-reconstruct-itinerary/Hard | Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuithttps://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/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/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/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