https://leetcode-solutions-5zk.pages.dev/tags/union-find/Recent content in Union-Find on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://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/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/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/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/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/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/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/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/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/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/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/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/3378-count-connected-components-in-lcm-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3378-count-connected-components-in-lcm-graph/Hard | Array, Hash Table, Math, Union-Find, Number Theoryhttps://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/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/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/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/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/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/3695-maximize-alternating-sum-using-swaps/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3695-maximize-alternating-sum-using-swaps/Hard | Array, Greedy, Union-Find, Sortinghttps://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/3873-maximum-points-activated-with-one-addition/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3873-maximum-points-activated-with-one-addition/Hard | Array, Hash Table, Union-Findhttps://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/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/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/2709-greatest-common-divisor-traversal/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2709-greatest-common-divisor-traversal/Hard | Array, Math, Union-Find, Number 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/2948-make-lexicographically-smallest-array-by-swapping-elements/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2948-make-lexicographically-smallest-array-by-swapping-elements/Medium | Array, Union-Find, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2003-smallest-missing-genetic-value-in-each-subtree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2003-smallest-missing-genetic-value-in-each-subtree/Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Findhttps://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/2157-groups-of-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2157-groups-of-strings/Hard | Array, Hash Table, String, Bit Manipulation, Union-Findhttps://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/2334-subarray-with-elements-greater-than-varying-threshold/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2334-subarray-with-elements-greater-than-varying-threshold/Hard | Array, Stack, Union-Find, Monotonic Stackhttps://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/2382-maximum-segment-sum-after-removals/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/Hard | Array, Union-Find, Prefix Sum, Ordered Sethttps://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/2424-longest-uploaded-prefix/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/Medium | Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Sethttps://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/2573-find-the-string-with-lcp/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/Hard | Array, String, Dynamic Programming, Greedy, Union-Find, Matrixhttps://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/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/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/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/1569-number-of-ways-to-reorder-array-to-get-same-bst/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1569-number-of-ways-to-reorder-array-to-get-same-bst/Hard | Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Treehttps://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/1627-graph-connectivity-with-threshold/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1627-graph-connectivity-with-threshold/Hard | Array, Math, Union-Find, Number 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/1722-minimize-hamming-distance-after-swap-operations/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1722-minimize-hamming-distance-after-swap-operations/Medium | Array, Depth-First Search, Union-Findhttps://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/1998-gcd-sort-of-an-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1998-gcd-sort-of-an-array/Hard | Array, Math, Union-Find, Sorting, Number Theoryhttps://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/1061-lexicographically-smallest-equivalent-string/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1061-lexicographically-smallest-equivalent-string/Medium | String, Union-Findhttps://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/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/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/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/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/0803-bricks-falling-when-hit/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0803-bricks-falling-when-hit/Hard | Array, Union-Find, Matrixhttps://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/0952-largest-component-size-by-common-factor/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0952-largest-component-size-by-common-factor/Hard | Array, Hash Table, Math, Union-Find, Number 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/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/0352-data-stream-as-disjoint-intervals/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0352-data-stream-as-disjoint-intervals/Hard | Hash Table, Binary Search, Union-Find, Design, Data Stream, Ordered Sethttps://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/0128-longest-consecutive-sequence/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0128-longest-consecutive-sequence/Medium | Array, Hash Table, Union-Findhttps://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/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, Matrix