https://leetcode-solutions-5zk.pages.dev/tags/divide-and-conquer/Recent content in Divide and Conquer on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://leetcode-solutions-5zk.pages.dev/posts/3841-palindromic-path-queries-in-a-tree/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3841-palindromic-path-queries-in-a-tree/Hard | Array, String, Divide and Conquer, Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/0395-longest-substring-with-at-least-k-repeating-characters/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0395-longest-substring-with-at-least-k-repeating-characters/Medium | Hash Table, String, Divide and Conquer, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/0427-construct-quad-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0427-construct-quad-tree/Medium | Array, Divide and Conquer, Tree, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0973-k-closest-points-to-origin/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0973-k-closest-points-to-origin/Medium | Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/3537-fill-a-special-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3537-fill-a-special-grid/Medium | Array, Divide and Conquer, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3624-number-of-integers-with-popcount-depth-equal-to-k-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3624-number-of-integers-with-popcount-depth-equal-to-k-ii/Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3636-threshold-majority-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3636-threshold-majority-queries/Hard | Array, Hash Table, Binary Search, Divide and Conquer, Counting, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3653-xor-after-range-multiplication-queries-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3653-xor-after-range-multiplication-queries-i/Medium | Array, Divide and Conquer, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3655-xor-after-range-multiplication-queries-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3655-xor-after-range-multiplication-queries-ii/Hard | Array, Divide and Conquerhttps://leetcode-solutions-5zk.pages.dev/posts/3719-longest-balanced-subarray-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3719-longest-balanced-subarray-i/Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3721-longest-balanced-subarray-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3721-longest-balanced-subarray-ii/Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3737-count-subarrays-with-majority-element-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3737-count-subarrays-with-majority-element-i/Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Counting, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3759-count-elements-with-at-least-k-greater-values/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3759-count-elements-with-at-least-k-greater-values/Medium | Array, Binary Search, Divide and Conquer, Sorting, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/Hard | Array, Divide and Conquer, Dynamic Programming, Queue, Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/3855-sum-of-k-digit-numbers-in-a-range/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3855-sum-of-k-digit-numbers-in-a-range/Hard | Math, Divide and Conquer, Combinatorics, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3864-minimum-cost-to-partition-a-binary-string/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3864-minimum-cost-to-partition-a-binary-string/Hard | String, Divide and Conquer, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3165-maximum-sum-of-subsequence-with-non-adjacent-elements/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3165-maximum-sum-of-subsequence-with-non-adjacent-elements/Hard | Array, Divide and Conquer, Dynamic Programming, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2343-query-kth-smallest-trimmed-number/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2343-query-kth-smallest-trimmed-number/Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Radix Sort, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/Hard | Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/1382-balance-a-binary-search-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1382-balance-a-binary-search-tree/Medium | Divide and Conquer, Greedy, Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://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/1649-create-sorted-array-through-instructions/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/Medium | Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/1763-longest-nice-substring/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1763-longest-nice-substring/Easy | Hash Table, String, Divide and Conquer, Bit Manipulation, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/1985-find-the-kth-largest-integer-in-the-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1985-find-the-kth-largest-integer-in-the-array/Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/0761-special-binary-string/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0761-special-binary-string/Hard | String, Divide and Conquer, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0889-construct-binary-tree-from-preorder-and-postorder-traversal/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0889-construct-binary-tree-from-preorder-and-postorder-traversal/Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0912-sort-an-array/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0912-sort-an-array/Medium | Array, Divide and Conquer, Sorting, Heap (Priority Queue), Merge Sort, Bucket Sort, Radix Sort, Counting Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0918-maximum-sum-circular-subarray/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0918-maximum-sum-circular-subarray/Medium | Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/0932-beautiful-array/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0932-beautiful-array/Medium | Array, Math, Divide and Conquerhttps://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0558-logical-or-of-two-binary-grids-represented-as-quad-trees/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0558-logical-or-of-two-binary-grids-represented-as-quad-trees/Medium | Divide and Conquer, Treehttps://leetcode-solutions-5zk.pages.dev/posts/0654-maximum-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0654-maximum-binary-tree/Medium | Array, Divide and Conquer, Stack, Tree, Monotonic Stack, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0324-wiggle-sort-ii/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0324-wiggle-sort-ii/Medium | Array, Divide and Conquer, Greedy, Sorting, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0347-top-k-frequent-elements/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0347-top-k-frequent-elements/Medium | Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/0372-super-pow/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0372-super-pow/Medium | Math, Divide and Conquerhttps://leetcode-solutions-5zk.pages.dev/posts/0105-construct-binary-tree-from-preorder-and-inorder-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0105-construct-binary-tree-from-preorder-and-inorder-traversal/Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0106-construct-binary-tree-from-inorder-and-postorder-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0106-construct-binary-tree-from-inorder-and-postorder-traversal/Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0108-convert-sorted-array-to-binary-search-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0108-convert-sorted-array-to-binary-search-tree/Easy | Array, Divide and Conquer, Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0109-convert-sorted-list-to-binary-search-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0109-convert-sorted-list-to-binary-search-tree/Medium | Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0148-sort-list/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0148-sort-list/Medium | Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0169-majority-element/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0169-majority-element/Easy | Array, Hash Table, Divide and Conquer, Sorting, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/0190-reverse-bits/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0190-reverse-bits/Easy | Divide and Conquer, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0191-number-of-1-bits/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0191-number-of-1-bits/Easy | Divide and Conquer, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0215-kth-largest-element-in-an-array/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0215-kth-largest-element-in-an-array/Medium | Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0023-merge-k-sorted-lists/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0023-merge-k-sorted-lists/Hard | Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0240-search-a-2d-matrix-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0240-search-a-2d-matrix-ii/Medium | Array, Binary Search, Divide and Conquer, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0307-range-sum-query-mutable/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0307-range-sum-query-mutable/Medium | Array, Divide and Conquer, Design, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0004-median-of-two-sorted-arrays/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0004-median-of-two-sorted-arrays/Hard | Array, Binary Search, Divide and Conquerhttps://leetcode-solutions-5zk.pages.dev/posts/0053-maximum-subarray/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0053-maximum-subarray/Medium | Array, Divide and Conquer, Dynamic Programming