https://leetcode-solutions-5zk.pages.dev/tags/segment-tree/Recent content in Segment Tree on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://leetcode-solutions-5zk.pages.dev/posts/2286-booking-concert-tickets-in-groups/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2286-booking-concert-tickets-in-groups/Hard | Binary Search, Design, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Treehttps://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/1687-delivering-boxes-from-storage-to-ports/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/Hard | String, Greedy, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/0406-queue-reconstruction-by-height/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0406-queue-reconstruction-by-height/Medium | Array, Binary Indexed Tree, Segment Tree, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3209-number-of-subarrays-with-and-value-of-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3209-number-of-subarrays-with-and-value-of-k/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3291-minimum-number-of-valid-strings-to-form-target-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3291-minimum-number-of-valid-strings-to-form-target-i/Medium | Array, String, Binary Search, Dynamic Programming, Greedy, Trie, Segment Tree, Rolling Hash, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/3292-minimum-number-of-valid-strings-to-form-target-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3292-minimum-number-of-valid-strings-to-form-target-ii/Hard | Array, String, Binary Search, Dynamic Programming, Greedy, Segment Tree, Rolling Hash, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/3380-maximum-area-rectangle-with-point-constraints-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3380-maximum-area-rectangle-with-point-constraints-i/Medium | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3382-maximum-area-rectangle-with-point-constraints-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3382-maximum-area-rectangle-with-point-constraints-ii/Hard | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3410-maximize-subarray-sum-after-removing-all-occurrences-of-one-element/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3410-maximize-subarray-sum-after-removing-all-occurrences-of-one-element/Hard | Array, Dynamic Programming, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3420-count-non-decreasing-subarrays-after-k-operations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3420-count-non-decreasing-subarrays-after-k-operations/Hard | Array, Stack, Segment Tree, Queue, Sliding Window, Monotonic Stack, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/3454-separate-squares-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3454-separate-squares-ii/Hard | Array, Binary Search, Segment Tree, Sweep Linehttps://leetcode-solutions-5zk.pages.dev/posts/3477-fruits-into-baskets-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3477-fruits-into-baskets-ii/Easy | Array, Binary Search, Segment Tree, Simulation, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3479-fruits-into-baskets-iii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3479-fruits-into-baskets-iii/Medium | Array, Binary Search, Segment Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3480-maximize-subarrays-after-removing-one-conflicting-pair/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3480-maximize-subarrays-after-removing-one-conflicting-pair/Hard | Array, Segment Tree, Enumeration, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3501-maximize-active-section-with-trade-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3501-maximize-active-section-with-trade-ii/Hard | Array, String, Binary Search, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3525-find-x-value-of-array-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3525-find-x-value-of-array-ii/Hard | Array, Math, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3569-maximize-count-of-distinct-primes-after-split/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3569-maximize-count-of-distinct-primes-after-split/Hard | Array, Math, Segment Tree, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3605-minimum-stability-factor-of-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3605-minimum-stability-factor-of-array/Hard | Array, Math, Binary Search, Greedy, Segment Tree, Number Theoryhttps://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/3691-maximum-total-subarray-value-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3691-maximum-total-subarray-value-ii/Hard | Array, Greedy, Segment Tree, Heap (Priority Queue)https://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/3762-minimum-operations-to-equalize-subarrays/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3762-minimum-operations-to-equalize-subarrays/Hard | Array, Math, Binary Search, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3768-minimum-inversion-count-in-subarrays-of-fixed-length/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3768-minimum-inversion-count-in-subarrays-of-fixed-length/Hard | Array, Segment Tree, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/3777-minimum-deletions-to-make-alternating-substring/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3777-minimum-deletions-to-make-alternating-substring/Hard | String, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3072-distribute-elements-into-two-arrays-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3072-distribute-elements-into-two-arrays-ii/Hard | Array, Binary Indexed Tree, Segment Tree, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queuehttps://leetcode-solutions-5zk.pages.dev/posts/3161-block-placement-queries/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3161-block-placement-queries/Hard | Array, Binary Search, Binary Indexed Tree, Segment Treehttps://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/3171-find-subarray-with-bitwise-or-closest-to-k/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3171-find-subarray-with-bitwise-or-closest-to-k/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3187-peaks-in-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3187-peaks-in-array/Hard | Array, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/Hard | Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Sorting, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/2916-subarrays-distinct-element-sum-of-squares-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2916-subarrays-distinct-element-sum-of-squares-ii/Hard | Array, Dynamic Programming, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/2926-maximum-balanced-subsequence-sum/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2926-maximum-balanced-subsequence-sum/Hard | Array, Binary Search, Dynamic Programming, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/2080-range-frequency-queries/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2080-range-frequency-queries/Medium | Array, Hash Table, Binary Search, Design, 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/2213-longest-substring-of-one-repeating-character/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2213-longest-substring-of-one-repeating-character/Hard | Array, String, Segment Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2276-count-integers-in-intervals/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2276-count-integers-in-intervals/Hard | Design, Segment Tree, Ordered Sethttps://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/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/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/2569-handling-sum-queries-after-update/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2569-handling-sum-queries-after-update/Hard | Array, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/1395-count-number-of-teams/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1395-count-number-of-teams/Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/1521-find-a-value-of-a-mysterious-function-closest-to-target/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1521-find-a-value-of-a-mysterious-function-closest-to-target/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/1622-fancy-sequence/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1622-fancy-sequence/Hard | Math, Design, Segment Tree, Number Theoryhttps://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/1157-online-majority-element-in-subarray/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1157-online-majority-element-in-subarray/Hard | Array, Binary Search, Design, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/0729-my-calendar-i/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0729-my-calendar-i/Medium | Array, Binary Search, Design, Segment Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0731-my-calendar-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0731-my-calendar-ii/Medium | Array, Binary Search, Design, Segment Tree, Prefix Sum, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/Hard | Binary Search, Design, Segment Tree, Prefix Sum, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/Hard | Array, Segment Tree, Sweep Line, Ordered Sethttps://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/0673-number-of-longest-increasing-subsequence/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0673-number-of-longest-increasing-subsequence/Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/0699-falling-squares/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0699-falling-squares/Hard | Array, Segment Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0715-range-module/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0715-range-module/Hard | Design, Segment Tree, Ordered Sethttps://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/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/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 Set