<?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>Greedy on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/greedy/</link><description>Recent content in Greedy 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/greedy/index.xml" rel="self" type="application/rss+xml"/><item><title>3348. 最小可整除数字乘积 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3348-smallest-divisible-digit-product-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3348-smallest-divisible-digit-product-ii/</guid><description>Hard | Math, String, Backtracking, Greedy, Number Theory</description></item><item><title>3357. 最小化相邻元素差值的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3357-minimize-the-maximum-adjacent-element-difference/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3357-minimize-the-maximum-adjacent-element-difference/</guid><description>Hard | Array, Binary Search, Greedy</description></item><item><title>3440. 重新安排会议以获得最大空闲时间 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3440-reschedule-meetings-for-maximum-free-time-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3440-reschedule-meetings-for-maximum-free-time-ii/</guid><description>Medium | Array, Greedy, Enumeration</description></item><item><title>3474. 字典序最小的生成字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3474-lexicographically-smallest-generated-string/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3474-lexicographically-smallest-generated-string/</guid><description>Hard | String, Greedy, String Matching</description></item><item><title>1675. 最小化数组偏差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1675-minimize-deviation-in-array/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1675-minimize-deviation-in-array/</guid><description>Hard | Array, Greedy, Heap (Priority Queue), Ordered Set</description></item><item><title>1705. 吃苹果的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1705-maximum-number-of-eaten-apples/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1705-maximum-number-of-eaten-apples/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1727. 重新排列后的最大子矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1727-largest-submatrix-with-rearrangements/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1727-largest-submatrix-with-rearrangements/</guid><description>Medium | Array, Greedy, Sorting, Matrix</description></item><item><title>1792. 最大平均通过率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1792-maximum-average-pass-ratio/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1792-maximum-average-pass-ratio/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1899. 合并三元组以形成目标三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1899-merge-triplets-to-form-target-triplet/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1899-merge-triplets-to-form-target-triplet/</guid><description>Medium | Array, Greedy</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>2141. N 台电脑的最长运行时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2141-maximum-running-time-of-n-computers/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2141-maximum-running-time-of-n-computers/</guid><description>Hard | Array, Binary Search, Greedy, Sorting</description></item><item><title>2233. K 次递增后的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2233-maximum-product-after-k-increments/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2233-maximum-product-after-k-increments/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>2333. 最小平方差之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2333-minimum-sum-of-squared-difference/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2333-minimum-sum-of-squared-difference/</guid><description>Medium | Array, Binary Search, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>1388. 3n 块披萨</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1388-pizza-with-3n-slices/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1388-pizza-with-3n-slices/</guid><description>Hard | Array, Dynamic Programming, Greedy, Heap (Priority Queue)</description></item><item><title>1405. 最长快乐字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1405-longest-happy-string/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1405-longest-happy-string/</guid><description>Medium | String, Greedy, Heap (Priority Queue)</description></item><item><title>1488. 避免洪水泛滥</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1488-avoid-flood-in-the-city/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1488-avoid-flood-in-the-city/</guid><description>Medium | Array, Hash Table, Binary Search, Greedy, Heap (Priority Queue)</description></item><item><title>1505. 最多K次相邻交换后的最小整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/</guid><description>Hard | String, Greedy, Binary Indexed Tree, Segment Tree</description></item><item><title>1536. 排列二进制网格的最少交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1536-minimum-swaps-to-arrange-a-binary-grid/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1536-minimum-swaps-to-arrange-a-binary-grid/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>2789. 合并操作后数组中的最大元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2789-largest-element-in-an-array-after-merge-operations/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2789-largest-element-in-an-array-after-merge-operations/</guid><description>Medium | Array, Greedy</description></item><item><title>2790. 递增长度的最大分组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2790-maximum-number-of-groups-with-increasing-length/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2790-maximum-number-of-groups-with-increasing-length/</guid><description>Hard | Array, Math, Binary Search, Greedy, Sorting</description></item><item><title>2800. 包含三个字符串的最短字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2800-shortest-string-that-contains-three-strings/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2800-shortest-string-that-contains-three-strings/</guid><description>Medium | String, Greedy, Enumeration</description></item><item><title>3572. 通过选择三个不同X值的三元组最大化Y值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3572-maximize-ysum-by-picking-a-triplet-of-distinct-xvalues/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3572-maximize-ysum-by-picking-a-triplet-of-distinct-xvalues/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>3576. 将数组转换为所有元素相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3576-transform-array-to-all-equal-elements/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3576-transform-array-to-all-equal-elements/</guid><description>Medium | Array, Greedy</description></item><item><title>632. 覆盖所有列表的最小区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0632-smallest-range-covering-elements-from-k-lists/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0632-smallest-range-covering-elements-from-k-lists/</guid><description>Hard | Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue)</description></item><item><title>969. 煎饼排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0969-pancake-sorting/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0969-pancake-sorting/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>3207. 敌人战斗后的最大点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3207-maximum-points-after-enemy-battles/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3207-maximum-points-after-enemy-battles/</guid><description>Medium | Array, Greedy</description></item><item><title>3216. 交换后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3216-lexicographically-smallest-string-after-a-swap/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3216-lexicographically-smallest-string-after-a-swap/</guid><description>Easy | String, Greedy</description></item><item><title>3218. 切蛋糕的最小总开销 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3218-minimum-cost-for-cutting-cake-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3218-minimum-cost-for-cutting-cake-i/</guid><description>Medium | Array, Two Pointers, Dynamic Programming, Greedy, Sorting</description></item><item><title>3219. 切割蛋糕的最小总开销 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3219-minimum-cost-for-cutting-cake-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3219-minimum-cost-for-cutting-cake-ii/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>3228. 将1移动到末尾的最大操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3228-maximum-number-of-operations-to-move-ones-to-the-end/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3228-maximum-number-of-operations-to-move-ones-to-the-end/</guid><description>Medium | String, Greedy, Counting</description></item><item><title>3229. 使数组等于目标数组所需的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3229-minimum-operations-to-make-array-equal-to-target/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3229-minimum-operations-to-make-array-equal-to-target/</guid><description>Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>3244. 道路修建查询后的最短距离 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/</guid><description>Hard | Array, Greedy, Graph Theory, Ordered Set</description></item><item><title>3260. 找到能被 K 整除的最大回文数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3260-find-the-largest-palindrome-divisible-by-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3260-find-the-largest-palindrome-divisible-by-k/</guid><description>Hard | Math, String, Dynamic Programming, Greedy, Number Theory</description></item><item><title>3273. 对鲍勃造成的最小伤害数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3273-minimum-amount-of-damage-dealt-to-bob/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3273-minimum-amount-of-damage-dealt-to-bob/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>3281. 区间内数字的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3281-maximize-score-of-numbers-in-ranges/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3281-maximize-score-of-numbers-in-ranges/</guid><description>Medium | Array, Binary Search, Greedy, Sorting</description></item><item><title>3282. 到达数组末尾的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3282-reach-end-of-array-with-max-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3282-reach-end-of-array-with-max-score/</guid><description>Medium | Array, Greedy</description></item><item><title>3291. 形成目标字符串的最少有效字符串数目 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3291-minimum-number-of-valid-strings-to-form-target-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3291-minimum-number-of-valid-strings-to-form-target-i/</guid><description>Medium | Array, String, Binary Search, Dynamic Programming, Greedy, Trie, Segment Tree, Rolling Hash, String Matching, Hash Function</description></item><item><title>3292. 形成目标字符串所需的最少有效字符串数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3292-minimum-number-of-valid-strings-to-form-target-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3292-minimum-number-of-valid-strings-to-form-target-ii/</guid><description>Hard | Array, String, Binary Search, Dynamic Programming, Greedy, Segment Tree, Rolling Hash, String Matching, Hash Function</description></item><item><title>3296. 使山峰高度为零的最小秒数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3296-minimum-number-of-seconds-to-make-mountain-height-zero/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3296-minimum-number-of-seconds-to-make-mountain-height-zero/</guid><description>Medium | Array, Math, Binary Search, Greedy, Heap (Priority Queue)</description></item><item><title>3301. 最大化独特塔的总高度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3301-maximize-the-total-height-of-unique-towers/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3301-maximize-the-total-height-of-unique-towers/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3302. 找到字典序最小的有效序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3302-find-the-lexicographically-smallest-valid-sequence/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3302-find-the-lexicographically-smallest-valid-sequence/</guid><description>Medium | Two Pointers, String, Dynamic Programming, Greedy</description></item><item><title>3326. 使数组非递减的最小除法运算次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3326-minimum-division-operations-to-make-array-non-decreasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3326-minimum-division-operations-to-make-array-non-decreasing/</guid><description>Medium | Array, Math, Greedy, Number Theory</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>3397. 操作后的最大不同元素数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3397-maximum-number-of-distinct-elements-after-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3397-maximum-number-of-distinct-elements-after-operations/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3402. 使列严格递增的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3402-minimum-operations-to-make-columns-strictly-increasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3402-minimum-operations-to-make-columns-strictly-increasing/</guid><description>Easy | Array, Greedy, Matrix</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>3424. 使数组相同的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3424-minimum-cost-to-make-arrays-identical/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3424-minimum-cost-to-make-arrays-identical/</guid><description>Medium | Array, Greedy, Sorting</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>3439. 重新安排会议以最大化空闲时间 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3439-reschedule-meetings-for-maximum-free-time-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3439-reschedule-meetings-for-maximum-free-time-i/</guid><description>Medium | Array, Greedy, Sliding Window</description></item><item><title>3449. 最大化最小游戏分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3449-maximize-the-minimum-game-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3449-maximize-the-minimum-game-score/</guid><description>Hard | Array, Binary Search, Greedy</description></item><item><title>3457. 吃披萨！</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3457-eat-pizzas/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3457-eat-pizzas/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3458. 选择 K 个不相交的特殊子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3458-select-k-disjoint-special-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3458-select-k-disjoint-special-substrings/</guid><description>Medium | Hash Table, String, Dynamic Programming, Greedy, Sorting</description></item><item><title>3462. 最多 K 个元素的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>3487. 删除后最大唯一子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3487-maximum-unique-subarray-sum-after-deletion/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3487-maximum-unique-subarray-sum-after-deletion/</guid><description>Easy | Array, Hash Table, Greedy</description></item><item><title>3523. 使数组非递减</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3523-make-array-non-decreasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3523-make-array-non-decreasing/</guid><description>Medium | Array, Stack, Greedy, Monotonic Stack</description></item><item><title>3534. 图中路径存在查询 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3534-path-existence-queries-in-a-graph-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3534-path-existence-queries-in-a-graph-ii/</guid><description>Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Greedy, Bit Manipulation, Graph Theory, Sorting</description></item><item><title>3542. 将所有元素转换为零的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3542-minimum-operations-to-convert-all-elements-to-zero/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3542-minimum-operations-to-convert-all-elements-to-zero/</guid><description>Medium | Array, Hash Table, Stack, Greedy, Monotonic Stack</description></item><item><title>3545. 最多 K 个不同字符的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3545-minimum-deletions-for-at-most-k-distinct-characters/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3545-minimum-deletions-for-at-most-k-distinct-characters/</guid><description>Easy | Hash Table, String, Greedy, Sorting, Counting</description></item><item><title>3547. 图中边值的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3547-maximum-sum-of-edge-values-in-a-graph/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3547-maximum-sum-of-edge-values-in-a-graph/</guid><description>Hard | Math, Greedy, Graph Theory</description></item><item><title>3557. 找到最大数量的不相交子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3557-find-maximum-number-of-non-intersecting-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3557-find-maximum-number-of-non-intersecting-substrings/</guid><description>Medium | Hash Table, String, Dynamic Programming, Greedy</description></item><item><title>3587. 最小相邻交换次数使奇偶性交替</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3587-minimum-adjacent-swaps-to-alternate-parity/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3587-minimum-adjacent-swaps-to-alternate-parity/</guid><description>Medium | Array, Greedy</description></item><item><title>3588. 找到三角形的最大面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3588-find-maximum-area-of-a-triangle/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3588-find-maximum-area-of-a-triangle/</guid><description>Medium | Array, Hash Table, Math, Greedy, Geometry, Enumeration</description></item><item><title>3600. 通过升级最大化生成树稳定性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3600-maximize-spanning-tree-stability-with-upgrades/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3600-maximize-spanning-tree-stability-with-upgrades/</guid><description>Hard | Binary Search, Greedy, Union-Find, Graph Theory, Minimum Spanning Tree</description></item><item><title>3605. 数组的最小稳定性因子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3605-minimum-stability-factor-of-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3605-minimum-stability-factor-of-array/</guid><description>Hard | Array, Math, Binary Search, Greedy, Segment Tree, Number Theory</description></item><item><title>3627. 长度为3的子序列的最大中位数和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3627-maximum-median-sum-of-subsequences-of-size-3/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3627-maximum-median-sum-of-subsequences-of-size-3/</guid><description>Medium | Array, Math, Greedy, Sorting, Game Theory</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>3630. 划分数组以最大化异或和与运算</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3630-partition-array-for-maximum-xor-and-and/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3630-partition-array-for-maximum-xor-and-and/</guid><description>Hard | Array, Math, Greedy, Bit Manipulation, Enumeration</description></item><item><title>3633. 陆地和水上游乐设施的最早完成时间 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3633-earliest-finish-time-for-land-and-water-rides-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3633-earliest-finish-time-for-land-and-water-rides-i/</guid><description>Easy | Array, Two Pointers, Binary Search, Greedy, Sorting</description></item><item><title>3635. 陆地和水上游乐设施的最早完成时间 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3635-earliest-finish-time-for-land-and-water-rides-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3635-earliest-finish-time-for-land-and-water-rides-ii/</guid><description>Medium | Array, Two Pointers, Binary Search, Greedy, Sorting</description></item><item><title>3638. 最大平衡货运数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3638-maximum-balanced-shipments/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3638-maximum-balanced-shipments/</guid><description>Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>3645. 从最优激活顺序中获得的最大总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3645-maximum-total-from-optimal-activation-order/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3645-maximum-total-from-optimal-activation-order/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>3675. 最少操作次数使字符串变为全'a'</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3675-minimum-operations-to-transform-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3675-minimum-operations-to-transform-string/</guid><description>Medium | String, Greedy</description></item><item><title>3680. 生成赛程表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3680-generate-schedule/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3680-generate-schedule/</guid><description>Medium | Array, Math, Greedy</description></item><item><title>3681. 子序列的最大异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3681-maximum-xor-of-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3681-maximum-xor-of-subsequences/</guid><description>Hard | Array, Math, Greedy, Bit Manipulation</description></item><item><title>3684. 最大化最多K个不同元素的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3684-maximize-sum-of-at-most-k-distinct-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3684-maximize-sum-of-at-most-k-distinct-elements/</guid><description>Easy | Array, Hash Table, Greedy, Sorting</description></item><item><title>3689. 最大子数组总值 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3689-maximum-total-subarray-value-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3689-maximum-total-subarray-value-i/</guid><description>Medium | Array, Greedy</description></item><item><title>3691. 最大子数组值总和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3691-maximum-total-subarray-value-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3691-maximum-total-subarray-value-ii/</guid><description>Hard | Array, Greedy, Segment Tree, Heap (Priority Queue)</description></item><item><title>3695. 使用交换最大化交替和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3695-maximize-alternating-sum-using-swaps/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3695-maximize-alternating-sum-using-swaps/</guid><description>Hard | Array, Greedy, Union-Find, Sorting</description></item><item><title>3720. 字典序最小的大于目标的排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3720-lexicographically-smallest-permutation-greater-than-target/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3720-lexicographically-smallest-permutation-greater-than-target/</guid><description>Medium | Hash Table, String, Greedy, Counting, Enumeration</description></item><item><title>3723. 最大化数字平方和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3723-maximize-sum-of-squares-of-digits/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3723-maximize-sum-of-squares-of-digits/</guid><description>Medium | Math, Greedy</description></item><item><title>3724. 使数组转换的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3724-minimum-operations-to-transform-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3724-minimum-operations-to-transform-array/</guid><description>Medium | Array, Greedy</description></item><item><title>3727. 最大交替平方和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3727-maximum-alternating-sum-of-squares/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3727-maximum-alternating-sum-of-squares/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3732. 一次替换后三个元素的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3732-maximum-product-of-three-elements-after-one-replacement/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3732-maximum-product-of-three-elements-after-one-replacement/</guid><description>Medium | Array, Math, Greedy, Sorting</description></item><item><title>3745. 最大化三个元素的表达式</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3745-maximize-expression-of-three-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3745-maximize-expression-of-three-elements/</guid><description>Easy | Array, Greedy, Sorting, Enumeration</description></item><item><title>3752. 字典序最小的求和为目标值的带符号排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3752-lexicographically-smallest-negated-permutation-that-sums-to-target/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3752-lexicographically-smallest-negated-permutation-that-sums-to-target/</guid><description>Medium | Array, Math, Two Pointers, Greedy, Sorting</description></item><item><title>3767. 选择K个任务后的最大积分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3767-maximize-points-after-choosing-k-tasks/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3767-maximize-points-after-choosing-k-tasks/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>3776. 平衡循环数组的最小移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3776-minimum-moves-to-balance-circular-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3776-minimum-moves-to-balance-circular-array/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3780. 能被三整除的三个数的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3780-maximum-sum-of-three-numbers-divisible-by-three/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3780-maximum-sum-of-three-numbers-divisible-by-three/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>3781. 二进制交换后的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3781-maximum-score-after-binary-swaps/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3781-maximum-score-after-binary-swaps/</guid><description>Medium | Array, String, Greedy, Heap (Priority Queue)</description></item><item><title>3785. 避免禁止值的最小交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3785-minimum-swaps-to-avoid-forbidden-values/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3785-minimum-swaps-to-avoid-forbidden-values/</guid><description>Hard | Array, Hash Table, Greedy, Counting</description></item><item><title>3789. 获取所需物品的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3789-minimum-cost-to-acquire-required-items/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3789-minimum-cost-to-acquire-required-items/</guid><description>Medium | Math, Greedy</description></item><item><title>3796. 在约束序列中找最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3796-find-maximum-value-in-a-constrained-sequence/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3796-find-maximum-value-in-a-constrained-sequence/</guid><description>Medium | Array, Greedy</description></item><item><title>3800. 使两个二进制字符串相等的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3800-minimum-cost-to-make-two-binary-strings-equal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3800-minimum-cost-to-make-two-binary-strings-equal/</guid><description>Medium | String, Greedy</description></item><item><title>3806. 递增操作后的最大按位与</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3806-maximum-bitwise-and-after-increment-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3806-maximum-bitwise-and-after-increment-operations/</guid><description>Hard | Array, Greedy, Bit Manipulation, Sorting</description></item><item><title>3810. 达到目标数组的最小操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3810-minimum-operations-to-reach-target-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3810-minimum-operations-to-reach-target-array/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>3816. 删除重复字符后的字典序最小字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3816-lexicographically-smallest-string-after-deleting-duplicate-characters/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3816-lexicographically-smallest-string-after-deleting-duplicate-characters/</guid><description>Hard | Hash Table, String, Stack, Greedy, Monotonic Stack</description></item><item><title>3849. 重新排列后的最大按位异或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3849-maximum-bitwise-xor-after-rearrangement/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3849-maximum-bitwise-xor-after-rearrangement/</guid><description>Medium | String, Greedy, Bit Manipulation</description></item><item><title>3854. 使数组奇偶性交替的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3854-minimum-operations-to-make-array-parity-alternating/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3854-minimum-operations-to-make-array-parity-alternating/</guid><description>Medium | Array, Greedy</description></item><item><title>3858. 网格中的最小按位或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3858-minimum-bitwise-or-from-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3858-minimum-bitwise-or-from-grid/</guid><description>Medium | Array, Greedy, Bit Manipulation, Matrix</description></item><item><title>3868. 使用交换使数组相等的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3868-minimum-cost-to-equalize-arrays-using-swaps/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3868-minimum-cost-to-equalize-arrays-using-swaps/</guid><description>Medium | Array, Hash Table, Greedy, Counting</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>2966. 将数组按最大差值分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2966-divide-array-into-arrays-with-max-difference/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2966-divide-array-into-arrays-with-max-difference/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2967. 使数组成为等回文数组的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2967-minimum-cost-to-make-array-equalindromic/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2967-minimum-cost-to-make-array-equalindromic/</guid><description>Medium | Array, Math, Binary Search, Greedy, Sorting</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>3002. 移除后集合的最大大小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3002-maximum-size-of-a-set-after-removals/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3002-maximum-size-of-a-set-after-removals/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>3012. 使用操作最小化数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3012-minimize-length-of-array-using-operations/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3012-minimize-length-of-array-using-operations/</guid><description>Medium | Array, Math, Greedy, Number Theory</description></item><item><title>3014. 输入单词的最小按键次数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3014-minimum-number-of-pushes-to-type-word-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3014-minimum-number-of-pushes-to-type-word-i/</guid><description>Easy | Math, String, Greedy</description></item><item><title>3016. 输入单词的最少按键次数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3016-minimum-number-of-pushes-to-type-word-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3016-minimum-number-of-pushes-to-type-word-ii/</guid><description>Medium | Hash Table, String, Greedy, Sorting, Counting</description></item><item><title>3022. 最小化剩余元素的按位或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3022-minimize-or-of-remaining-elements-using-operations/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3022-minimize-or-of-remaining-elements-using-operations/</guid><description>Hard | Array, Greedy, Bit Manipulation</description></item><item><title>3035. 操作后的最大回文数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3035-maximum-palindromes-after-operations/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3035-maximum-palindromes-after-operations/</guid><description>Medium | Array, Hash Table, String, Greedy, Sorting, Counting</description></item><item><title>3049. 标记所有索引的最早秒数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3049-earliest-second-to-mark-indices-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3049-earliest-second-to-mark-indices-ii/</guid><description>Hard | Array, Binary Search, Greedy, Heap (Priority Queue)</description></item><item><title>3068. 找到节点值的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3068-find-the-maximum-sum-of-node-values/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3068-find-the-maximum-sum-of-node-values/</guid><description>Hard | Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting</description></item><item><title>3074. 苹果重新分装到盒子里</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3074-apple-redistribution-into-boxes/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3074-apple-redistribution-into-boxes/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>3075. 选择儿童的最大幸福值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3075-maximize-happiness-of-selected-children/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3075-maximize-happiness-of-selected-children/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3081. 替换字符串中的问号使其值最小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3081-replace-question-marks-in-string-to-minimize-its-value/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3081-replace-question-marks-in-string-to-minimize-its-value/</guid><description>Medium | Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting</description></item><item><title>3085. 使字符串 K-特殊的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3085-minimum-deletions-to-make-string-k-special/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3085-minimum-deletions-to-make-string-k-special/</guid><description>Medium | Hash Table, String, Greedy, Sorting, Counting</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>3091. 使数组和大于等于 k 的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3091-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3091-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/</guid><description>Medium | Math, Greedy, Enumeration</description></item><item><title>3106. 约束条件下字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3106-lexicographically-smallest-string-after-operations-with-constraint/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3106-lexicographically-smallest-string-after-operations-with-constraint/</guid><description>Medium | String, Greedy</description></item><item><title>3107. 使数组中位数等于 K 的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3107-minimum-operations-to-make-median-of-array-equal-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3107-minimum-operations-to-make-median-of-array-equal-to-k/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3111. 覆盖点的最小矩形数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3111-minimum-rectangles-to-cover-points/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3111-minimum-rectangles-to-cover-points/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3139. 使数组相等的最小开销</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3139-minimum-cost-to-equalize-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3139-minimum-cost-to-equalize-array/</guid><description>Hard | Array, Greedy, Enumeration</description></item><item><title>3170. 移除星号后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3170-lexicographically-minimum-string-after-removing-stars/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3170-lexicographically-minimum-string-after-removing-stars/</guid><description>Medium | Hash Table, String, Stack, Greedy, Heap (Priority Queue)</description></item><item><title>3192. 使二进制数组元素全部等于 1 的最少操作次数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>2645. 构造有效字符串的最少插入次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2645-minimum-additions-to-make-valid-string/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2645-minimum-additions-to-make-valid-string/</guid><description>Medium | String, Dynamic Programming, Stack, Greedy</description></item><item><title>2656. 恰好使用 K 个元素求最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2656-maximum-sum-with-exactly-k-elements/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2656-maximum-sum-with-exactly-k-elements/</guid><description>Easy | Array, Greedy</description></item><item><title>2659. 数组清空</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/</guid><description>Hard | Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set</description></item><item><title>2663. 字典序最小的美丽字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2663-lexicographically-smallest-beautiful-string/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2663-lexicographically-smallest-beautiful-string/</guid><description>Hard | String, Greedy</description></item><item><title>2673. 使二叉树中所有路径的代价相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2673-make-costs-of-paths-equal-in-a-binary-tree/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2673-make-costs-of-paths-equal-in-a-binary-tree/</guid><description>Medium | Array, Dynamic Programming, Greedy, Tree, Binary Tree</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>2697. 字典序最小回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2697-lexicographically-smallest-palindrome/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2697-lexicographically-smallest-palindrome/</guid><description>Easy | Two Pointers, String, Greedy</description></item><item><title>2706. 购买两块巧克力</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2706-buy-two-chocolates/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2706-buy-two-chocolates/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>2708. 群体的最大强度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2708-maximum-strength-of-a-group/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2708-maximum-strength-of-a-group/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Greedy, Bit Manipulation, Sorting, Enumeration</description></item><item><title>2712. 使所有字符相等的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2712-minimum-cost-to-make-all-characters-equal/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2712-minimum-cost-to-make-all-characters-equal/</guid><description>Medium | String, Dynamic Programming, Greedy</description></item><item><title>2734. 子串操作后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2734-lexicographically-smallest-string-after-substring-operation/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2734-lexicographically-smallest-string-after-substring-operation/</guid><description>Medium | String, Greedy</description></item><item><title>2745. 构造最长的新字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2745-construct-the-longest-new-string/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2745-construct-the-longest-new-string/</guid><description>Medium | Math, Dynamic Programming, Greedy, Brainteaser</description></item><item><title>2811. 检查是否可以拆分数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2811-check-if-it-is-possible-to-split-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2811-check-if-it-is-possible-to-split-array/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>2813. 最大 K 长度子序列的优雅度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2813-maximum-elegance-of-a-k-length-subsequence/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2813-maximum-elegance-of-a-k-length-subsequence/</guid><description>Hard | Array, Hash Table, Stack, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2818. 应用操作最大化分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/</guid><description>Hard | Array, Math, Stack, Greedy, Sorting, Monotonic Stack, Number Theory</description></item><item><title>2829. 确定 k-避免数组的最小和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2829-determine-the-minimum-sum-of-a-k-avoiding-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2829-determine-the-minimum-sum-of-a-k-avoiding-array/</guid><description>Medium | Math, Greedy</description></item><item><title>2834. 找到美丽数组的最小可能和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2834-find-the-minimum-possible-sum-of-a-beautiful-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2834-find-the-minimum-possible-sum-of-a-beautiful-array/</guid><description>Medium | Math, Greedy</description></item><item><title>2835. 形成目标和子序列的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2835-minimum-operations-to-form-subsequence-with-target-sum/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2835-minimum-operations-to-form-subsequence-with-target-sum/</guid><description>Hard | Array, Greedy, Bit Manipulation</description></item><item><title>2842. 具有最大美丽值的字符串的 K 子序列数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2842-count-k-subsequences-of-a-string-with-maximum-beauty/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2842-count-k-subsequences-of-a-string-with-maximum-beauty/</guid><description>Hard | Hash Table, Math, String, Greedy, Sorting, Combinatorics</description></item><item><title>2844. 形成特殊数字的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2844-minimum-operations-to-make-a-special-number/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2844-minimum-operations-to-make-a-special-number/</guid><description>Medium | Math, String, Greedy, Enumeration</description></item><item><title>2856. 配对移除后的最小数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2856-minimum-array-length-after-pair-removals/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2856-minimum-array-length-after-pair-removals/</guid><description>Medium | Array, Hash Table, Two Pointers, Binary Search, Greedy, Counting</description></item><item><title>2864. 最大奇数二进制数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2864-maximum-odd-binary-number/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2864-maximum-odd-binary-number/</guid><description>Easy | Math, String, Greedy</description></item><item><title>2870. 使数组为空的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2870-minimum-number-of-operations-to-make-array-empty/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2870-minimum-number-of-operations-to-make-array-empty/</guid><description>Medium | Array, Hash Table, Greedy, Counting</description></item><item><title>2871. 将数组分割成最多数量的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2871-split-array-into-maximum-number-of-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2871-split-array-into-maximum-number-of-subarrays/</guid><description>Medium | Array, Greedy, Bit Manipulation</description></item><item><title>2895. 最小处理时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2895-minimum-processing-time/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2895-minimum-processing-time/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2897. 对数组执行操作以最大化平方和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2897-apply-operations-on-array-to-maximize-sum-of-squares/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2897-apply-operations-on-array-to-maximize-sum-of-squares/</guid><description>Hard | Array, Hash Table, Greedy, Bit Manipulation</description></item><item><title>2900. 最长不等邻接分组子序列 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2900-longest-unequal-adjacent-groups-subsequence-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2900-longest-unequal-adjacent-groups-subsequence-i/</guid><description>Easy | Array, String, Dynamic Programming, Greedy</description></item><item><title>2910. 创建有效分组的最少组数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2910-minimum-number-of-groups-to-create-a-valid-assignment/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2910-minimum-number-of-groups-to-create-a-valid-assignment/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>2918. 替换零后两数组的最小相等和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros/</guid><description>Medium | Array, Greedy</description></item><item><title>2931. 购买物品后的最大开销</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2931-maximum-spending-after-buying-items/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2931-maximum-spending-after-buying-items/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>2938. 分离黑白球</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2938-separate-black-and-white-balls/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2938-separate-black-and-white-balls/</guid><description>Medium | Two Pointers, String, Greedy</description></item><item><title>2939. 最大异或乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2939-maximum-xor-product/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2939-maximum-xor-product/</guid><description>Medium | Math, Greedy, Bit Manipulation</description></item><item><title>2952. 需要添加的硬币的最小数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2952-minimum-number-of-coins-to-be-added/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2952-minimum-number-of-coins-to-be-added/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2957. 移除相邻几乎相等字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2957-remove-adjacent-almost-equal-characters/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2957-remove-adjacent-almost-equal-characters/</guid><description>Medium | String, Dynamic Programming, Greedy</description></item><item><title>2007. 从双倍数组中还原原始数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2007-find-original-array-from-doubled-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2007-find-original-array-from-doubled-array/</guid><description>Medium | Array, Hash Table, Greedy, Sorting</description></item><item><title>2027. 转换字符串的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2027-minimum-moves-to-convert-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2027-minimum-moves-to-convert-string/</guid><description>Easy | String, Greedy</description></item><item><title>2029. 石子游戏 IX</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2029-stone-game-ix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2029-stone-game-ix/</guid><description>Medium | Array, Math, Greedy, Counting, Game Theory</description></item><item><title>2030. 长度为 K 且字母出现次数最少的最小字典序子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter/</guid><description>Hard | String, Stack, Greedy, Monotonic Stack</description></item><item><title>2037. 让每个学生都有座位的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2037-minimum-number-of-moves-to-seat-everyone/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2037-minimum-number-of-moves-to-seat-everyone/</guid><description>Easy | Array, Greedy, Sorting, Counting Sort</description></item><item><title>2038. 移除相同颜色的相邻棋子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color/</guid><description>Medium | Math, String, Greedy, Game Theory</description></item><item><title>2064. 分配给任意商店的最多商品的最小值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2064-minimized-maximum-of-products-distributed-to-any-store/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2064-minimized-maximum-of-products-distributed-to-any-store/</guid><description>Medium | Array, Binary Search, Greedy</description></item><item><title>2071. 能完成的最大任务数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2071-maximum-number-of-tasks-you-can-assign/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2071-maximum-number-of-tasks-you-can-assign/</guid><description>Hard | Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue</description></item><item><title>2078. 两栋不同颜色房屋的最大距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2078-two-furthest-houses-with-different-colors/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2078-two-furthest-houses-with-different-colors/</guid><description>Easy | Array, Greedy</description></item><item><title>2086. 喂养仓鼠的最少食物桶数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2086-minimum-number-of-food-buckets-to-feed-the-hamsters/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2086-minimum-number-of-food-buckets-to-feed-the-hamsters/</guid><description>Medium | String, Dynamic Programming, Greedy</description></item><item><title>2087. 网格中机器人的最小代价回家路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2087-minimum-cost-homecoming-of-a-robot-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2087-minimum-cost-homecoming-of-a-robot-in-a-grid/</guid><description>Medium | Array, Greedy</description></item><item><title>2091. 移除数组中的最小值和最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2091-removing-minimum-and-maximum-from-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2091-removing-minimum-and-maximum-from-array/</guid><description>Medium | Array, Greedy</description></item><item><title>2116. 检查括号字符串是否可以有效</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2116-check-if-a-parentheses-string-can-be-valid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2116-check-if-a-parentheses-string-can-be-valid/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>2126. 摧毁小行星</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2126-destroying-asteroids/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2126-destroying-asteroids/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2131. 通过连接两字母单词构造最长回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2131-longest-palindrome-by-concatenating-two-letter-words/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2131-longest-palindrome-by-concatenating-two-letter-words/</guid><description>Medium | Array, Hash Table, String, Greedy, Counting</description></item><item><title>2136. 最早盛开的日子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2136-earliest-possible-day-of-full-bloom/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2136-earliest-possible-day-of-full-bloom/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>2139. 达到目标分数的最小移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2139-minimum-moves-to-reach-target-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2139-minimum-moves-to-reach-target-score/</guid><description>Medium | Math, Greedy</description></item><item><title>2144. 打折买糖果的最小开销</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2144-minimum-cost-of-buying-candies-with-discount/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2144-minimum-cost-of-buying-candies-with-discount/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>2160. 分割四位数字后的最小和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2160-minimum-sum-of-four-digit-number-after-splitting-digits/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2160-minimum-sum-of-four-digit-number-after-splitting-digits/</guid><description>Easy | Math, Greedy, Sorting</description></item><item><title>2170. 使数组交替的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2170-minimum-operations-to-make-the-array-alternating/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2170-minimum-operations-to-make-the-array-alternating/</guid><description>Medium | Array, Hash Table, Greedy, Counting</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>2178. 正偶数的最大分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2178-maximum-split-of-positive-even-integers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2178-maximum-split-of-positive-even-integers/</guid><description>Medium | Math, Backtracking, Greedy</description></item><item><title>2182. 构造限制重复的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2182-construct-string-with-repeat-limit/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2182-construct-string-with-repeat-limit/</guid><description>Medium | Hash Table, String, Greedy, Heap (Priority Queue), Counting</description></item><item><title>2193. 将字符串转换为回文串的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2193-minimum-number-of-moves-to-make-palindrome/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2193-minimum-number-of-moves-to-make-palindrome/</guid><description>Hard | Two Pointers, String, Greedy, Binary Indexed Tree</description></item><item><title>2195. 用最小和添加K个整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2195-append-k-integers-with-minimal-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2195-append-k-integers-with-minimal-sum/</guid><description>Medium | Array, Math, Greedy, Sorting</description></item><item><title>2202. K 次操作后最大化栈顶元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2202-maximize-the-topmost-element-after-k-moves/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2202-maximize-the-topmost-element-after-k-moves/</guid><description>Medium | Array, Greedy</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>2208. 数组元素减半的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2208-minimum-operations-to-halve-array-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2208-minimum-operations-to-halve-array-sum/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>2216. 使数组变美丽的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2216-minimum-deletions-to-make-array-beautiful/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2216-minimum-deletions-to-make-array-beautiful/</guid><description>Medium | Array, Stack, Greedy</description></item><item><title>2224. 转换时间的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2224-minimum-number-of-operations-to-convert-time/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2224-minimum-number-of-operations-to-convert-time/</guid><description>Easy | String, Greedy</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>2241. 设计ATM机器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2241-design-an-atm-machine/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2241-design-an-atm-machine/</guid><description>Medium | Array, Greedy, Design</description></item><item><title>2244. 完成所有任务的最少轮数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2244-minimum-rounds-to-complete-all-tasks/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2244-minimum-rounds-to-complete-all-tasks/</guid><description>Medium | Array, Hash Table, Greedy, Counting</description></item><item><title>2259. 从数字中移除数字以最大化结果</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2259-remove-digit-from-number-to-maximize-result/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2259-remove-digit-from-number-to-maximize-result/</guid><description>Easy | String, Greedy, Enumeration</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>2279. 装满石头的袋子的最大数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2279-maximum-bags-with-full-capacity-of-rocks/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2279-maximum-bags-with-full-capacity-of-rocks/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2285. 道路的最大总重要性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2285-maximum-total-importance-of-roads/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2285-maximum-total-importance-of-roads/</guid><description>Medium | Greedy, Graph Theory, Sorting, Heap (Priority Queue)</description></item><item><title>2294. 分割数组使得最大差值为K</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2294-partition-array-such-that-maximum-difference-is-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2294-partition-array-such-that-maximum-difference-is-k/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2310. 个位数字为 K 的整数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2310-sum-of-numbers-with-units-digit-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2310-sum-of-numbers-with-units-digit-k/</guid><description>Medium | Math, Dynamic Programming, Greedy, Enumeration</description></item><item><title>2311. 最长的小于等于 K 的二进制子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2311-longest-binary-subsequence-less-than-or-equal-to-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2311-longest-binary-subsequence-less-than-or-equal-to-k/</guid><description>Medium | String, Dynamic Programming, Greedy, Memoization</description></item><item><title>2335. 装满杯子需要的最短总时长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2335-minimum-amount-of-time-to-fill-cups/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2335-minimum-amount-of-time-to-fill-cups/</guid><description>Easy | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2350. 最短不可能的掷骰子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2350-shortest-impossible-sequence-of-rolls/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2350-shortest-impossible-sequence-of-rolls/</guid><description>Hard | Array, Hash Table, Greedy</description></item><item><title>2357. 通过减去相等数量使数组归零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2357-make-array-zero-by-subtracting-equal-amounts/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2357-make-array-zero-by-subtracting-equal-amounts/</guid><description>Easy | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Simulation</description></item><item><title>2358. 进入比赛的最大小组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2358-maximum-number-of-groups-entering-a-competition/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2358-maximum-number-of-groups-entering-a-competition/</guid><description>Medium | Array, Math, Binary Search, Greedy</description></item><item><title>2366. 排序数组的最少替换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2366-minimum-replacements-to-sort-the-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2366-minimum-replacements-to-sort-the-array/</guid><description>Hard | Array, Math, Greedy</description></item><item><title>2375. 根据DI字符串构造最小数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2375-construct-smallest-number-from-di-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2375-construct-smallest-number-from-di-string/</guid><description>Medium | String, Backtracking, Stack, Greedy</description></item><item><title>2383. 赢得比赛所需的最少训练时长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2383-minimum-hours-of-training-to-win-a-competition/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2383-minimum-hours-of-training-to-win-a-competition/</guid><description>Easy | Array, Greedy</description></item><item><title>2384. 最大回文数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2384-largest-palindromic-number/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2384-largest-palindromic-number/</guid><description>Medium | Hash Table, String, Greedy, Counting</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>2405. 字符串的最优分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2405-optimal-partition-of-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2405-optimal-partition-of-string/</guid><description>Medium | Hash Table, String, Greedy</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>2410. 玩家和训练师的最大匹配数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2410-maximum-matching-of-players-with-trainers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2410-maximum-matching-of-players-with-trainers/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>2412. 交易前所需的最少资金</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2412-minimum-money-required-before-transactions/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2412-minimum-money-required-before-transactions/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>2429. 最小化异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2429-minimize-xor/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2429-minimize-xor/</guid><description>Medium | Greedy, Bit Manipulation</description></item><item><title>2434. 使用机器人打印字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2434-using-a-robot-to-print-the-lexicographically-smallest-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2434-using-a-robot-to-print-the-lexicographically-smallest-string/</guid><description>Medium | Hash Table, String, Stack, Greedy</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>2449. 使数组相似的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2449-minimum-number-of-operations-to-make-arrays-similar/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2449-minimum-number-of-operations-to-make-arrays-similar/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>2457. 使整数变美丽的最小增量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2457-minimum-addition-to-make-integer-beautiful/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2457-minimum-addition-to-make-integer-beautiful/</guid><description>Medium | Math, Greedy</description></item><item><title>2472. 最多非重叠回文子串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2472-maximum-number-of-non-overlapping-palindrome-substrings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2472-maximum-number-of-non-overlapping-palindrome-substrings/</guid><description>Hard | Two Pointers, String, Dynamic Programming, Greedy</description></item><item><title>2486. 追加字符以形成子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2486-append-characters-to-string-to-make-subsequence/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2486-append-characters-to-string-to-make-subsequence/</guid><description>Medium | Two Pointers, String, Greedy</description></item><item><title>2497. 图的最大星形子图和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2497-maximum-star-sum-of-a-graph/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2497-maximum-star-sum-of-a-graph/</guid><description>Medium | Array, Greedy, Graph Theory, Sorting, Heap (Priority Queue)</description></item><item><title>2498. 青蛙跳跃 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2498-frog-jump-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2498-frog-jump-ii/</guid><description>Medium | Array, Binary Search, Greedy</description></item><item><title>2499. 使数组不相等的最小总成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2499-minimum-total-cost-to-make-arrays-unequal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2499-minimum-total-cost-to-make-arrays-unequal/</guid><description>Hard | Array, Hash Table, Greedy, Counting</description></item><item><title>2517. 糖果篮子的最大甜美度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2517-maximum-tastiness-of-candy-basket/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2517-maximum-tastiness-of-candy-basket/</guid><description>Medium | Array, Binary Search, Greedy, Sorting</description></item><item><title>2522. 将字符串分割为最多 K 值的子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2522-partition-string-into-substrings-with-values-at-most-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2522-partition-string-into-substrings-with-values-at-most-k/</guid><description>Medium | String, Dynamic Programming, Greedy</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>2530. K次操作后的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2530-maximal-score-after-applying-k-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2530-maximal-score-after-applying-k-operations/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>2541. 使数组相等 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2541-minimum-operations-to-make-array-equal-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2541-minimum-operations-to-make-array-equal-ii/</guid><description>Medium | Array, Math, Greedy</description></item><item><title>2542. 最大子序列的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2542-maximum-subsequence-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2542-maximum-subsequence-score/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2551. 将弹珠放入包中</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2551-put-marbles-in-bags/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2551-put-marbles-in-bags/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2554. 从范围中选择整数的最大数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2554-maximum-number-of-integers-to-choose-from-a-range-i/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2554-maximum-number-of-integers-to-choose-from-a-range-i/</guid><description>Medium | Array, Hash Table, Binary Search, Greedy, Sorting</description></item><item><title>2560. 打家劫舍 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2560-house-robber-iv/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2560-house-robber-iv/</guid><description>Medium | Array, Binary Search, Dynamic Programming, Greedy</description></item><item><title>2561. 重新排列水果</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2561-rearranging-fruits/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2561-rearranging-fruits/</guid><description>Hard | Array, Hash Table, Greedy, Sort</description></item><item><title>2566. 重新映射数字的最大差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2566-maximum-difference-by-remapping-a-digit/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2566-maximum-difference-by-remapping-a-digit/</guid><description>Easy | Math, Greedy</description></item><item><title>2567. 通过改变两个元素来最小化分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2567-minimum-score-by-changing-two-elements/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2567-minimum-score-by-changing-two-elements/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2571. 使整数减为 0 的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2571-minimum-operations-to-reduce-an-integer-to-0/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2571-minimum-operations-to-reduce-an-integer-to-0/</guid><description>Medium | Dynamic Programming, Greedy, Bit Manipulation</description></item><item><title>2573. 寻找具有LCP的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/</guid><description>Hard | Array, String, Dynamic Programming, Greedy, Union-Find, Matrix</description></item><item><title>2576. 找到标记下标的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2576-find-the-maximum-number-of-marked-indices/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2576-find-the-maximum-number-of-marked-indices/</guid><description>Medium | Array, Two Pointers, Binary Search, Greedy, Sorting</description></item><item><title>2578. 将数字分割为最小和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2578-split-with-minimum-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2578-split-with-minimum-sum/</guid><description>Easy | Math, Greedy, Sorting</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>2589. 完成所有任务的最少时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2589-minimum-time-to-complete-all-tasks/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2589-minimum-time-to-complete-all-tasks/</guid><description>Hard | Array, Binary Search, Stack, Greedy, Sorting</description></item><item><title>2591. 分钱给最多的孩子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2591-distribute-money-to-maximum-children/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2591-distribute-money-to-maximum-children/</guid><description>Easy | Math, Greedy</description></item><item><title>2592. 最大化数组的伟大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2592-maximize-greatness-of-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2592-maximize-greatness-of-an-array/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>2598. 操作后的最小缺失非负整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2598-smallest-missing-non-negative-integer-after-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2598-smallest-missing-non-negative-integer-after-operations/</guid><description>Medium | Array, Hash Table, Math, Greedy</description></item><item><title>2600. 最大和的K个物品</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2600-k-items-with-the-maximum-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2600-k-items-with-the-maximum-sum/</guid><description>Easy | Math, Greedy</description></item><item><title>2601. 质数减法操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2601-prime-subtraction-operation/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2601-prime-subtraction-operation/</guid><description>Medium | Array, Math, Binary Search, Greedy, Number Theory</description></item><item><title>2607. 使 K 子数组和相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2607-make-k-subarray-sums-equal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2607-make-k-subarray-sums-equal/</guid><description>Medium | Array, Math, Greedy, Sorting, Number Theory</description></item><item><title>2611. 老鼠和奶酪</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2611-mice-and-cheese/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2611-mice-and-cheese/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2616. 最小化数对的最大差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2616-minimize-the-maximum-difference-of-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2616-minimize-the-maximum-difference-of-pairs/</guid><description>Medium | Array, Binary Search, Dynamic Programming, Greedy, Sorting</description></item><item><title>1282. 根据给定的组大小对人员进行分组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1282-group-the-people-given-the-group-size-they-belong-to/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1282-group-the-people-given-the-group-size-they-belong-to/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>1296. 将数组分成 K 个连续数字的集合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1296-divide-array-in-sets-of-k-consecutive-numbers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1296-divide-array-in-sets-of-k-consecutive-numbers/</guid><description>Medium | Array, Hash Table, Greedy, Sorting</description></item><item><title>1323. 最大 69 数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1323-maximum-69-number/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1323-maximum-69-number/</guid><description>Easy | Math, Greedy</description></item><item><title>1326. 浇灌花园的最少水龙头数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1326-minimum-number-of-taps-to-open-to-water-a-garden/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1326-minimum-number-of-taps-to-open-to-water-a-garden/</guid><description>Hard | Array, Dynamic Programming, Greedy</description></item><item><title>1328. 破坏回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1328-break-a-palindrome/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1328-break-a-palindrome/</guid><description>Medium | String, Greedy</description></item><item><title>1330. 反转子数组以最大化数组价值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1330-reverse-subarray-to-maximize-array-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1330-reverse-subarray-to-maximize-array-value/</guid><description>Hard | Array, Math, Greedy</description></item><item><title>1338. 数组大小减半</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1338-reduce-array-size-to-the-half/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1338-reduce-array-size-to-the-half/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>1353. 可以参加的最大活动数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1353-maximum-number-of-events-that-can-be-attended/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1353-maximum-number-of-events-that-can-be-attended/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>1363. 构成3的最大倍数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1363-largest-multiple-of-three/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1363-largest-multiple-of-three/</guid><description>Hard | Array, Math, Dynamic Programming, Greedy, Sorting</description></item><item><title>1382. 平衡二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1382-balance-a-binary-search-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1382-balance-a-binary-search-tree/</guid><description>Medium | Divide and Conquer, Greedy, Tree, Depth-First Search, Binary Search Tree, Binary Tree</description></item><item><title>1383. 团队的最大工作效率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1383-maximum-performance-of-a-team/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1383-maximum-performance-of-a-team/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>1386. 影院座位分配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1386-cinema-seat-allocation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1386-cinema-seat-allocation/</guid><description>Medium | Array, Hash Table, Greedy, Bit Manipulation</description></item><item><title>1400. 构造 K 个回文字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1400-construct-k-palindrome-strings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1400-construct-k-palindrome-strings/</guid><description>Medium | Hash Table, String, Greedy, Counting</description></item><item><title>1402. 减少菜肴</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1402-reducing-dishes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1402-reducing-dishes/</guid><description>Hard | Array, Dynamic Programming, Greedy, Sorting</description></item><item><title>1403. 非递增顺序的最小子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1403-minimum-subsequence-in-non-increasing-order/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1403-minimum-subsequence-in-non-increasing-order/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>1414. 找到和为 K 的最少斐波那契数字数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/</guid><description>Medium | Math, Greedy</description></item><item><title>1432. 改变整数得到的最大差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1432-max-difference-you-can-get-from-changing-an-integer/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1432-max-difference-you-can-get-from-changing-an-integer/</guid><description>Medium | Math, Greedy</description></item><item><title>1433. 检查一个字符串是否可以打破另一个字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1433-check-if-a-string-can-break-another-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1433-check-if-a-string-can-break-another-string/</guid><description>Medium | String, Greedy, Sorting</description></item><item><title>1465. 切蛋糕的最大面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1481. 删除 K 个元素后的最少唯一整数个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1481-least-number-of-unique-integers-after-k-removals/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1481-least-number-of-unique-integers-after-k-removals/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Counting</description></item><item><title>1509. 最多三次移动后数组最大值最小值的最小差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1520. 最大不重叠子字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1520-maximum-number-of-non-overlapping-substrings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1520-maximum-number-of-non-overlapping-substrings/</guid><description>Hard | Hash Table, String, Greedy, Sorting</description></item><item><title>1526. 形成目标数组的子数组最少增加次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array/</guid><description>Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>1529. 最少后缀翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1529-minimum-suffix-flips/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1529-minimum-suffix-flips/</guid><description>Medium | String, Greedy</description></item><item><title>1537. 获取最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1537-get-the-maximum-score/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1537-get-the-maximum-score/</guid><description>Hard | Array, Two Pointers, Dynamic Programming, Greedy</description></item><item><title>1541. 平衡括号字符串的最少插入次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1541-minimum-insertions-to-balance-a-parentheses-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1541-minimum-insertions-to-balance-a-parentheses-string/</guid><description>Medium | String, Stack, Greedy</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>1558. 使数组变为目标数组的最小函数调用次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1558-minimum-numbers-of-function-calls-to-make-target-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1558-minimum-numbers-of-function-calls-to-make-target-array/</guid><description>Medium | Array, Greedy, Bit Manipulation</description></item><item><title>1561. 你能获得的最大硬币数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1561-maximum-number-of-coins-you-can-get/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1561-maximum-number-of-coins-you-can-get/</guid><description>Medium | Array, Math, Greedy, Sorting, Game Theory</description></item><item><title>1567. 乘积为正数的最长子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1567-maximum-length-of-subarray-with-positive-product/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1567-maximum-length-of-subarray-with-positive-product/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>1578. 使绳子变彩色的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1578-minimum-time-to-make-rope-colorful/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1578-minimum-time-to-make-rope-colorful/</guid><description>Medium | Array, String, Dynamic Programming, Greedy</description></item><item><title>1585. 检查字符串是否可以通过排序子字符串得到另一个字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1585-check-if-string-is-transformable-with-substring-sort-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1585-check-if-string-is-transformable-with-substring-sort-operations/</guid><description>Hard | String, Greedy, Sorting</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>1605. 根据行和列的和找到有效矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1605-find-valid-matrix-given-row-and-column-sums/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1605-find-valid-matrix-given-row-and-column-sums/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1642. 你能到达的最远建筑</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1642-furthest-building-you-can-reach/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1642-furthest-building-you-can-reach/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1647. 使字符频次唯一的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1647-minimum-deletions-to-make-character-frequencies-unique/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1647-minimum-deletions-to-make-character-frequencies-unique/</guid><description>Medium | Hash Table, String, Greedy, Sorting</description></item><item><title>1648. 销售价值递减的彩球</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1648-sell-diminishing-valued-colored-balls/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1648-sell-diminishing-valued-colored-balls/</guid><description>Medium | Array, Math, Binary Search, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>1663. 具有给定数值的最小字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1663-smallest-string-with-a-given-numeric-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1663-smallest-string-with-a-given-numeric-value/</guid><description>Medium | String, Greedy</description></item><item><title>1665. 完成任务的最少初始能量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1665-minimum-initial-energy-to-finish-tasks/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1665-minimum-initial-energy-to-finish-tasks/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>1671. 使数组成为山形数组的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1671-minimum-number-of-removals-to-make-mountain-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1671-minimum-number-of-removals-to-make-mountain-array/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Greedy</description></item><item><title>1673. 找到最具竞争力的子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1673-find-the-most-competitive-subsequence/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1673-find-the-most-competitive-subsequence/</guid><description>Medium | Array, Stack, Greedy, Monotonic Stack</description></item><item><title>1686. 石子游戏VI</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1686-stone-game-vi/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1686-stone-game-vi/</guid><description>Medium | Array, Math, Greedy, Sorting, Heap (Priority Queue), Game Theory</description></item><item><title>1689. 分割数字的最小数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1689-partitioning-into-minimum-number-of-deci-binary-numbers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1689-partitioning-into-minimum-number-of-deci-binary-numbers/</guid><description>Medium | String, Greedy</description></item><item><title>1702. 变更后的最大二进制字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1702-maximum-binary-string-after-change/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1702-maximum-binary-string-after-change/</guid><description>Medium | String, Greedy</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>1710. 卡车上的最大单元数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1710-maximum-units-on-a-truck/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1710-maximum-units-on-a-truck/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>1713. 使子序列的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1713-minimum-operations-to-make-a-subsequence/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1713-minimum-operations-to-make-a-subsequence/</guid><description>Hard | Array, Hash Table, Binary Search, Greedy</description></item><item><title>1717. 移除子字符串的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1717-maximum-score-from-removing-substrings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1717-maximum-score-from-removing-substrings/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>1733. 教授语言的最少人数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1733-minimum-number-of-people-to-teach/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1733-minimum-number-of-people-to-teach/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>1736. 替换隐藏数字得到最晚时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1736-latest-time-by-replacing-hidden-digits/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1736-latest-time-by-replacing-hidden-digits/</guid><description>Easy | String, Greedy</description></item><item><title>1739. 放置盒子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1739-building-boxes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1739-building-boxes/</guid><description>Hard | Math, Binary Search, Greedy</description></item><item><title>1753. 移除石子的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1753-maximum-score-from-removing-stones/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1753-maximum-score-from-removing-stones/</guid><description>Medium | Math, Greedy, Heap (Priority Queue)</description></item><item><title>1754. 两个字符串的最大合并</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1754-largest-merge-of-two-strings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1754-largest-merge-of-two-strings/</guid><description>Medium | Two Pointers, String, Greedy</description></item><item><title>1764. 通过连接另一个数组的子数组来形成数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1764-form-array-by-concatenating-subarrays-of-another-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1764-form-array-by-concatenating-subarrays-of-another-array/</guid><description>Medium | Array, Two Pointers, Greedy, String Matching</description></item><item><title>1775. 用最少操作次数使两个数组的和相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1775-equal-sum-arrays-with-minimum-number-of-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1775-equal-sum-arrays-with-minimum-number-of-operations/</guid><description>Medium | Array, Hash Table, Greedy, Counting</description></item><item><title>1785. 添加最少元素使数组和等于目标值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1785-minimum-elements-to-add-to-form-a-given-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1785-minimum-elements-to-add-to-form-a-given-sum/</guid><description>Medium | Array, Greedy</description></item><item><title>1798. 能够连续制造的最大值数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1798-maximum-number-of-consecutive-values-you-can-make/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1798-maximum-number-of-consecutive-values-you-can-make/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1802. 有界数组中指定下标处的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1802-maximum-value-at-a-given-index-in-a-bounded-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1802-maximum-value-at-a-given-index-in-a-bounded-array/</guid><description>Medium | Math, Binary Search, Greedy</description></item><item><title>1824. 最少侧跳次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1824-minimum-sideway-jumps/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1824-minimum-sideway-jumps/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>1827. 使数组严格递增的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1827-minimum-operations-to-make-the-array-increasing/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1827-minimum-operations-to-make-the-array-increasing/</guid><description>Easy | Array, Greedy</description></item><item><title>1833. 最大冰淇淋数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1833-maximum-ice-cream-bars/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1833-maximum-ice-cream-bars/</guid><description>Medium | Array, Greedy, Sorting, Counting Sort</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>1846. 递减重排后的最大元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1846-maximum-element-after-decreasing-and-rearranging/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1846-maximum-element-after-decreasing-and-rearranging/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1850. 到达第 K 个最小美妙数的最小相邻交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number/</guid><description>Medium | Two Pointers, String, Greedy</description></item><item><title>1864. 使二进制字符串字符交替的最少交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating/</guid><description>Medium | String, Greedy</description></item><item><title>1877. 最小化数组中的最大对和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1877-minimize-maximum-pair-sum-in-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1877-minimize-maximum-pair-sum-in-array/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>1881. 插入后的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1881-maximum-value-after-insertion/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1881-maximum-value-after-insertion/</guid><description>Medium | String, Greedy</description></item><item><title>1903. 字符串中的最大奇数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1903-largest-odd-number-in-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1903-largest-odd-number-in-string/</guid><description>Easy | Math, String, Greedy</description></item><item><title>1921. 消灭怪物的最大数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1921-eliminate-maximum-number-of-monsters/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1921-eliminate-maximum-number-of-monsters/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1927. 求和博弈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1927-sum-game/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1927-sum-game/</guid><description>Medium | Math, String, Greedy, Game Theory</description></item><item><title>1936. 添加最少的梯子横档</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1936-add-minimum-number-of-rungs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1936-add-minimum-number-of-rungs/</guid><description>Medium | Array, Greedy</description></item><item><title>1946. 变更一个子字符串后的最大数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1946-largest-number-after-mutating-substring/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1946-largest-number-after-mutating-substring/</guid><description>Medium | Array, String, Greedy</description></item><item><title>1953. 可以工作的最大周数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1953-maximum-number-of-weeks-for-which-you-can-work/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1953-maximum-number-of-weeks-for-which-you-can-work/</guid><description>Medium | Array, Greedy</description></item><item><title>1962. 移除石子使总数最小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1962-remove-stones-to-minimize-the-total/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1962-remove-stones-to-minimize-the-total/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1963. 使字符串平衡的最少交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1963-minimum-number-of-swaps-to-make-the-string-balanced/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1963-minimum-number-of-swaps-to-make-the-string-balanced/</guid><description>Medium | Two Pointers, String, Stack, Greedy</description></item><item><title>1968. 数组中不等于相邻元素平均值的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1968-array-with-elements-not-equal-to-average-of-neighbors/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1968-array-with-elements-not-equal-to-average-of-neighbors/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1969. 数组元素的最小非零乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1969-minimum-non-zero-product-of-the-array-elements/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1969-minimum-non-zero-product-of-the-array-elements/</guid><description>Medium | Math, Greedy, Recursion</description></item><item><title>1974. 使用特殊打字机输入单词所需的最少时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1974-minimum-time-to-type-word-using-special-typewriter/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1974-minimum-time-to-type-word-using-special-typewriter/</guid><description>Easy | String, Greedy</description></item><item><title>1975. 最大矩阵和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1975-maximum-matrix-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1975-maximum-matrix-sum/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1996. 游戏中弱角色的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1996-the-number-of-weak-characters-in-the-game/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1996-the-number-of-weak-characters-in-the-game/</guid><description>Medium | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>1005. K 次取反后最大化的数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1005-maximize-sum-of-array-after-k-negations/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1005-maximize-sum-of-array-after-k-negations/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>1007. 行中相等值的最少多米诺旋转</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1007-minimum-domino-rotations-for-equal-row/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1007-minimum-domino-rotations-for-equal-row/</guid><description>Medium | Array, Greedy</description></item><item><title>1013. 将数组分成三个相等和的部分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1013-partition-array-into-three-parts-with-equal-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1013-partition-array-into-three-parts-with-equal-sum/</guid><description>Easy | Array, Greedy</description></item><item><title>1024. 视频拼接</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1024-video-stitching/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1024-video-stitching/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>1029. 两地调度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1029-two-city-scheduling/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1029-two-city-scheduling/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1053. 通过一次交换得到的前一个排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1053-previous-permutation-with-one-swap/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1053-previous-permutation-with-one-swap/</guid><description>Medium | Array, Greedy</description></item><item><title>1054. 遥远的条形码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1054-distant-barcodes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1054-distant-barcodes/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting</description></item><item><title>1081. 不同字符的最小子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1081-smallest-subsequence-of-distinct-characters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1081-smallest-subsequence-of-distinct-characters/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>1090. 从标签中选取最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1090-largest-values-from-labels/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1090-largest-values-from-labels/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Counting</description></item><item><title>1130. 叶值的最小代价生成树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1130-minimum-cost-tree-from-leaf-values/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1130-minimum-cost-tree-from-leaf-values/</guid><description>Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>1144. 减少元素使数组呈锯齿状</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1144-decrease-elements-to-make-array-zigzag/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1144-decrease-elements-to-make-array-zigzag/</guid><description>Medium | Array, Greedy</description></item><item><title>1147. 最长分块回文分解</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1147-longest-chunked-palindrome-decomposition/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1147-longest-chunked-palindrome-decomposition/</guid><description>Hard | Two Pointers, String, Dynamic Programming, Greedy, Rolling Hash, Hash Function</description></item><item><title>1217. 玩筹码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1217-minimum-cost-to-move-chips-to-the-same-position/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1217-minimum-cost-to-move-chips-to-the-same-position/</guid><description>Easy | Array, Math, Greedy</description></item><item><title>1221. 分割平衡字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1221-split-a-string-in-balanced-strings/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1221-split-a-string-in-balanced-strings/</guid><description>Easy | String, Greedy, Counting</description></item><item><title>1247. 使字符串相等的最小交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1247-minimum-swaps-to-make-strings-equal/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1247-minimum-swaps-to-make-strings-equal/</guid><description>Medium | Math, String, Greedy</description></item><item><title>1253. 重构 2 行二进制矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1253-reconstruct-a-2-row-binary-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1253-reconstruct-a-2-row-binary-matrix/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1262. 可被三整除的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1262-greatest-sum-divisible-by-three/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1262-greatest-sum-divisible-by-three/</guid><description>Medium | Array, Dynamic Programming, Greedy, Sorting</description></item><item><title>738. 单调递增的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0738-monotone-increasing-digits/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0738-monotone-increasing-digits/</guid><description>Medium | Math, Greedy</description></item><item><title>757. 设置交集大小至少为二</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0757-set-intersection-size-at-least-two/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0757-set-intersection-size-at-least-two/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>763. 划分字母区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0763-partition-labels/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0763-partition-labels/</guid><description>Medium | Hash Table, Two Pointers, String, Greedy</description></item><item><title>765. 情侣牵手</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0765-couples-holding-hands/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0765-couples-holding-hands/</guid><description>Hard | Greedy, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</description></item><item><title>767. 重构字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0767-reorganize-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0767-reorganize-string/</guid><description>Medium | Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting</description></item><item><title>768. 最多能完成排序的块 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0768-max-chunks-to-make-sorted-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0768-max-chunks-to-make-sorted-ii/</guid><description>Hard | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>769. 最大数量的数据块来排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0769-max-chunks-to-make-sorted/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0769-max-chunks-to-make-sorted/</guid><description>Medium | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>781. 森林中的兔子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0781-rabbits-in-forest/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0781-rabbits-in-forest/</guid><description>Medium | Array, Hash Table, Math, Greedy</description></item><item><title>807. 保持城市天际线的最大高度增加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0807-max-increase-to-keep-city-skyline/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0807-max-increase-to-keep-city-skyline/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>826. 安排工作以达到最大收益</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0826-most-profit-assigning-work/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0826-most-profit-assigning-work/</guid><description>Medium | Array, Two Pointers, Binary Search, Greedy, Sorting</description></item><item><title>846. 同花顺</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0846-hand-of-straights/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0846-hand-of-straights/</guid><description>Medium | Array, Hash Table, Greedy, Sorting</description></item><item><title>857. 雇佣 K 名工人的最低成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0857-minimum-cost-to-hire-k-workers/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0857-minimum-cost-to-hire-k-workers/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>860. 柠檬水找零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0860-lemonade-change/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0860-lemonade-change/</guid><description>Easy | Array, Greedy</description></item><item><title>861. 翻转矩阵后的得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0861-score-after-flipping-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0861-score-after-flipping-matrix/</guid><description>Medium | Array, Greedy, Bit Manipulation, Matrix</description></item><item><title>870. 优势洗牌</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0870-advantage-shuffle/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0870-advantage-shuffle/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>871. 最少加油次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0871-minimum-number-of-refueling-stops/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0871-minimum-number-of-refueling-stops/</guid><description>Hard | Array, Dynamic Programming, Greedy, Heap (Priority Queue)</description></item><item><title>881. 救生艇</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0881-boats-to-save-people/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0881-boats-to-save-people/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>910. 最小差值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0910-smallest-range-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0910-smallest-range-ii/</guid><description>Medium | Array, Math, Greedy, Sorting</description></item><item><title>921. 使括号有效的最少添加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0921-minimum-add-to-make-parentheses-valid/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0921-minimum-add-to-make-parentheses-valid/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>936. 戳印序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0936-stamping-the-sequence/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0936-stamping-the-sequence/</guid><description>Hard | String, Stack, Greedy, Queue</description></item><item><title>942. DI 字符串匹配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0942-di-string-match/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0942-di-string-match/</guid><description>Easy | Array, Two Pointers, String, Greedy</description></item><item><title>945. 使数组唯一的最小增量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0945-minimum-increment-to-make-array-unique/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0945-minimum-increment-to-make-array-unique/</guid><description>Medium | Array, Greedy, Sorting, Counting</description></item><item><title>948. 令牌放置</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0948-bag-of-tokens/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0948-bag-of-tokens/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>954. 二倍数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0954-array-of-doubled-pairs/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0954-array-of-doubled-pairs/</guid><description>Medium | Array, Hash Table, Greedy, Sorting</description></item><item><title>955. 删列造序 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0955-delete-columns-to-make-sorted-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0955-delete-columns-to-make-sorted-ii/</guid><description>Medium | Array, String, Greedy</description></item><item><title>976. 三角形的最大周长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0976-largest-perimeter-triangle/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0976-largest-perimeter-triangle/</guid><description>Easy | Array, Math, Greedy, Sorting</description></item><item><title>984. 不含AAA或BBB的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0984-string-without-aaa-or-bbb/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0984-string-without-aaa-or-bbb/</guid><description>Medium | String, Greedy</description></item><item><title>991. 坏掉的计算器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0991-broken-calculator/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0991-broken-calculator/</guid><description>Medium | Math, Greedy</description></item><item><title>502. IPO</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0502-ipo/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0502-ipo/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>517. 超级洗衣机</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0517-super-washing-machines/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0517-super-washing-machines/</guid><description>Hard | Array, Greedy</description></item><item><title>561. 数组拆分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0561-array-partition/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0561-array-partition/</guid><description>Easy | Array, Greedy, Sorting, Counting Sort</description></item><item><title>581. 最短无序连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0581-shortest-unsorted-continuous-subarray/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0581-shortest-unsorted-continuous-subarray/</guid><description>Medium | Array, Two Pointers, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>605. 种花问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0605-can-place-flowers/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0605-can-place-flowers/</guid><description>Easy | Array, Greedy</description></item><item><title>611. 有效三角形的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0611-valid-triangle-number/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0611-valid-triangle-number/</guid><description>Medium | Array, Two Pointers, Binary Search, Greedy, Sorting</description></item><item><title>621. 任务调度器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0621-task-scheduler/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0621-task-scheduler/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting</description></item><item><title>624. 数组中的最大距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0624-maximum-distance-in-arrays/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0624-maximum-distance-in-arrays/</guid><description>Medium | Array, Greedy</description></item><item><title>630. 课程表 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0630-course-schedule-iii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0630-course-schedule-iii/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>646. 最长数对链</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0646-maximum-length-of-pair-chain/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0646-maximum-length-of-pair-chain/</guid><description>Medium | Array, Dynamic Programming, Greedy, Sorting</description></item><item><title>649. Dota2 参议院</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0649-dota2-senate/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0649-dota2-senate/</guid><description>Medium | String, Greedy, Queue</description></item><item><title>659. 分割数组为连续子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0659-split-array-into-consecutive-subsequences/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0659-split-array-into-consecutive-subsequences/</guid><description>Medium | Array, Hash Table, Greedy, Heap (Priority Queue)</description></item><item><title>670. 最大交换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0670-maximum-swap/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0670-maximum-swap/</guid><description>Medium | Math, Greedy</description></item><item><title>678. 有效的括号字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0678-valid-parenthesis-string/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0678-valid-parenthesis-string/</guid><description>Medium | String, Dynamic Programming, Stack, Greedy</description></item><item><title>680. 验证回文字符串 Ⅱ</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0680-valid-palindrome-ii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0680-valid-palindrome-ii/</guid><description>Easy | Two Pointers, String, Greedy</description></item><item><title>714. 买卖股票的最佳时机含手续费</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0714-best-time-to-buy-and-sell-stock-with-transaction-fee/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0714-best-time-to-buy-and-sell-stock-with-transaction-fee/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>321. 创建最大数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0321-create-maximum-number/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0321-create-maximum-number/</guid><description>Hard | Array, Two Pointers, Stack, Greedy, Monotonic Stack</description></item><item><title>324. 摆动排序 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0324-wiggle-sort-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0324-wiggle-sort-ii/</guid><description>Medium | Array, Divide and Conquer, Greedy, Sorting, Quickselect</description></item><item><title>330. 修补数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0330-patching-array/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0330-patching-array/</guid><description>Hard | Array, Greedy</description></item><item><title>334. 递增的三元子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0334-increasing-triplet-subsequence/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0334-increasing-triplet-subsequence/</guid><description>Medium | Array, Greedy</description></item><item><title>376. 摆动序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0376-wiggle-subsequence/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0376-wiggle-subsequence/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>397. 整数替换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0397-integer-replacement/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0397-integer-replacement/</guid><description>Medium | Dynamic Programming, Greedy, Bit Manipulation, Memoization</description></item><item><title>402. 移除K位数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0402-remove-k-digits/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0402-remove-k-digits/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>409. 最长回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0409-longest-palindrome/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0409-longest-palindrome/</guid><description>Easy | Hash Table, String, Greedy</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>420. 强密码检验器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0420-strong-password-checker/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0420-strong-password-checker/</guid><description>Hard | String, Greedy, Heap (Priority Queue)</description></item><item><title>435. 无重叠区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0435-non-overlapping-intervals/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0435-non-overlapping-intervals/</guid><description>Medium | Array, Dynamic Programming, Greedy, Sorting</description></item><item><title>452. 用最少数量的箭引爆气球</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0452-minimum-number-of-arrows-to-burst-balloons/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0452-minimum-number-of-arrows-to-burst-balloons/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>455. 分发饼干</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0455-assign-cookies/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0455-assign-cookies/</guid><description>Easy | Array, Two Pointers, Greedy, Sorting</description></item><item><title>11. 盛最多水的容器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0011-container-with-most-water/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0011-container-with-most-water/</guid><description>Medium | Array, Two Pointers, Greedy</description></item><item><title>122. 买卖股票的最佳时机 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0122-best-time-to-buy-and-sell-stock-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0122-best-time-to-buy-and-sell-stock-ii/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>134. 加油站</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0134-gas-station/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0134-gas-station/</guid><description>Medium | Array, Greedy</description></item><item><title>135. 分发糖果</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0135-candy/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0135-candy/</guid><description>Hard | Array, Greedy</description></item><item><title>179. 最大数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0179-largest-number/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0179-largest-number/</guid><description>Medium | Array, String, Greedy, Sorting</description></item><item><title>316. 去除重复字母</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0316-remove-duplicate-letters/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0316-remove-duplicate-letters/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>44. 通配符匹配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0044-wildcard-matching/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0044-wildcard-matching/</guid><description>Hard | String, Dynamic Programming, Greedy, Recursion</description></item><item><title>45. 跳跃游戏 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0045-jump-game-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0045-jump-game-ii/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>55. 跳跃游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0055-jump-game/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0055-jump-game/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item></channel></rss>