<?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>Binary Search on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/binary-search/</link><description>Recent content in Binary Search 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/binary-search/index.xml" rel="self" type="application/rss+xml"/><item><title>2286. 分组预订音乐会门票</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2286-booking-concert-tickets-in-groups/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2286-booking-concert-tickets-in-groups/</guid><description>Hard | Binary Search, Design, Binary Indexed Tree, Segment Tree</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>3414. 最大权重非重叠区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3414-maximum-score-of-non-overlapping-intervals/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3414-maximum-score-of-non-overlapping-intervals/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Sorting</description></item><item><title>3585. 在树中找到加权中位数节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3585-find-weighted-median-node-in-tree/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3585-find-weighted-median-node-in-tree/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search</description></item><item><title>1631. 最小体力消耗路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1631-path-with-minimum-effort/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1631-path-with-minimum-effort/</guid><description>Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix</description></item><item><title>1898. 可移除字符的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1898-maximum-number-of-removable-characters/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1898-maximum-number-of-removable-characters/</guid><description>Medium | Array, Two Pointers, String, Binary Search</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>2258. 逃离火灾扩散</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2258-escape-the-spreading-fire/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2258-escape-the-spreading-fire/</guid><description>Hard | Array, Binary Search, Breadth-First Search, Matrix</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>2398. 预算内机器人的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2398-maximum-number-of-robots-within-budget/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2398-maximum-number-of-robots-within-budget/</guid><description>Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>1300. 转变数组后最接近目标值的数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1300-sum-of-mutated-array-closest-to-target/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1300-sum-of-mutated-array-closest-to-target/</guid><description>Medium | Array, Binary Search, Sorting</description></item><item><title>1337. 矩阵中战斗力最弱的 K 行</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1337-the-k-weakest-rows-in-a-matrix/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1337-the-k-weakest-rows-in-a-matrix/</guid><description>Easy | Array, Binary Search, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>1346. 检查N及其两倍数是否存在</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1346-check-if-n-and-its-double-exist/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1346-check-if-n-and-its-double-exist/</guid><description>Easy | Array, Hash Table, Two Pointers, Binary Search, Sorting</description></item><item><title>1439. 找到有序矩阵中第k小的数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/</guid><description>Hard | Array, Binary Search, Heap (Priority Queue), Matrix</description></item><item><title>1482. 制作 m 束花所需的最少天数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1482-minimum-number-of-days-to-make-m-bouquets/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1482-minimum-number-of-days-to-make-m-bouquets/</guid><description>Medium | Array, Binary Search</description></item><item><title>1483. 树节点的第K个祖先</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1483-kth-ancestor-of-a-tree-node/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1483-kth-ancestor-of-a-tree-node/</guid><description>Hard | Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Design</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>2779. 应用操作后数组的最大美丽值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2779-maximum-beauty-of-an-array-after-applying-operation/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2779-maximum-beauty-of-an-array-after-applying-operation/</guid><description>Medium | Array, Binary Search, Sliding Window, Sorting</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>354. 俄罗斯套娃信封问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0354-russian-doll-envelopes/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0354-russian-doll-envelopes/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Sorting</description></item><item><title>363. 矩形区域不超过 K 的最大数值和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</guid><description>Hard | Array, Binary Search, Matrix, Prefix Sum, Ordered Set</description></item><item><title>483. 最小好进制</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0483-smallest-good-base/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0483-smallest-good-base/</guid><description>Hard | Math, Binary Search</description></item><item><title>718. 最长重复子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0718-maximum-length-of-repeated-subarray/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0718-maximum-length-of-repeated-subarray/</guid><description>Medium | Array, Binary Search, Dynamic Programming, Sliding Window, Rolling Hash, Hash Function</description></item><item><title>792. 匹配子序列的单词数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0792-number-of-matching-subsequences/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0792-number-of-matching-subsequences/</guid><description>Medium | Array, Hash Table, String, Binary Search, Dynamic Programming, Trie, Sorting</description></item><item><title>3209. 按位与值为 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3209-number-of-subarrays-with-and-value-of-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3209-number-of-subarrays-with-and-value-of-k/</guid><description>Hard | Array, Binary Search, Bit Manipulation, Segment Tree</description></item><item><title>3261. 计算满足 K 约束的子字符串数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3261-count-substrings-that-satisfy-k-constraint-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3261-count-substrings-that-satisfy-k-constraint-ii/</guid><description>Hard | Array, String, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>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>3288. 最长递增路径的长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3288-length-of-the-longest-increasing-path/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3288-length-of-the-longest-increasing-path/</guid><description>Hard | Array, Binary Search, Sorting</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>3312. 排序的最大公约数对查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3312-sorted-gcd-pair-queries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3312-sorted-gcd-pair-queries/</guid><description>Hard | Array, Hash Table, Math, Binary Search, Combinatorics, Counting, Number Theory, Prefix Sum</description></item><item><title>3346. 执行操作后的最大元素频率 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3346-maximum-frequency-of-an-element-after-performing-operations-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3346-maximum-frequency-of-an-element-after-performing-operations-i/</guid><description>Medium | Array, Binary Search, Sliding Window, Sorting, Prefix Sum</description></item><item><title>3347. 执行操作后元素的最大频率 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3347-maximum-frequency-of-an-element-after-performing-operations-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3347-maximum-frequency-of-an-element-after-performing-operations-ii/</guid><description>Hard | Array, Binary Search, Sliding Window, Sorting, Prefix Sum</description></item><item><title>3350. 相邻递增子数组检测 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3350-adjacent-increasing-subarrays-detection-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3350-adjacent-increasing-subarrays-detection-ii/</guid><description>Medium | Array, Binary Search</description></item><item><title>3356. 零数组变换 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3356-zero-array-transformation-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3356-zero-array-transformation-ii/</guid><description>Medium | Array, Two Pointers, Binary Search, Prefix Sum</description></item><item><title>3398. 相同字符的最小子串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3398-smallest-substring-with-identical-characters-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3398-smallest-substring-with-identical-characters-i/</guid><description>Hard | Array, Binary Search, Enumeration</description></item><item><title>3399. 相同字符的最小子字符串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3399-smallest-substring-with-identical-characters-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3399-smallest-substring-with-identical-characters-ii/</guid><description>Hard | String, Binary Search</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>3419. 最小化图的最大边权重</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3419-minimize-the-maximum-edge-weight-of-graph/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3419-minimize-the-maximum-edge-weight-of-graph/</guid><description>Medium | Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Path</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>3453. 分离正方形 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3453-separate-squares-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3453-separate-squares-i/</guid><description>Medium | Array, Binary Search</description></item><item><title>3454. 分割正方形 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3454-separate-squares-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3454-separate-squares-ii/</guid><description>Hard | Array, Binary Search, Segment Tree, Sweep Line</description></item><item><title>3455. 最短匹配子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3455-shortest-matching-substring/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3455-shortest-matching-substring/</guid><description>Hard | Two Pointers, String, Binary Search, String Matching</description></item><item><title>3464. 最大化正方形上点的距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3464-maximize-the-distance-between-points-on-a-square/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3464-maximize-the-distance-between-points-on-a-square/</guid><description>Hard | Array, Math, Binary Search, Geometry, Sorting</description></item><item><title>3477. 水果装篮 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3477-fruits-into-baskets-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3477-fruits-into-baskets-ii/</guid><description>Easy | Array, Binary Search, Segment Tree, Simulation, Ordered Set</description></item><item><title>3479. 水果装篮 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3479-fruits-into-baskets-iii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3479-fruits-into-baskets-iii/</guid><description>Medium | Array, Binary Search, Segment Tree, Ordered Set</description></item><item><title>3488. 最近相等元素查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3488-closest-equal-element-queries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3488-closest-equal-element-queries/</guid><description>Medium | Array, Hash Table, Binary Search</description></item><item><title>3501. 通过交换II最大化活跃区段</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3501-maximize-active-section-with-trade-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3501-maximize-active-section-with-trade-ii/</guid><description>Hard | Array, String, Binary Search, Segment Tree</description></item><item><title>3508. 实现路由器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3508-implement-router/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3508-implement-router/</guid><description>Medium | Array, Hash Table, Binary Search, Design, Queue, Ordered Set</description></item><item><title>3532. 图中路径存在性查询 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3532-path-existence-queries-in-a-graph-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3532-path-existence-queries-in-a-graph-i/</guid><description>Medium | Array, Hash Table, Binary Search, Union-Find, Graph Theory</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>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>3608. K个连通分量的最小时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3608-minimum-time-for-k-connected-components/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3608-minimum-time-for-k-connected-components/</guid><description>Medium | Binary Search, Union-Find, Graph Theory, Sorting</description></item><item><title>3613. 最小化最大组件成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3613-minimize-maximum-component-cost/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3613-minimize-maximum-component-cost/</guid><description>Medium | Binary Search, Union-Find, Graph Theory, Sorting</description></item><item><title>3620. 网络恢复路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3620-network-recovery-pathways/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3620-network-recovery-pathways/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path</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>3634. 平衡数组的最少移除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3634-minimum-removals-to-balance-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3634-minimum-removals-to-balance-array/</guid><description>Medium | Array, Binary Search, Sliding Window, 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>3636. 阈值多数查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3636-threshold-majority-queries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3636-threshold-majority-queries/</guid><description>Hard | Array, Hash Table, Binary Search, Divide and Conquer, Counting, Prefix Sum</description></item><item><title>3639. 激活字符串的最小时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3639-minimum-time-to-activate-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3639-minimum-time-to-activate-string/</guid><description>Medium | Array, Binary Search</description></item><item><title>3661. 机器人摧毁墙的最大数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3661-maximum-walls-destroyed-by-robots/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3661-maximum-walls-destroyed-by-robots/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Sorting</description></item><item><title>3709. 设计考试成绩追踪器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3709-design-exam-scores-tracker/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3709-design-exam-scores-tracker/</guid><description>Medium | Array, Binary Search, Design, Prefix Sum</description></item><item><title>3710. 最大分割因子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3710-maximum-partition-factor/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3710-maximum-partition-factor/</guid><description>Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</description></item><item><title>3722. 翻转后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3722-lexicographically-smallest-string-after-reverse/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3722-lexicographically-smallest-string-after-reverse/</guid><description>Medium | Two Pointers, Binary Search, Enumeration</description></item><item><title>3733. 完成所有配送的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3733-minimum-time-to-complete-all-deliveries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3733-minimum-time-to-complete-all-deliveries/</guid><description>Medium | Math, Binary Search</description></item><item><title>3748. 统计稳定子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3748-count-stable-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3748-count-stable-subarrays/</guid><description>Hard | Array, Binary Search, Prefix Sum</description></item><item><title>3759. 统计至少有 K 个更大值的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3759-count-elements-with-at-least-k-greater-values/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3759-count-elements-with-at-least-k-greater-values/</guid><description>Medium | Array, Binary Search, Divide and Conquer, Sorting, Quickselect</description></item><item><title>3762. 使子数组相等的最小操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3762-minimum-operations-to-equalize-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3762-minimum-operations-to-equalize-subarrays/</guid><description>Hard | Array, Math, Binary Search, Segment Tree</description></item><item><title>3766. 将数组转换为二进制回文数的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3766-minimum-operations-to-make-binary-palindrome/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3766-minimum-operations-to-make-binary-palindrome/</guid><description>Medium | Array, Two Pointers, Binary Search, Bit Manipulation</description></item><item><title>3771. 地牢运行的总分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3771-total-score-of-dungeon-runs/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3771-total-score-of-dungeon-runs/</guid><description>Medium | Array, Binary Search, Prefix Sum</description></item><item><title>3801. 合并已排序列表的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3801-minimum-cost-to-merge-sorted-lists/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3801-minimum-cost-to-merge-sorted-lists/</guid><description>Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation</description></item><item><title>3814. 在预算内的最大容量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3814-maximum-capacity-within-budget/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3814-maximum-capacity-within-budget/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>3824. 在限制内将数组减少到最小 K</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3824-minimum-k-to-reduce-array-within-limit/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3824-minimum-k-to-reduce-array-within-limit/</guid><description>Medium | Array, Binary Search</description></item><item><title>3825. 最长严格递增且按位与非零的子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3825-longest-strictly-increasing-subsequence-with-non-zero-bitwise-and/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3825-longest-strictly-increasing-subsequence-with-non-zero-bitwise-and/</guid><description>Medium | Array, Binary Search, Bit Manipulation, Enumeration</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>2968. 最大化频率分数的操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2968-apply-operations-to-maximize-frequency-score/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2968-apply-operations-to-maximize-frequency-score/</guid><description>Hard | Array, Binary Search, Sliding Window, Sorting, Prefix Sum</description></item><item><title>2970. 计算可移除递增子数组的数目 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2970-count-the-number-of-incremovable-subarrays-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2970-count-the-number-of-incremovable-subarrays-i/</guid><description>Easy | Array, Two Pointers, Binary Search, Enumeration</description></item><item><title>2972. 计算可移除子数组的数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2972-count-the-number-of-incremovable-subarrays-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2972-count-the-number-of-incremovable-subarrays-ii/</guid><description>Hard | Array, Two Pointers, Binary Search</description></item><item><title>2981. 找出至少出现三次的最长特殊子字符串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2981-find-longest-special-substring-that-occurs-thrice-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2981-find-longest-special-substring-that-occurs-thrice-i/</guid><description>Medium | Hash Table, String, Binary Search, Sliding Window, Counting</description></item><item><title>2982. 找出出现至少三次的最长特殊子字符串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2982-find-longest-special-substring-that-occurs-thrice-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2982-find-longest-special-substring-that-occurs-thrice-ii/</guid><description>Medium | Hash Table, String, Binary Search, Sliding Window, Counting</description></item><item><title>3006. 在给定数组中找到美丽索引 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3006-find-beautiful-indices-in-the-given-array-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3006-find-beautiful-indices-in-the-given-array-i/</guid><description>Medium | Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function</description></item><item><title>3007. 最大数字，其价格总和小于等于 K</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/</guid><description>Medium | Math, Binary Search, Dynamic Programming, Bit Manipulation</description></item><item><title>3008. 在给定数组中查找美丽索引 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3008-find-beautiful-indices-in-the-given-array-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3008-find-beautiful-indices-in-the-given-array-ii/</guid><description>Hard | Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function</description></item><item><title>3048. 标记索引的最早秒数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3048-earliest-second-to-mark-indices-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3048-earliest-second-to-mark-indices-i/</guid><description>Medium | Array, Binary Search</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>3113. 找到边界元素是最大值的子数组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum/</guid><description>Hard | Array, Binary Search, Stack, Monotonic Stack</description></item><item><title>3116. 单一面额组合的第K小金额</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3116-kth-smallest-amount-with-single-denomination-combination/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3116-kth-smallest-amount-with-single-denomination-combination/</guid><description>Hard | Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theory</description></item><item><title>3117. 通过划分数组的最小值和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queue</description></item><item><title>3134. 找到唯一性数组的中位数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3134-find-the-median-of-the-uniqueness-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3134-find-the-median-of-the-uniqueness-array/</guid><description>Hard | Array, Hash Table, Binary Search, Sliding Window</description></item><item><title>3143. 正方形内的最大点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3143-maximum-points-inside-the-square/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3143-maximum-points-inside-the-square/</guid><description>Medium | Array, Hash Table, String, Binary Search, Sorting</description></item><item><title>3145. 寻找大数组元素的乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3145-find-products-of-elements-of-big-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3145-find-products-of-elements-of-big-array/</guid><description>Hard | Array, Binary Search, Bit Manipulation</description></item><item><title>3152. 特殊数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3152-special-array-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3152-special-array-ii/</guid><description>Medium | Array, Binary Search, Prefix Sum</description></item><item><title>3161. 区块放置查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3161-block-placement-queries/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3161-block-placement-queries/</guid><description>Hard | Array, Binary Search, Binary Indexed Tree, Segment Tree</description></item><item><title>3171. 找到按位或最接近 K 的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3171-find-subarray-with-bitwise-or-closest-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3171-find-subarray-with-bitwise-or-closest-to-k/</guid><description>Hard | Array, Binary Search, Bit Manipulation, Segment Tree</description></item><item><title>3186. 施法造成的最大总伤害</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3186-maximum-total-damage-with-spell-casting/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3186-maximum-total-damage-with-spell-casting/</guid><description>Medium | Array, Hash Table, Two Pointers, Binary Search, Dynamic Programming, Sorting, Counting</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>2713. 矩阵中严格递增路径的最大长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2713-maximum-strictly-increasing-cells-in-a-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2713-maximum-strictly-increasing-cells-in-a-matrix/</guid><description>Hard | Array, Hash Table, Binary Search, Dynamic Programming, Memoization, Sorting, Matrix, Ordered Set</description></item><item><title>2736. 最大和查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/</guid><description>Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Sorting, Monotonic Stack</description></item><item><title>2812. 在网格中找到最安全路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2812-find-the-safest-path-in-a-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2812-find-the-safest-path-in-a-grid/</guid><description>Medium | Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix</description></item><item><title>2817. 具有约束的元素间最小绝对差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2817-minimum-absolute-difference-between-elements-with-constraint/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2817-minimum-absolute-difference-between-elements-with-constraint/</guid><description>Medium | Array, Binary Search, Ordered Set</description></item><item><title>2824. 统计小于目标值的数对数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2824-count-pairs-whose-sum-is-less-than-target/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2824-count-pairs-whose-sum-is-less-than-target/</guid><description>Easy | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>2826. 三组排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2826-sorting-three-groups/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2826-sorting-three-groups/</guid><description>Medium | Array, Binary Search, Dynamic Programming</description></item><item><title>2830. 销售员最大利润</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2830-maximize-the-profit-as-the-salesman/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2830-maximize-the-profit-as-the-salesman/</guid><description>Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sorting</description></item><item><title>2831. 找到最长相等子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2831-find-the-longest-equal-subarray/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2831-find-the-longest-equal-subarray/</guid><description>Medium | Array, Hash Table, Binary Search, Sliding Window</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>2861. 最大合金数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2861-maximum-number-of-alloys/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2861-maximum-number-of-alloys/</guid><description>Medium | Array, Binary Search</description></item><item><title>2926. 最大平衡子序列和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2926-maximum-balanced-subsequence-sum/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2926-maximum-balanced-subsequence-sum/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Binary Indexed Tree, Segment Tree</description></item><item><title>2940. 找到爱丽丝和鲍勃可以相遇的建筑</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/</guid><description>Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack</description></item><item><title>2945. 寻找最大非递减数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2945-find-maximum-non-decreasing-array-length/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2945-find-maximum-non-decreasing-array-length/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Stack, Queue, Monotonic Stack, Prefix Sum, Monotonic Queue</description></item><item><title>2008. 出租车的最大盈利</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2008-maximum-earnings-from-taxi/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2008-maximum-earnings-from-taxi/</guid><description>Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sorting</description></item><item><title>2009. 使数组连续的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2009-minimum-number-of-operations-to-make-array-continuous/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2009-minimum-number-of-operations-to-make-array-continuous/</guid><description>Hard | Array, Hash Table, Binary Search, Sliding Window</description></item><item><title>2024. 最大化考试的困惑度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2024-maximize-the-confusion-of-an-exam/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2024-maximize-the-confusion-of-an-exam/</guid><description>Medium | String, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>2035. 将数组分割成两个数组以最小化和差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2035-partition-array-into-two-arrays-to-minimize-sum-difference/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2035-partition-array-into-two-arrays-to-minimize-sum-difference/</guid><description>Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Sorting, Ordered Set, Bitmask</description></item><item><title>2040. 两个有序数组的第 K 小乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2040-kth-smallest-product-of-two-sorted-arrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2040-kth-smallest-product-of-two-sorted-arrays/</guid><description>Hard | Array, Binary Search</description></item><item><title>2054. 两个最佳非重叠事件</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2054-two-best-non-overlapping-events/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2054-two-best-non-overlapping-events/</guid><description>Medium | Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue)</description></item><item><title>2055. 蜡烛之间的盘子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2055-plates-between-candles/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2055-plates-between-candles/</guid><description>Medium | Array, String, Binary Search, Prefix Sum</description></item><item><title>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>2070. 每个查询的最美丽物品</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2070-most-beautiful-item-for-each-query/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2070-most-beautiful-item-for-each-query/</guid><description>Medium | Array, Binary Search, Sorting</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>2080. 区间频率查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2080-range-frequency-queries/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2080-range-frequency-queries/</guid><description>Medium | Array, Hash Table, Binary Search, Design, Segment Tree</description></item><item><title>2089. 排序数组后查找目标索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2089-find-target-indices-after-sorting-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2089-find-target-indices-after-sorting-array/</guid><description>Easy | Array, Binary Search, Sorting</description></item><item><title>2106. 在至多 K 步后收集的最大水果数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2106-maximum-fruits-harvested-after-at-most-k-steps/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2106-maximum-fruits-harvested-after-at-most-k-steps/</guid><description>Hard | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>2111. 使数组 K 递增的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2111-minimum-operations-to-make-the-array-k-increasing/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2111-minimum-operations-to-make-the-array-k-increasing/</guid><description>Hard | Array, Binary Search</description></item><item><title>2179. 统计数组中的好三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>2187. 完成旅途的最少时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2187-minimum-time-to-complete-trips/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2187-minimum-time-to-complete-trips/</guid><description>Medium | Array, Binary Search</description></item><item><title>2223. 构建字符串的分数和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2223-sum-of-scores-of-built-strings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2223-sum-of-scores-of-built-strings/</guid><description>Hard | String, Binary Search, Rolling Hash, Suffix Array, String Matching, Hash Function</description></item><item><title>2226. 分配给 K 个孩子的最大糖果数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2226-maximum-candies-allocated-to-k-children/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2226-maximum-candies-allocated-to-k-children/</guid><description>Medium | Array, Binary Search</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>2250. 统计包含每个点的矩形数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2250-count-number-of-rectangles-containing-each-point/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2250-count-number-of-rectangles-containing-each-point/</guid><description>Medium | Array, Hash Table, Binary Search, Binary Indexed Tree, Sorting</description></item><item><title>2251. 盛开花朵的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2251-number-of-flowers-in-full-bloom/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2251-number-of-flowers-in-full-bloom/</guid><description>Hard | Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set</description></item><item><title>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>2300. 咒语和药水的成功对数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2300-successful-pairs-of-spells-and-potions/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2300-successful-pairs-of-spells-and-potions/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>2302. 得分小于 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2302-count-subarrays-with-score-less-than-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2302-count-subarrays-with-score-less-than-k/</guid><description>Hard | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>2332. 赶上公交车的最晚时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2332-the-latest-time-to-catch-a-bus/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2332-the-latest-time-to-catch-a-bus/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>2354. 优秀数对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2354-number-of-excellent-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2354-number-of-excellent-pairs/</guid><description>Hard | Array, Hash Table, Binary Search, Bit Manipulation</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>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>2411. 具有最大按位或的最小子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2411-smallest-subarrays-with-maximum-bitwise-or/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2411-smallest-subarrays-with-maximum-bitwise-or/</guid><description>Medium | Array, Binary Search, Bit Manipulation, Sliding Window</description></item><item><title>2424. 最长上传前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/</guid><description>Medium | Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Set</description></item><item><title>2426. 满足不等式的数对数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</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>2454. 第二个更大元素 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2454-next-greater-element-iv/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2454-next-greater-element-iv/</guid><description>Hard | Array, Binary Search, Stack, Sorting, Heap (Priority Queue), Monotonic Stack</description></item><item><title>2476. 二叉搜索树中的最近节点查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2476-closest-nodes-queries-in-a-binary-search-tree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2476-closest-nodes-queries-in-a-binary-search-tree/</guid><description>Medium | Array, Binary Search, Tree, Depth-First Search, Binary Search Tree, Binary Tree</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>2501. 数组中最长的平方连续子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2501-longest-square-streak-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2501-longest-square-streak-in-an-array/</guid><description>Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sorting</description></item><item><title>2513. 最小化两个数组的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2513-minimize-the-maximum-of-two-arrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2513-minimize-the-maximum-of-two-arrays/</guid><description>Medium | Math, Binary Search, Number Theory</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>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>2529. 正整数和负整数的最大计数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2529-maximum-count-of-positive-integer-and-negative-integer/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2529-maximum-count-of-positive-integer-and-negative-integer/</guid><description>Easy | Array, Binary Search, Counting</description></item><item><title>2540. 最小公共值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2540-minimum-common-value/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2540-minimum-common-value/</guid><description>Easy | Array, Hash Table, Two Pointers, Binary Search</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>2555. 从两个线段中获得最大收益</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2555-maximize-win-from-two-segments/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2555-maximize-win-from-two-segments/</guid><description>Medium | Array, Binary Search, Sliding Window</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>2563. 统计公平数对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2563-count-the-number-of-fair-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2563-count-the-number-of-fair-pairs/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>2565. 最小分数子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2565-subsequence-with-the-minimum-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2565-subsequence-with-the-minimum-score/</guid><description>Hard | Two Pointers, String, Binary Search</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>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>2594. 修车的最少时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2594-minimum-time-to-repair-cars/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2594-minimum-time-to-repair-cars/</guid><description>Medium | Array, Binary Search</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>2602. 使数组中所有元素相等的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2602-minimum-operations-to-make-all-array-elements-equal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2602-minimum-operations-to-make-all-array-elements-equal/</guid><description>Medium | Array, Binary Search, Sorting, Prefix Sum</description></item><item><title>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>1283. 找到给定阈值的最小除数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1283-find-the-smallest-divisor-given-a-threshold/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1283-find-the-smallest-divisor-given-a-threshold/</guid><description>Medium | Array, Binary Search</description></item><item><title>1292. 元素和小于等于阈值的正方形的最大边长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/</guid><description>Medium | Array, Binary Search, Matrix, Prefix Sum</description></item><item><title>1348. 推文计数器（按频率统计）</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1348-tweet-counts-per-frequency/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1348-tweet-counts-per-frequency/</guid><description>Medium | Hash Table, String, Binary Search, Design, Sorting, Ordered Set</description></item><item><title>1351. 统计有序矩阵中的负数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1351-count-negative-numbers-in-a-sorted-matrix/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1351-count-negative-numbers-in-a-sorted-matrix/</guid><description>Easy | Array, Binary Search, Matrix</description></item><item><title>1385. 寻找两个数组间的距离值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1385-find-the-distance-value-between-two-arrays/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1385-find-the-distance-value-between-two-arrays/</guid><description>Easy | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>1477. 找两个和为目标值且不重叠的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/</guid><description>Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sliding Window</description></item><item><title>1498. 满足给定和条件的子序列数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1498-number-of-subsequences-that-satisfy-the-given-sum-condition/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1498-number-of-subsequences-that-satisfy-the-given-sum-condition/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>1508. 排序子数组和的范围求和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1508-range-sum-of-sorted-subarray-sums/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1508-range-sum-of-sorted-subarray-sums/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting, Prefix Sum</description></item><item><title>1521. 找到最接近目标值的函数值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1521-find-a-value-of-a-mysterious-function-closest-to-target/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1521-find-a-value-of-a-mysterious-function-closest-to-target/</guid><description>Hard | Array, Binary Search, Bit Manipulation, Segment Tree</description></item><item><title>1539. 第 K 个缺失的正整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1539-kth-missing-positive-number/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1539-kth-missing-positive-number/</guid><description>Easy | Array, Binary Search</description></item><item><title>1552. 两球之间的磁力</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1552-magnetic-force-between-two-balls/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1552-magnetic-force-between-two-balls/</guid><description>Medium | Array, Binary Search, Sorting</description></item><item><title>1562. 找到大小为 M 的最新分组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1562-find-latest-group-of-size-m/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1562-find-latest-group-of-size-m/</guid><description>Medium | Array, Hash Table, Binary Search, Simulation</description></item><item><title>1574. 删除最短子数组使剩余数组有序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1574-shortest-subarray-to-be-removed-to-make-array-sorted/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1574-shortest-subarray-to-be-removed-to-make-array-sorted/</guid><description>Medium | Array, Two Pointers, Binary Search, Stack, Monotonic Stack</description></item><item><title>1608. 特殊数组的特征值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1608-special-array-with-x-elements-greater-than-or-equal-x/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1608-special-array-with-x-elements-greater-than-or-equal-x/</guid><description>Easy | Array, Binary Search, 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>1649. 通过指令创建有序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>1658. 使 X 减到 0 的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1658-minimum-operations-to-reduce-x-to-zero/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1658-minimum-operations-to-reduce-x-to-zero/</guid><description>Medium | Array, Hash Table, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>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>1712. 将数组分割成三个子数组的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1712-ways-to-split-array-into-three-subarrays/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1712-ways-to-split-array-into-three-subarrays/</guid><description>Medium | Array, Two Pointers, Binary Search, Prefix Sum</description></item><item><title>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>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>1751. 可参加的最大活动数目 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1751-maximum-number-of-events-that-can-be-attended-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1751-maximum-number-of-events-that-can-be-attended-ii/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Sorting</description></item><item><title>1760. 袋子里球数量的最小值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1760-minimum-limit-of-balls-in-a-bag/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1760-minimum-limit-of-balls-in-a-bag/</guid><description>Medium | Array, Binary Search</description></item><item><title>1782. 统计点对的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1782-count-pairs-of-nodes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1782-count-pairs-of-nodes/</guid><description>Hard | Array, Hash Table, Two Pointers, Binary Search, Graph Theory, Sorting, Counting</description></item><item><title>1793. 好子数组的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1793-maximum-score-of-a-good-subarray/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1793-maximum-score-of-a-good-subarray/</guid><description>Hard | Array, Two Pointers, Binary Search, Stack, Monotonic Stack</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>1818. 最小绝对和差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1818-minimum-absolute-sum-difference/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1818-minimum-absolute-sum-difference/</guid><description>Medium | Array, Binary Search, Sorting, Ordered Set</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>1847. 最近的房间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1847-closest-room/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1847-closest-room/</guid><description>Hard | Array, Binary Search, Sorting, Ordered Set</description></item><item><title>1851. 包含每个查询的最小区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1851-minimum-interval-to-include-each-query/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1851-minimum-interval-to-include-each-query/</guid><description>Hard | Array, Binary Search, Sweep Line, Sorting, Heap (Priority Queue)</description></item><item><title>1855. 数值对的最大距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1855-maximum-distance-between-a-pair-of-values/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1855-maximum-distance-between-a-pair-of-values/</guid><description>Medium | Array, Two Pointers, Binary Search</description></item><item><title>1862. 向下取整数对和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1862-sum-of-floored-pairs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1862-sum-of-floored-pairs/</guid><description>Hard | Array, Math, Binary Search, Counting, Enumeration, Prefix Sum</description></item><item><title>1870. 按时到达的最小速度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1870-minimum-speed-to-arrive-on-time/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1870-minimum-speed-to-arrive-on-time/</guid><description>Medium | Array, Binary Search</description></item><item><title>1889. 包装过程中的最小浪费空间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1889-minimum-space-wasted-from-packaging/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1889-minimum-space-wasted-from-packaging/</guid><description>Hard | Array, Binary Search, Sorting, Prefix Sum</description></item><item><title>1894. 找到需要补充粉笔的学生</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1894-find-the-student-that-will-replace-the-chalk/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1894-find-the-student-that-will-replace-the-chalk/</guid><description>Medium | Array, Binary Search, Simulation, Prefix Sum</description></item><item><title>1901. 寻找二维数组中的峰值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1901-find-a-peak-element-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1901-find-a-peak-element-ii/</guid><description>Medium | Array, Binary Search, Matrix</description></item><item><title>1923. 最长公共子路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1923-longest-common-subpath/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1923-longest-common-subpath/</guid><description>Hard | Array, Binary Search, Rolling Hash, Suffix Array, Hash Function</description></item><item><title>1954. 收集足够苹果的最小花园周长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1954-minimum-garden-perimeter-to-collect-enough-apples/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1954-minimum-garden-perimeter-to-collect-enough-apples/</guid><description>Medium | Math, Binary Search</description></item><item><title>1964. 找出每个位置上最长的有效障碍赛跑路线</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1964-find-the-longest-valid-obstacle-course-at-each-position/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1964-find-the-longest-valid-obstacle-course-at-each-position/</guid><description>Hard | Array, Binary Search, Binary Indexed Tree</description></item><item><title>1970. 最后一天还能穿越的日子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1970-last-day-where-you-can-still-cross/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1970-last-day-where-you-can-still-cross/</guid><description>Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1004. 最大连续1的个数 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1004-max-consecutive-ones-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1004-max-consecutive-ones-iii/</guid><description>Medium | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>1011. 在 D 天内送达包裹的能力</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1011-capacity-to-ship-packages-within-d-days/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1011-capacity-to-ship-packages-within-d-days/</guid><description>Medium | Array, Binary Search</description></item><item><title>1027. 最长等差数列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1027-longest-arithmetic-subsequence/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1027-longest-arithmetic-subsequence/</guid><description>Medium | Array, Hash Table, Binary Search, Dynamic Programming</description></item><item><title>1044. 最长重复子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1044-longest-duplicate-substring/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1044-longest-duplicate-substring/</guid><description>Hard | String, Binary Search, Sliding Window, Rolling Hash, Suffix Array, Hash Function</description></item><item><title>1095. 山脉数组中查找目标值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1095-find-in-mountain-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1095-find-in-mountain-array/</guid><description>Hard | Array, Binary Search, Interactive</description></item><item><title>1146. 快照数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1146-snapshot-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1146-snapshot-array/</guid><description>Medium | Array, Hash Table, Binary Search, Design</description></item><item><title>1157. 子数组中的在线多数元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1157-online-majority-element-in-subarray/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1157-online-majority-element-in-subarray/</guid><description>Hard | Array, Binary Search, Design, Binary Indexed Tree, Segment Tree</description></item><item><title>1170. 根据字符串最小字符的频率比较字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1170-compare-strings-by-frequency-of-the-smallest-character/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1170-compare-strings-by-frequency-of-the-smallest-character/</guid><description>Medium | Array, Hash Table, String, Binary Search, Sorting</description></item><item><title>1187. 使数组严格递增</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1187-make-array-strictly-increasing/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1187-make-array-strictly-increasing/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Sorting</description></item><item><title>1201. 丑数 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1201-ugly-number-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1201-ugly-number-iii/</guid><description>Medium | Math, Binary Search, Combinatorics, Number Theory</description></item><item><title>1208. 预算内的相等子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1208-get-equal-substrings-within-budget/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1208-get-equal-substrings-within-budget/</guid><description>Medium | String, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>1235. 工作调度的最大利润</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1235-maximum-profit-in-job-scheduling/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1235-maximum-profit-in-job-scheduling/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Sorting</description></item><item><title>1237. 寻找正整数解的函数方程</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1237-find-positive-integer-solution-for-a-given-equation/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1237-find-positive-integer-solution-for-a-given-equation/</guid><description>Medium | Math, Two Pointers, Binary Search, Interactive</description></item><item><title>1268. 搜索推荐系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1268-search-suggestions-system/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1268-search-suggestions-system/</guid><description>Medium | Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)</description></item><item><title>729. 我的日程安排表 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0729-my-calendar-i/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0729-my-calendar-i/</guid><description>Medium | Array, Binary Search, Design, Segment Tree, Ordered Set</description></item><item><title>731. 我的日程安排表 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0731-my-calendar-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0731-my-calendar-ii/</guid><description>Medium | Array, Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set</description></item><item><title>732. 我的日程安排表 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/</guid><description>Hard | Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set</description></item><item><title>744. 寻找比目标字母大的最小字母</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0744-find-smallest-letter-greater-than-target/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0744-find-smallest-letter-greater-than-target/</guid><description>Easy | Array, Binary Search</description></item><item><title>754. 到达数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0754-reach-a-number/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0754-reach-a-number/</guid><description>Medium | Math, Binary Search</description></item><item><title>778. 水位上升的泳池中游泳</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0778-swim-in-rising-water/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0778-swim-in-rising-water/</guid><description>Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix</description></item><item><title>786. 第K小的质数分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0786-k-th-smallest-prime-fraction/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0786-k-th-smallest-prime-fraction/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting, Heap (Priority Queue)</description></item><item><title>793. 阶乘函数后缀零的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0793-preimage-size-of-factorial-zeroes-function/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0793-preimage-size-of-factorial-zeroes-function/</guid><description>Hard | Math, Binary Search</description></item><item><title>825. 适龄的朋友</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0825-friends-of-appropriate-ages/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0825-friends-of-appropriate-ages/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting</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>852. 山脉数组的峰顶索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0852-peak-index-in-a-mountain-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0852-peak-index-in-a-mountain-array/</guid><description>Medium | Array, Binary Search</description></item><item><title>862. 和至少为 K 的最短子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0862-shortest-subarray-with-sum-at-least-k/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0862-shortest-subarray-with-sum-at-least-k/</guid><description>Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>875. 珂珂吃香蕉</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0875-koko-eating-bananas/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0875-koko-eating-bananas/</guid><description>Medium | Array, Binary Search</description></item><item><title>878. 第N个神奇数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0878-nth-magical-number/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0878-nth-magical-number/</guid><description>Hard | Math, Binary Search</description></item><item><title>887. 鸡蛋掉落</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0887-super-egg-drop/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0887-super-egg-drop/</guid><description>Hard | Math, Binary Search, Dynamic Programming</description></item><item><title>888. 公平的糖果棒交换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0888-fair-candy-swap/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0888-fair-candy-swap/</guid><description>Easy | Array, Hash Table, Binary Search, Sorting</description></item><item><title>902. 最多为 N 的数字组合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0902-numbers-at-most-n-given-digit-set/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0902-numbers-at-most-n-given-digit-set/</guid><description>Hard | Array, Math, String, Binary Search, Dynamic Programming</description></item><item><title>911. 在线选举</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0911-online-election/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0911-online-election/</guid><description>Medium | Array, Hash Table, Binary Search, Design</description></item><item><title>981. 基于时间的键值存储</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0981-time-based-key-value-store/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0981-time-based-key-value-store/</guid><description>Medium | Hash Table, String, Binary Search, Design</description></item><item><title>493. 翻转对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>497. 非重叠矩形中的随机点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0497-random-point-in-non-overlapping-rectangles/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0497-random-point-in-non-overlapping-rectangles/</guid><description>Medium | Array, Math, Binary Search, Reservoir Sampling, Prefix Sum, Ordered Set, Randomized</description></item><item><title>528. 按权重随机选择</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0528-random-pick-with-weight/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0528-random-pick-with-weight/</guid><description>Medium | Array, Math, Binary Search, Prefix Sum, Randomized</description></item><item><title>532. 数组中的 K-diff 数对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0532-k-diff-pairs-in-an-array/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0532-k-diff-pairs-in-an-array/</guid><description>Medium | Array, Hash Table, Two Pointers, Binary Search, Sorting</description></item><item><title>540. 有序数组中的单一元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0540-single-element-in-a-sorted-array/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0540-single-element-in-a-sorted-array/</guid><description>Medium | Array, Binary Search</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>633. 平方数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0633-sum-of-square-numbers/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0633-sum-of-square-numbers/</guid><description>Medium | Math, Two Pointers, Binary Search</description></item><item><title>658. 找到 K 个最接近的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0658-find-k-closest-elements/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0658-find-k-closest-elements/</guid><description>Medium | Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue)</description></item><item><title>668. 乘法表中第k小的数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0668-kth-smallest-number-in-multiplication-table/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0668-kth-smallest-number-in-multiplication-table/</guid><description>Hard | Math, Binary Search</description></item><item><title>704. 二分查找</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0704-binary-search/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0704-binary-search/</guid><description>Easy | Array, Binary Search</description></item><item><title>710. 黑名单中的随机数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0710-random-pick-with-blacklist/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0710-random-pick-with-blacklist/</guid><description>Hard | Array, Hash Table, Math, Binary Search, Sorting, Randomized</description></item><item><title>713. 乘积小于 K 的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0713-subarray-product-less-than-k/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0713-subarray-product-less-than-k/</guid><description>Medium | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>719. 找到第K小的数对距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0719-find-k-th-smallest-pair-distance/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0719-find-k-th-smallest-pair-distance/</guid><description>Hard | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>327. 区间和的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>349. 两个数组的交集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0349-intersection-of-two-arrays/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0349-intersection-of-two-arrays/</guid><description>Easy | Array, Hash Table, Two Pointers, Binary Search, Sorting</description></item><item><title>350. 两个数组的交集 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0350-intersection-of-two-arrays-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0350-intersection-of-two-arrays-ii/</guid><description>Easy | Array, Hash Table, Two Pointers, Binary Search, Sorting</description></item><item><title>352. 数据流的不相交区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0352-data-stream-as-disjoint-intervals/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0352-data-stream-as-disjoint-intervals/</guid><description>Hard | Hash Table, Binary Search, Union-Find, Design, Data Stream, Ordered Set</description></item><item><title>367. 有效的完全平方数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0367-valid-perfect-square/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0367-valid-perfect-square/</guid><description>Easy | Math, Binary Search</description></item><item><title>374. 猜数字大小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0374-guess-number-higher-or-lower/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0374-guess-number-higher-or-lower/</guid><description>Easy | Binary Search, Interactive</description></item><item><title>378. 有序矩阵中第K小的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0378-kth-smallest-element-in-a-sorted-matrix/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0378-kth-smallest-element-in-a-sorted-matrix/</guid><description>Medium | Array, Binary Search, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>400. 第N位数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0400-nth-digit/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0400-nth-digit/</guid><description>Medium | Math, Binary Search</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>436. 寻找右区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0436-find-right-interval/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0436-find-right-interval/</guid><description>Medium | Array, Binary Search, Sorting</description></item><item><title>441. 排列硬币</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0441-arranging-coins/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0441-arranging-coins/</guid><description>Easy | Math, Binary Search</description></item><item><title>456. 132 模式</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0456-132-pattern/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0456-132-pattern/</guid><description>Medium | Array, Binary Search, Stack, Monotonic Stack, Ordered Set</description></item><item><title>475. 供暖器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0475-heaters/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0475-heaters/</guid><description>Medium | Array, Two Pointers, Binary Search, Sorting</description></item><item><title>153. 寻找旋转排序数组中的最小值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0153-find-minimum-in-rotated-sorted-array/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0153-find-minimum-in-rotated-sorted-array/</guid><description>Medium | Array, Binary Search</description></item><item><title>154. 寻找旋转排序数组中的最小值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0154-find-minimum-in-rotated-sorted-array-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0154-find-minimum-in-rotated-sorted-array-ii/</guid><description>Hard | Array, Binary Search</description></item><item><title>162. 寻找峰值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0162-find-peak-element/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0162-find-peak-element/</guid><description>Medium | Array, Binary Search</description></item><item><title>167. 两数之和 II - 输入有序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0167-two-sum-ii-input-array-is-sorted/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0167-two-sum-ii-input-array-is-sorted/</guid><description>Medium | Array, Two Pointers, Binary Search</description></item><item><title>209. 长度最小的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0209-minimum-size-subarray-sum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0209-minimum-size-subarray-sum/</guid><description>Medium | Array, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>222. 完全二叉树的节点个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0222-count-complete-tree-nodes/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0222-count-complete-tree-nodes/</guid><description>Easy | Binary Search, Bit Manipulation, Tree, Binary Tree</description></item><item><title>240. 搜索二维矩阵 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0240-search-a-2d-matrix-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0240-search-a-2d-matrix-ii/</guid><description>Medium | Array, Binary Search, Divide and Conquer, Matrix</description></item><item><title>268. 缺失数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0268-missing-number/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0268-missing-number/</guid><description>Easy | Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting</description></item><item><title>275. H 指数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0275-h-index-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0275-h-index-ii/</guid><description>Medium | Array, Binary Search</description></item><item><title>278. 第一个错误的版本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0278-first-bad-version/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0278-first-bad-version/</guid><description>Easy | Binary Search, Interactive</description></item><item><title>287. 寻找重复数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0287-find-the-duplicate-number/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0287-find-the-duplicate-number/</guid><description>Medium | Array, Two Pointers, Binary Search, Bit Manipulation</description></item><item><title>300. 最长递增子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0300-longest-increasing-subsequence/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0300-longest-increasing-subsequence/</guid><description>Medium | Array, Binary Search, Dynamic Programming</description></item><item><title>315. 计算右侧小于当前元素的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>33. 搜索旋转排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0033-search-in-rotated-sorted-array/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0033-search-in-rotated-sorted-array/</guid><description>Medium | Array, Binary Search</description></item><item><title>34. 在排序数组中查找元素的第一个和最后一个位置</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0034-find-first-and-last-position-of-element-in-sorted-array/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0034-find-first-and-last-position-of-element-in-sorted-array/</guid><description>Medium | Array, Binary Search</description></item><item><title>35. 搜索插入位置</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0035-search-insert-position/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0035-search-insert-position/</guid><description>Easy | Array, Binary Search</description></item><item><title>4. 寻找两个正序数组的中位数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0004-median-of-two-sorted-arrays/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0004-median-of-two-sorted-arrays/</guid><description>Hard | Array, Binary Search, Divide and Conquer</description></item><item><title>69. x 的平方根</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0069-sqrtx/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0069-sqrtx/</guid><description>Easy | Math, Binary Search</description></item><item><title>74. 搜索二维矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0074-search-a-2d-matrix/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0074-search-a-2d-matrix/</guid><description>Medium | Array, Binary Search, Matrix</description></item><item><title>81. 搜索旋转排序数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0081-search-in-rotated-sorted-array-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0081-search-in-rotated-sorted-array-ii/</guid><description>Medium | Array, Binary Search</description></item></channel></rss>