<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Prefix Sum on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/prefix-sum/</link><description>Recent content in Prefix Sum on LeetCode 题解笔记</description><generator>Hugo</generator><language>zh-cn</language><copyright>2026 ZenzZwei</copyright><lastBuildDate>Mon, 11 May 2026 12:12:02 +0800</lastBuildDate><atom:link href="https://leetcode-solutions-5zk.pages.dev/tags/prefix-sum/index.xml" rel="self" type="application/rss+xml"/><item><title>3548. 等和网格分割 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3548-equal-sum-grid-partition-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3548-equal-sum-grid-partition-ii/</guid><description>Hard | Array, Hash Table, Matrix, Enumeration, Prefix Sum</description></item><item><title>1687. 从仓库向港口运送箱子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/</guid><description>Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>2025. 数组分割的最大方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2025-maximum-number-of-ways-to-partition-an-array/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2025-maximum-number-of-ways-to-partition-an-array/</guid><description>Hard | Array, Hash Table, Counting, Enumeration, Prefix Sum</description></item><item><title>2132. 邮票网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2132-stamping-the-grid/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2132-stamping-the-grid/</guid><description>Hard | Array, Greedy, Matrix, Prefix Sum</description></item><item><title>2391. 收集垃圾的最少总时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2391-minimum-amount-of-time-to-collect-garbage/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2391-minimum-amount-of-time-to-collect-garbage/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>2398. 预算内机器人的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2398-maximum-number-of-robots-within-budget/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2398-maximum-number-of-robots-within-budget/</guid><description>Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>1442. 统计能形成两个相等异或数组的三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1442-count-triplets-that-can-form-two-arrays-of-equal-xor/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1442-count-triplets-that-can-form-two-arrays-of-equal-xor/</guid><description>Medium | Array, Hash Table, Math, Bit Manipulation, Prefix Sum</description></item><item><title>1444. 切披萨的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1444-number-of-ways-of-cutting-a-pizza/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1444-number-of-ways-of-cutting-a-pizza/</guid><description>Hard | Array, Dynamic Programming, Memoization, Matrix, Prefix Sum</description></item><item><title>1915. 神奇字符串的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1915-number-of-wonderful-substrings/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1915-number-of-wonderful-substrings/</guid><description>Medium | Hash Table, String, Bit Manipulation, Prefix Sum</description></item><item><title>2772. 通过操作使所有数组元素等于零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2772-apply-operations-to-make-all-array-elements-equal-to-zero/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2772-apply-operations-to-make-all-array-elements-equal-to-zero/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3578. 计算最大值最小值差值不超过K的分割数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3578-count-partitions-with-max-min-difference-at-most-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3578-count-partitions-with-max-min-difference-at-most-k/</guid><description>Medium | Array, Dynamic Programming, Queue, Sliding Window, Prefix Sum, Monotonic Queue</description></item><item><title>363. 矩形区域不超过 K 的最大数值和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</guid><description>Hard | Array, Binary Search, Matrix, Prefix Sum, Ordered Set</description></item><item><title>560. 和为 K 的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0560-subarray-sum-equals-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0560-subarray-sum-equals-k/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3212. 计算 X 和 Y 频率相等的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3212-count-submatrices-with-equal-frequency-of-x-and-y/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3212-count-submatrices-with-equal-frequency-of-x-and-y/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>3224. 使数组差值相等的最少数组修改次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3224-minimum-array-changes-to-make-differences-equal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3224-minimum-array-changes-to-make-differences-equal/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3225. 网格操作的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3225-maximum-score-from-grid-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3225-maximum-score-from-grid-operations/</guid><description>Hard | Array, Dynamic Programming, Matrix, Prefix Sum</description></item><item><title>3250. 单调对的数目 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3250-find-the-count-of-monotonic-pairs-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3250-find-the-count-of-monotonic-pairs-i/</guid><description>Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum</description></item><item><title>3251. 单调数对的数目 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3251-find-the-count-of-monotonic-pairs-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3251-find-the-count-of-monotonic-pairs-ii/</guid><description>Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum</description></item><item><title>3261. 计算满足 K 约束的子字符串数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3261-count-substrings-that-satisfy-k-constraint-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3261-count-substrings-that-satisfy-k-constraint-ii/</guid><description>Hard | Array, String, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>3312. 排序的最大公约数对查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3312-sorted-gcd-pair-queries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3312-sorted-gcd-pair-queries/</guid><description>Hard | Array, Hash Table, Math, Binary Search, Combinatorics, Counting, Number Theory, Prefix Sum</description></item><item><title>3333. 寻找原始输入字符串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3333-find-the-original-typed-string-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3333-find-the-original-typed-string-ii/</guid><description>Hard | String, Dynamic Programming, Prefix Sum</description></item><item><title>3346. 执行操作后的最大元素频率 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3346-maximum-frequency-of-an-element-after-performing-operations-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3346-maximum-frequency-of-an-element-after-performing-operations-i/</guid><description>Medium | Array, Binary Search, Sliding Window, Sorting, Prefix Sum</description></item><item><title>3347. 执行操作后元素的最大频率 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3347-maximum-frequency-of-an-element-after-performing-operations-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3347-maximum-frequency-of-an-element-after-performing-operations-ii/</guid><description>Hard | Array, Binary Search, Sliding Window, Sorting, Prefix Sum</description></item><item><title>3354. 使数组元素等于零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3354-make-array-elements-equal-to-zero/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3354-make-array-elements-equal-to-zero/</guid><description>Easy | Array, Simulation, Prefix Sum</description></item><item><title>3355. 零数组变换I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3355-zero-array-transformation-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3355-zero-array-transformation-i/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3356. 零数组变换 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3356-zero-array-transformation-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3356-zero-array-transformation-ii/</guid><description>Medium | Array, Two Pointers, Binary Search, Prefix Sum</description></item><item><title>3361. 两字符串间的移位距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3361-shift-distance-between-two-strings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3361-shift-distance-between-two-strings/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>3362. 零数组转换 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3362-zero-array-transformation-iii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3362-zero-array-transformation-iii/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum</description></item><item><title>3364. 最小正和子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3364-minimum-positive-sum-subarray/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3364-minimum-positive-sum-subarray/</guid><description>Easy | Array, Sliding Window, Prefix Sum</description></item><item><title>3381. 长度可被 K 整除的最大子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3381-maximum-subarray-sum-with-length-divisible-by-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3381-maximum-subarray-sum-with-length-divisible-by-k/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3413. 从K个连续袋子中获得最多硬币</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3413-maximum-coins-from-k-consecutive-bags/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3413-maximum-coins-from-k-consecutive-bags/</guid><description>Medium | Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum</description></item><item><title>3425. 最长特殊路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3425-longest-special-path/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3425-longest-special-path/</guid><description>Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum</description></item><item><title>3427. 可变长度子数组的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3427-sum-of-variable-length-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3427-sum-of-variable-length-subarrays/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>3432. 偶数和差分的分割数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3432-count-partitions-with-even-sum-difference/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3432-count-partitions-with-even-sum-difference/</guid><description>Easy | Array, Math, Prefix Sum</description></item><item><title>3434. 子数组操作后的最大频率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3434-maximum-frequency-after-subarray-operation/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3434-maximum-frequency-after-subarray-operation/</guid><description>Medium | Array, Hash Table, Dynamic Programming, Greedy, Enumeration, Prefix Sum</description></item><item><title>3445. 奇偶频率差的最大值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3445-maximum-difference-between-even-and-odd-frequency-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3445-maximum-difference-between-even-and-odd-frequency-ii/</guid><description>Hard | String, Sliding Window, Enumeration, Prefix Sum</description></item><item><title>3473. 长度至少为 M 的 K 个子数组的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3473-sum-of-k-subarrays-with-length-at-least-m/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3473-sum-of-k-subarrays-with-length-at-least-m/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3480. 删除一个冲突对后的最大子数组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3480-maximize-subarrays-after-removing-one-conflicting-pair/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3480-maximize-subarrays-after-removing-one-conflicting-pair/</guid><description>Hard | Array, Segment Tree, Enumeration, Prefix Sum</description></item><item><title>3486. 最长特殊路径 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3486-longest-special-path-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3486-longest-special-path-ii/</guid><description>Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum</description></item><item><title>3494. 找到冲泡魔法药剂的最小时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3494-find-the-minimum-amount-of-time-to-brew-potions/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3494-find-the-minimum-amount-of-time-to-brew-potions/</guid><description>Medium | Array, Simulation, Prefix Sum</description></item><item><title>3500. 将数组分成子数组的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3500-minimum-cost-to-divide-array-into-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3500-minimum-cost-to-divide-array-into-subarrays/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3538. 最小旅行时间的合并操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3538-merge-operations-for-minimum-travel-time/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3538-merge-operations-for-minimum-travel-time/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3546. 相等和网格划分 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3546-equal-sum-grid-partition-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3546-equal-sum-grid-partition-i/</guid><description>Medium | Array, Matrix, Enumeration, Prefix Sum</description></item><item><title>3599. 分割数组以最小化异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3599-partition-array-to-minimize-xor/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3599-partition-array-to-minimize-xor/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation, Prefix Sum</description></item><item><title>3628. 插入一个字符后的最大子序列数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3628-maximum-number-of-subsequences-after-one-inserting/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3628-maximum-number-of-subsequences-after-one-inserting/</guid><description>Medium | String, Dynamic Programming, Greedy, Prefix Sum</description></item><item><title>3636. 阈值多数查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3636-threshold-majority-queries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3636-threshold-majority-queries/</guid><description>Hard | Array, Hash Table, Binary Search, Divide and Conquer, Counting, Prefix Sum</description></item><item><title>3652. 使用策略买卖股票的最佳时机</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3652-best-time-to-buy-and-sell-stock-using-strategy/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3652-best-time-to-buy-and-sell-stock-using-strategy/</guid><description>Medium | Array, Sliding Window, Prefix Sum</description></item><item><title>3654. 可整除子数组删除后的最小和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3654-minimum-sum-after-divisible-sum-deletions/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3654-minimum-sum-after-divisible-sum-deletions/</guid><description>Medium | Array, Hash Table, Dynamic Programming, Prefix Sum</description></item><item><title>3694. 删除子串后可达的不同点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3694-distinct-points-reachable-after-substring-removal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3694-distinct-points-reachable-after-substring-removal/</guid><description>Medium | Hash Table, String, Sliding Window, Prefix Sum</description></item><item><title>3698. 最小差值分割数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3698-split-array-with-minimum-difference/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3698-split-array-with-minimum-difference/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3699. Z字形数组I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3699-number-of-zigzag-arrays-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3699-number-of-zigzag-arrays-i/</guid><description>Hard | Dynamic Programming, Prefix Sum</description></item><item><title>3707. 相等分数子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3707-equal-score-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3707-equal-score-substrings/</guid><description>Easy | String, Prefix Sum</description></item><item><title>3709. 设计考试成绩追踪器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3709-design-exam-scores-tracker/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3709-design-exam-scores-tracker/</guid><description>Medium | Array, Binary Search, Design, Prefix Sum</description></item><item><title>3714. 最长平衡子串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3714-longest-balanced-substring-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3714-longest-balanced-substring-ii/</guid><description>Medium | Hash Table, String, Prefix Sum</description></item><item><title>3719. 最长平衡子数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3719-longest-balanced-subarray-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3719-longest-balanced-subarray-i/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum</description></item><item><title>3721. 最长平衡子数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3721-longest-balanced-subarray-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3721-longest-balanced-subarray-ii/</guid><description>Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum</description></item><item><title>3728. 边界和内部和相等的稳定子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3728-stable-subarrays-with-equal-boundary-and-interior-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3728-stable-subarrays-with-equal-boundary-and-interior-sum/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3729. 统计有序数组中能被K整除的不同子数组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3729-count-distinct-subarrays-divisible-by-k-in-sorted-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3729-count-distinct-subarrays-divisible-by-k-in-sorted-array/</guid><description>Hard | Array, Hash Table, Prefix Sum</description></item><item><title>3737. 统计具有主要元素的子数组数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3737-count-subarrays-with-majority-element-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3737-count-subarrays-with-majority-element-i/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Counting, Prefix Sum</description></item><item><title>3739. 计算多数元素子数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/</guid><description>Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Prefix Sum</description></item><item><title>3748. 统计稳定子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3748-count-stable-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3748-count-stable-subarrays/</guid><description>Hard | Array, Binary Search, Prefix Sum</description></item><item><title>3755. 寻找最大平衡异或子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3755-find-maximum-balanced-xor-subarray-length/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3755-find-maximum-balanced-xor-subarray-length/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Prefix Sum</description></item><item><title>3756. 拼接非零数字并乘以数字和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii/</guid><description>Medium | Math, String, Prefix Sum</description></item><item><title>3771. 地牢运行的总分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3771-total-score-of-dungeon-runs/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3771-total-score-of-dungeon-runs/</guid><description>Medium | Array, Binary Search, Prefix Sum</description></item><item><title>3788. 分割数组的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3788-maximum-score-of-a-split/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3788-maximum-score-of-a-split/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3797. 计算攀爬矩形网格的路径数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3797-count-routes-to-climb-a-rectangular-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3797-count-routes-to-climb-a-rectangular-grid/</guid><description>Hard | Array, Dynamic Programming, Matrix, Prefix Sum</description></item><item><title>3826. 最小分割得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/</guid><description>Hard | Array, Divide and Conquer, Dynamic Programming, Queue, Prefix Sum, Monotonic Queue</description></item><item><title>3845. 有界范围内的最大子数组异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/</guid><description>Hard | Array, Bit Manipulation, Trie, Queue, Sliding Window, Prefix Sum, Monotonic Queue</description></item><item><title>3862. 寻找最小平衡索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3862-find-the-smallest-balanced-index/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3862-find-the-smallest-balanced-index/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3864. 分割二进制字符串的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3864-minimum-cost-to-partition-a-binary-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3864-minimum-cost-to-partition-a-binary-string/</guid><description>Hard | String, Divide and Conquer, Prefix Sum</description></item><item><title>3883. 统计具有给定数字和的非递减数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3883-count-non-decreasing-arrays-with-given-digit-sums/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3883-count-non-decreasing-arrays-with-given-digit-sums/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3891. 最小增量以最大化特殊索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3891-minimum-increase-to-maximize-special-indices/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3891-minimum-increase-to-maximize-special-indices/</guid><description>Medium | Array, Dynamic Programming, Greedy, Prefix Sum</description></item><item><title>2968. 最大化频率分数的操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2968-apply-operations-to-maximize-frequency-score/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2968-apply-operations-to-maximize-frequency-score/</guid><description>Hard | Array, Binary Search, Sliding Window, Sorting, Prefix Sum</description></item><item><title>2971. 寻找周长最大的多边形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2971-find-polygon-with-the-largest-perimeter/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2971-find-polygon-with-the-largest-perimeter/</guid><description>Medium | Array, Greedy, Sorting, Prefix Sum</description></item><item><title>2983. 回文重新排列查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2983-palindrome-rearrangement-queries/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2983-palindrome-rearrangement-queries/</guid><description>Hard | Array, Hash Table, String, Prefix Sum</description></item><item><title>3015. 统计特定距离的房屋数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3015-count-the-number-of-houses-at-a-certain-distance-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3015-count-the-number-of-houses-at-a-certain-distance-i/</guid><description>Medium | Breadth-First Search, Graph Theory, Prefix Sum</description></item><item><title>3017. 统计距离为某个值的房屋对数目 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3017-count-the-number-of-houses-at-a-certain-distance-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3017-count-the-number-of-houses-at-a-certain-distance-ii/</guid><description>Hard | Graph Theory, Prefix Sum</description></item><item><title>3026. 最大好子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3026-maximum-good-subarray-sum/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3026-maximum-good-subarray-sum/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3028. 边界上的蚂蚁</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3028-ant-on-the-boundary/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3028-ant-on-the-boundary/</guid><description>Easy | Array, Simulation, Prefix Sum</description></item><item><title>3070. 统计包含左上角元素且和小于等于k的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3070-count-submatrices-with-top-left-element-and-sum-less-than-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3070-count-submatrices-with-top-left-element-and-sum-less-than-k/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>3077. K个不相交子数组的最大强度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3077-maximum-strength-of-k-disjoint-subarrays/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3077-maximum-strength-of-k-disjoint-subarrays/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3086. 收集 K 个 1 的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3086-minimum-moves-to-pick-k-ones/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3086-minimum-moves-to-pick-k-ones/</guid><description>Hard | Array, Greedy, Sliding Window, Prefix Sum</description></item><item><title>3096. 获得更多分数所需的最少层数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3096-minimum-levels-to-gain-more-points/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3096-minimum-levels-to-gain-more-points/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3129. 寻找所有可能的稳定二进制数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3129-find-all-possible-stable-binary-arrays-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3129-find-all-possible-stable-binary-arrays-i/</guid><description>Medium | Dynamic Programming, Prefix Sum</description></item><item><title>3130. 寻找所有可能的稳定二进制数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3130-find-all-possible-stable-binary-arrays-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3130-find-all-possible-stable-binary-arrays-ii/</guid><description>Hard | Dynamic Programming, Prefix Sum</description></item><item><title>3147. 从神秘地牢中获取最大能量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3147-taking-maximum-energy-from-the-mystic-dungeon/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3147-taking-maximum-energy-from-the-mystic-dungeon/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3152. 特殊数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3152-special-array-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3152-special-array-ii/</guid><description>Medium | Array, Binary Search, Prefix Sum</description></item><item><title>3179. 找出第 K 秒后的第 N 个值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3179-find-the-n-th-value-after-k-seconds/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3179-find-the-n-th-value-after-k-seconds/</guid><description>Medium | Array, Math, Simulation, Combinatorics, Prefix Sum</description></item><item><title>3191. 使二进制数组元素等于 1 的最小操作数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i/</guid><description>Medium | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum</description></item><item><title>2680. 最大或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2680-maximum-or/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2680-maximum-or/</guid><description>Medium | Array, Greedy, Bit Manipulation, Prefix Sum</description></item><item><title>2681. 英雄的力量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2681-power-of-heroes/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2681-power-of-heroes/</guid><description>Hard | Array, Math, Dynamic Programming, Sorting, Prefix Sum</description></item><item><title>2731. 机器人运动</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2731-movement-of-robots/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2731-movement-of-robots/</guid><description>Medium | Array, Brainteaser, Sorting, Prefix Sum</description></item><item><title>2845. 有趣子数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2845-count-of-interesting-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2845-count-of-interesting-subarrays/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>2848. 与汽车相交的点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2848-points-that-intersect-with-cars/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2848-points-that-intersect-with-cars/</guid><description>Easy | Array, Hash Table, Prefix Sum</description></item><item><title>2875. 无限数组中的最小子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2875-minimum-size-subarray-in-infinite-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2875-minimum-size-subarray-in-infinite-array/</guid><description>Medium | Array, Hash Table, Sliding Window, Prefix Sum</description></item><item><title>2906. 构造乘积矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2906-construct-product-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2906-construct-product-matrix/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2945. 寻找最大非递减数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2945-find-maximum-non-decreasing-array-length/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2945-find-maximum-non-decreasing-array-length/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Stack, Queue, Monotonic Stack, Prefix Sum, Monotonic Queue</description></item><item><title>2947. 统计美丽子字符串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2947-count-beautiful-substrings-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2947-count-beautiful-substrings-i/</guid><description>Medium | Hash Table, Math, String, Enumeration, Number Theory, Prefix Sum</description></item><item><title>2949. 统计美丽子字符串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2949-count-beautiful-substrings-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2949-count-beautiful-substrings-ii/</guid><description>Hard | Hash Table, Math, String, Number Theory, Prefix Sum</description></item><item><title>2017. 网格游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2017-grid-game/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2017-grid-game/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2024. 最大化考试的困惑度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2024-maximize-the-confusion-of-an-exam/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2024-maximize-the-confusion-of-an-exam/</guid><description>Medium | String, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>2055. 蜡烛之间的盘子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2055-plates-between-candles/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2055-plates-between-candles/</guid><description>Medium | Array, String, Binary Search, Prefix Sum</description></item><item><title>2100. 找到抢银行的好日子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2100-find-good-days-to-rob-the-bank/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2100-find-good-days-to-rob-the-bank/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>2106. 在至多 K 步后收集的最大水果数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2106-maximum-fruits-harvested-after-at-most-k-steps/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2106-maximum-fruits-harvested-after-at-most-k-steps/</guid><description>Hard | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>2121. 相同元素间的间隔</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2121-intervals-between-identical-elements/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2121-intervals-between-identical-elements/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>2145. 统计隐藏序列的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2145-count-the-hidden-sequences/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2145-count-the-hidden-sequences/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>2171. 移除魔法豆的最小数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2171-removing-minimum-number-of-magic-beans/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2171-removing-minimum-number-of-magic-beans/</guid><description>Medium | Array, Greedy, Sorting, Enumeration, Prefix Sum</description></item><item><title>2207. 最大化字符串中子序列的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2207-maximize-number-of-subsequences-in-a-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2207-maximize-number-of-subsequences-in-a-string/</guid><description>Medium | String, Greedy, Prefix Sum</description></item><item><title>2209. 用地毯覆盖后的最少白色瓷砖</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2209-minimum-white-tiles-after-covering-with-carpets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2209-minimum-white-tiles-after-covering-with-carpets/</guid><description>Hard | String, Dynamic Programming, Prefix Sum</description></item><item><title>2218. 从数组中取 K 个硬币的最大价值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2218-maximum-value-of-k-coins-from-piles/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2218-maximum-value-of-k-coins-from-piles/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>2222. 选择建筑物的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2222-number-of-ways-to-select-buildings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2222-number-of-ways-to-select-buildings/</guid><description>Medium | String, Dynamic Programming, Prefix Sum</description></item><item><title>2234. 花园的最大总美丽值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2234-maximum-total-beauty-of-the-gardens/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2234-maximum-total-beauty-of-the-gardens/</guid><description>Hard | Array, Two Pointers, Binary Search, Greedy, Sorting, Enumeration, Prefix Sum</description></item><item><title>2245. 拐弯路径的最大尾随零数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2245-maximum-trailing-zeros-in-a-cornered-path/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2245-maximum-trailing-zeros-in-a-cornered-path/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2251. 盛开花朵的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2251-number-of-flowers-in-full-bloom/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2251-number-of-flowers-in-full-bloom/</guid><description>Hard | Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set</description></item><item><title>2256. 最小平均差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2256-minimum-average-difference/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2256-minimum-average-difference/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>2270. 分割数组的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2270-number-of-ways-to-split-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2270-number-of-ways-to-split-array/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>2271. 地毯覆盖的最多白色瓷砖数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2271-maximum-white-tiles-covered-by-a-carpet/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2271-maximum-white-tiles-covered-by-a-carpet/</guid><description>Medium | Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum</description></item><item><title>2281. 巫师的总力量之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2281-sum-of-total-strength-of-wizards/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2281-sum-of-total-strength-of-wizards/</guid><description>Hard | Array, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>2302. 得分小于 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2302-count-subarrays-with-score-less-than-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2302-count-subarrays-with-score-less-than-k/</guid><description>Hard | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>2381. 移位字符串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2381-shifting-letters-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2381-shifting-letters-ii/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>2382. 删除后的最大线段和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/</guid><description>Hard | Array, Union-Find, Prefix Sum, Ordered Set</description></item><item><title>2389. 有限和的最长子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2389-longest-subsequence-with-limited-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2389-longest-subsequence-with-limited-sum/</guid><description>Easy | Array, Binary Search, Greedy, Sorting, Prefix Sum</description></item><item><title>2406. 将区间分为最少组数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2406-divide-intervals-into-minimum-number-of-groups/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2406-divide-intervals-into-minimum-number-of-groups/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum</description></item><item><title>2420. 找到所有好下标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2420-find-all-good-indices/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2420-find-all-good-indices/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>2428. 沙漏的最大总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2428-maximum-sum-of-an-hourglass/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2428-maximum-sum-of-an-hourglass/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2438. 2的幂次方范围乘积查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2438-range-product-queries-of-powers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2438-range-product-queries-of-powers/</guid><description>Medium | Array, Bit Manipulation, Prefix Sum</description></item><item><title>2439. 最小化数组的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2439-minimize-maximum-of-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2439-minimize-maximum-of-array/</guid><description>Medium | Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum</description></item><item><title>2448. 使数组元素相等的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2448-minimum-cost-to-make-array-equal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2448-minimum-cost-to-make-array-equal/</guid><description>Hard | Array, Binary Search, Greedy, Sorting, Prefix Sum</description></item><item><title>2478. 美丽分割的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2478-number-of-beautiful-partitions/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2478-number-of-beautiful-partitions/</guid><description>Hard | String, Dynamic Programming, Prefix Sum</description></item><item><title>2483. 商店的最小罚金</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2483-minimum-penalty-for-a-shop/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2483-minimum-penalty-for-a-shop/</guid><description>Medium | String, Prefix Sum</description></item><item><title>2485. 寻找中心整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2485-find-the-pivot-integer/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2485-find-the-pivot-integer/</guid><description>Easy | Math, Prefix Sum</description></item><item><title>2488. 中位数为 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2488-count-subarrays-with-median-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2488-count-subarrays-with-median-k/</guid><description>Hard | Array, Hash Table, Prefix Sum</description></item><item><title>2528. 最大化城市的最小电力</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2528-maximize-the-minimum-powered-city/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2528-maximize-the-minimum-powered-city/</guid><description>Hard | Array, Binary Search, Greedy, Queue, Sliding Window, Prefix Sum</description></item><item><title>2536. 将子矩阵元素增加一</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2536-increment-submatrices-by-one/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2536-increment-submatrices-by-one/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2552. 递增四元组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2552-count-increasing-quadruplets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2552-count-increasing-quadruplets/</guid><description>Hard | Array, Dynamic Programming, Binary Indexed Tree, Enumeration, Prefix Sum</description></item><item><title>2559. 统计范围内的元音字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2559-count-vowel-strings-in-ranges/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2559-count-vowel-strings-in-ranges/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>2574. 左右和的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2574-left-and-right-sum-differences/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2574-left-and-right-sum-differences/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>2587. 重新排列数组以最大化前缀分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2587-rearrange-array-to-maximize-prefix-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2587-rearrange-array-to-maximize-prefix-score/</guid><description>Medium | Array, Greedy, Sorting, Prefix Sum</description></item><item><title>2588. 统计美丽子数组的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2588-count-the-number-of-beautiful-subarrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2588-count-the-number-of-beautiful-subarrays/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Prefix Sum</description></item><item><title>2602. 使数组中所有元素相等的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2602-minimum-operations-to-make-all-array-elements-equal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2602-minimum-operations-to-make-all-array-elements-equal/</guid><description>Medium | Array, Binary Search, Sorting, Prefix Sum</description></item><item><title>2615. 距离和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2615-sum-of-distances/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2615-sum-of-distances/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>2640. 数组所有前缀的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2640-find-the-score-of-all-prefixes-of-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2640-find-the-score-of-all-prefixes-of-an-array/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1292. 元素和小于等于阈值的正方形的最大边长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/</guid><description>Medium | Array, Binary Search, Matrix, Prefix Sum</description></item><item><title>1310. 子数组异或查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1310-xor-queries-of-a-subarray/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1310-xor-queries-of-a-subarray/</guid><description>Medium | Array, Bit Manipulation, Prefix Sum</description></item><item><title>1314. 矩阵区域和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1314-matrix-block-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1314-matrix-block-sum/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>1352. 最后 K 个数字的乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1352-product-of-the-last-k-numbers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1352-product-of-the-last-k-numbers/</guid><description>Medium | Array, Math, Design, Data Stream, Prefix Sum</description></item><item><title>1371. 包含所有元音字母出现偶数次的最长子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1371-find-the-longest-substring-containing-vowels-in-even-counts/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1371-find-the-longest-substring-containing-vowels-in-even-counts/</guid><description>Medium | Hash Table, String, Bit Manipulation, Prefix Sum</description></item><item><title>1413. 逐步求和得到正数的最小值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1413-minimum-value-to-get-positive-step-by-step-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1413-minimum-value-to-get-positive-step-by-step-sum/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>1420. 构建数组使得恰好进行 K 次比较找到最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons/</guid><description>Hard | Dynamic Programming, Prefix Sum</description></item><item><title>1422. 分割字符串的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1422-maximum-score-after-splitting-a-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1422-maximum-score-after-splitting-a-string/</guid><description>Easy | String, Prefix Sum</description></item><item><title>1423. 可获得的最大点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1423-maximum-points-you-can-obtain-from-cards/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1423-maximum-points-you-can-obtain-from-cards/</guid><description>Medium | Array, Sliding Window, Prefix Sum</description></item><item><title>1480. 一维数组的动态和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1480-running-sum-of-1d-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1480-running-sum-of-1d-array/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>1508. 排序子数组和的范围求和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1508-range-sum-of-sorted-subarray-sums/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1508-range-sum-of-sorted-subarray-sums/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting, Prefix Sum</description></item><item><title>1524. 奇数和的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1524-number-of-sub-arrays-with-odd-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1524-number-of-sub-arrays-with-odd-sum/</guid><description>Medium | Array, Math, Dynamic Programming, Prefix Sum</description></item><item><title>1546. 和为目标值且不重叠的非空子数组的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/</guid><description>Medium | Array, Hash Table, Greedy, Prefix Sum</description></item><item><title>1588. 所有奇数长度子数组的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1588-sum-of-all-odd-length-subarrays/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1588-sum-of-all-odd-length-subarrays/</guid><description>Easy | Array, Math, Prefix Sum</description></item><item><title>1589. 任意排列的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1589-maximum-sum-obtained-of-any-permutation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1589-maximum-sum-obtained-of-any-permutation/</guid><description>Medium | Array, Greedy, Sorting, Prefix Sum</description></item><item><title>1590. 使数组和能被 P 整除</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1590-make-sum-divisible-by-p/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1590-make-sum-divisible-by-p/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>1621. K 个不重叠线段的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1621-number-of-sets-of-k-non-overlapping-line-segments/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1621-number-of-sets-of-k-non-overlapping-line-segments/</guid><description>Medium | Math, Dynamic Programming, Combinatorics, Prefix Sum</description></item><item><title>1658. 使 X 减到 0 的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1658-minimum-operations-to-reduce-x-to-zero/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1658-minimum-operations-to-reduce-x-to-zero/</guid><description>Medium | Array, Hash Table, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>1664. 使数组公平的方法数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1664-ways-to-make-a-fair-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1664-ways-to-make-a-fair-array/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1674. 使数组互补的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1674-minimum-moves-to-make-array-complementary/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1674-minimum-moves-to-make-array-complementary/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>1685. 有序数组中数字绝对差的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1685-sum-of-absolute-differences-in-a-sorted-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1685-sum-of-absolute-differences-in-a-sorted-array/</guid><description>Medium | Array, Math, Prefix Sum</description></item><item><title>1703. 使K个连续1的最少相邻交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1703-minimum-adjacent-swaps-for-k-consecutive-ones/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1703-minimum-adjacent-swaps-for-k-consecutive-ones/</guid><description>Hard | Array, Greedy, Sliding Window, Prefix Sum</description></item><item><title>1712. 将数组分割成三个子数组的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1712-ways-to-split-array-into-three-subarrays/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1712-ways-to-split-array-into-three-subarrays/</guid><description>Medium | Array, Two Pointers, Binary Search, Prefix Sum</description></item><item><title>1732. 寻找最高海拔</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1732-find-the-highest-altitude/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1732-find-the-highest-altitude/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>1737. 修改最少字符使满足三个条件之一</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1737-change-minimum-characters-to-satisfy-one-of-three-conditions/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1737-change-minimum-characters-to-satisfy-one-of-three-conditions/</guid><description>Medium | Hash Table, String, Counting, Prefix Sum</description></item><item><title>1738. 找到第 K 大的异或坐标值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</guid><description>Medium | Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselect</description></item><item><title>1744. 你能在你最喜欢的日子吃到你最喜欢的糖果吗？</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1744-can-you-eat-your-favorite-candy-on-your-favorite-day/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1744-can-you-eat-your-favorite-candy-on-your-favorite-day/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1769. 移动所有球到每个盒子所需的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1769-minimum-number-of-operations-to-move-all-balls-to-each-box/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1769-minimum-number-of-operations-to-move-all-balls-to-each-box/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>1829. 每个查询的最大异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1829-maximum-xor-for-each-query/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1829-maximum-xor-for-each-query/</guid><description>Medium | Array, Bit Manipulation, Prefix Sum</description></item><item><title>1838. 最高频元素的频数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1838-frequency-of-the-most-frequent-element/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1838-frequency-of-the-most-frequent-element/</guid><description>Medium | Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum</description></item><item><title>1854. 人口最多的年份</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1854-maximum-population-year/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1854-maximum-population-year/</guid><description>Easy | Array, Counting, Prefix Sum</description></item><item><title>1856. 子数组最小乘积的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1856-maximum-subarray-min-product/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1856-maximum-subarray-min-product/</guid><description>Medium | Array, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>1862. 向下取整数对和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1862-sum-of-floored-pairs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1862-sum-of-floored-pairs/</guid><description>Hard | Array, Math, Binary Search, Counting, Enumeration, Prefix Sum</description></item><item><title>1871. 跳跃游戏 VII</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1871-jump-game-vii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1871-jump-game-vii/</guid><description>Medium | String, Dynamic Programming, Sliding Window, Prefix Sum</description></item><item><title>1872. 石子游戏 VIII</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1872-stone-game-viii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1872-stone-game-viii/</guid><description>Hard | Array, Math, Dynamic Programming, Prefix Sum, Game Theory</description></item><item><title>1878. 获取网格中最大的三个菱形和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1878-get-biggest-three-rhombus-sums-in-a-grid/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1878-get-biggest-three-rhombus-sums-in-a-grid/</guid><description>Medium | Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sum</description></item><item><title>1889. 包装过程中的最小浪费空间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1889-minimum-space-wasted-from-packaging/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1889-minimum-space-wasted-from-packaging/</guid><description>Hard | Array, Binary Search, Sorting, Prefix Sum</description></item><item><title>1893. 检查是否所有整数都被数组覆盖</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1893-check-if-all-the-integers-in-a-range-are-covered/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1893-check-if-all-the-integers-in-a-range-are-covered/</guid><description>Easy | Array, Hash Table, Prefix Sum</description></item><item><title>1894. 找到需要补充粉笔的学生</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1894-find-the-student-that-will-replace-the-chalk/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1894-find-the-student-that-will-replace-the-chalk/</guid><description>Medium | Array, Binary Search, Simulation, Prefix Sum</description></item><item><title>1895. 最大魔方阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1895-largest-magic-square/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1895-largest-magic-square/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>1906. 最小绝对差值查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1906-minimum-absolute-difference-queries/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1906-minimum-absolute-difference-queries/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1930. 长度为3的唯一回文子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1930-unique-length-3-palindromic-subsequences/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1930-unique-length-3-palindromic-subsequences/</guid><description>Medium | Hash Table, String, Bit Manipulation, Prefix Sum</description></item><item><title>1943. 描述绘画</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1943-describe-the-painting/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1943-describe-the-painting/</guid><description>Medium | Array, Hash Table, Sorting, Prefix Sum</description></item><item><title>1959. 最多 K 次调整数组大小后的最小总浪费空间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1959-minimum-total-space-wasted-with-k-resizing-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1959-minimum-total-space-wasted-with-k-resizing-operations/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>1991. 在数组中找到中间索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1991-find-the-middle-index-in-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1991-find-the-middle-index-in-array/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>1000. 合并石头的最低成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1000-minimum-cost-to-merge-stones/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1000-minimum-cost-to-merge-stones/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>1004. 最大连续1的个数 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1004-max-consecutive-ones-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1004-max-consecutive-ones-iii/</guid><description>Medium | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>1074. 和为目标值的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1074-number-of-submatrices-that-sum-to-target/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1074-number-of-submatrices-that-sum-to-target/</guid><description>Hard | Array, Hash Table, Matrix, Prefix Sum</description></item><item><title>1094. 拼车</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1094-car-pooling/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1094-car-pooling/</guid><description>Medium | Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum</description></item><item><title>1109. 航班预订统计</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1109-corporate-flight-bookings/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1109-corporate-flight-bookings/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1124. 表现良好的最长时间段</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1124-longest-well-performing-interval/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1124-longest-well-performing-interval/</guid><description>Medium | Array, Hash Table, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>1140. 石子游戏 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1140-stone-game-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1140-stone-game-ii/</guid><description>Medium | Array, Math, Dynamic Programming, Prefix Sum, Game Theory</description></item><item><title>1177. 从子字符串中构造回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1177-can-make-palindrome-from-substring/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1177-can-make-palindrome-from-substring/</guid><description>Medium | Array, Hash Table, String, Bit Manipulation, Prefix Sum</description></item><item><title>1208. 预算内的相等子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1208-get-equal-substrings-within-budget/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1208-get-equal-substrings-within-budget/</guid><description>Medium | String, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>1248. 统计「优美子数组」</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1248-count-number-of-nice-subarrays/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1248-count-number-of-nice-subarrays/</guid><description>Medium | Array, Hash Table, Math, Sliding Window, Prefix Sum</description></item><item><title>724. 寻找数组的中心下标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0724-find-pivot-index/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0724-find-pivot-index/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>731. 我的日程安排表 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0731-my-calendar-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0731-my-calendar-ii/</guid><description>Medium | Array, Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set</description></item><item><title>732. 我的日程安排表 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/</guid><description>Hard | Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set</description></item><item><title>798. 最小旋转得到最高分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0798-smallest-rotation-with-highest-score/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0798-smallest-rotation-with-highest-score/</guid><description>Hard | Array, Prefix Sum</description></item><item><title>813. 最大平均值和的分组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0813-largest-sum-of-averages/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0813-largest-sum-of-averages/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>848. 字母移位</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0848-shifting-letters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0848-shifting-letters/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>862. 和至少为 K 的最短子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0862-shortest-subarray-with-sum-at-least-k/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0862-shortest-subarray-with-sum-at-least-k/</guid><description>Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>903. 有效的 DI 序列排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0903-valid-permutations-for-di-sequence/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0903-valid-permutations-for-di-sequence/</guid><description>Hard | String, Dynamic Programming, Prefix Sum</description></item><item><title>930. 和为目标值的二进制子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0930-binary-subarrays-with-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0930-binary-subarrays-with-sum/</guid><description>Medium | Array, Hash Table, Sliding Window, Prefix Sum</description></item><item><title>974. 和可被 K 整除的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0974-subarray-sums-divisible-by-k/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0974-subarray-sums-divisible-by-k/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>995. K 连续位的最小翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/</guid><description>Hard | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum</description></item><item><title>497. 非重叠矩形中的随机点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0497-random-point-in-non-overlapping-rectangles/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0497-random-point-in-non-overlapping-rectangles/</guid><description>Medium | Array, Math, Binary Search, Reservoir Sampling, Prefix Sum, Ordered Set, Randomized</description></item><item><title>523. 连续的子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0523-continuous-subarray-sum/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0523-continuous-subarray-sum/</guid><description>Medium | Array, Hash Table, Math, Prefix Sum</description></item><item><title>525. 连续数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0525-contiguous-array/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0525-contiguous-array/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>528. 按权重随机选择</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0528-random-pick-with-weight/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0528-random-pick-with-weight/</guid><description>Medium | Array, Math, Binary Search, Prefix Sum, Randomized</description></item><item><title>689. 三个非重叠子数组的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0689-maximum-sum-of-3-non-overlapping-subarrays/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0689-maximum-sum-of-3-non-overlapping-subarrays/</guid><description>Hard | Array, Dynamic Programming, Sliding Window, Prefix Sum</description></item><item><title>713. 乘积小于 K 的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0713-subarray-product-less-than-k/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0713-subarray-product-less-than-k/</guid><description>Medium | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>410. 分割数组的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0410-split-array-largest-sum/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0410-split-array-largest-sum/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum</description></item><item><title>209. 长度最小的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0209-minimum-size-subarray-sum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0209-minimum-size-subarray-sum/</guid><description>Medium | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>238. 除自身以外数组的乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0238-product-of-array-except-self/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0238-product-of-array-except-self/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>303. 区间和检索 - 数组不可变</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0303-range-sum-query-immutable/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0303-range-sum-query-immutable/</guid><description>Easy | Array, Design, Prefix Sum</description></item><item><title>304. 二维区域和检索 - 矩阵不可变</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0304-range-sum-query-2d-immutable/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0304-range-sum-query-2d-immutable/</guid><description>Medium | Array, Design, Matrix, Prefix Sum</description></item></channel></rss>