<?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>Array on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/array/</link><description>Recent content in Array 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/array/index.xml" rel="self" type="application/rss+xml"/><item><title>1263. 将箱子推到目标位置的最小推动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1263-minimum-moves-to-move-a-box-to-their-target-location/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1263-minimum-moves-to-move-a-box-to-their-target-location/</guid><description>Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix</description></item><item><title>1728. 猫和老鼠游戏 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1728-cat-and-mouse-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1728-cat-and-mouse-ii/</guid><description>Hard | Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory</description></item><item><title>2532. 过桥的时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2532-time-to-cross-a-bridge/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2532-time-to-cross-a-bridge/</guid><description>Hard | Array, Heap (Priority Queue), Simulation</description></item><item><title>3013. 将数组分割成子数组的最小代价 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3013-divide-an-array-into-subarrays-with-minimum-cost-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3013-divide-an-array-into-subarrays-with-minimum-cost-ii/</guid><description>Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)</description></item><item><title>3197. 覆盖所有一的最小矩形面积 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3197-find-the-minimum-area-to-cover-all-ones-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3197-find-the-minimum-area-to-cover-all-ones-ii/</guid><description>Hard | Array, Matrix, Enumeration</description></item><item><title>3321. 所有长度为 K 的子数组的 X 和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3321-find-x-sum-of-all-k-long-subarrays-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3321-find-x-sum-of-all-k-long-subarrays-ii/</guid><description>Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)</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>3418. 机器人能获得的最大金钱数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3418-maximum-amount-of-money-robot-can-earn/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3418-maximum-amount-of-money-robot-can-earn/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3440. 重新安排会议以获得最大空闲时间 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3440-reschedule-meetings-for-maximum-free-time-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3440-reschedule-meetings-for-maximum-free-time-ii/</guid><description>Medium | Array, Greedy, Enumeration</description></item><item><title>3515. 带权树中的最短路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/</guid><description>Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Tree</description></item><item><title>3548. 等和网格分割 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3548-equal-sum-grid-partition-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3548-equal-sum-grid-partition-ii/</guid><description>Hard | Array, Hash Table, Matrix, Enumeration, Prefix Sum</description></item><item><title>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>3841. 树中回文路径查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3841-palindromic-path-queries-in-a-tree/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3841-palindromic-path-queries-in-a-tree/</guid><description>Hard | Array, String, Divide and Conquer, Tree, Segment Tree</description></item><item><title>745. 前缀和后缀搜索</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0745-prefix-and-suffix-search/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0745-prefix-and-suffix-search/</guid><description>Hard | Array, Hash Table, String, Design, Trie</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>1675. 最小化数组偏差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1675-minimize-deviation-in-array/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1675-minimize-deviation-in-array/</guid><description>Hard | Array, Greedy, Heap (Priority Queue), Ordered Set</description></item><item><title>1684. 统计一致字符串的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1684-count-the-number-of-consistent-strings/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1684-count-the-number-of-consistent-strings/</guid><description>Easy | Array, Hash Table, String, Bit Manipulation, Counting</description></item><item><title>1687. 从仓库向港口运送箱子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/</guid><description>Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>1705. 吃苹果的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1705-maximum-number-of-eaten-apples/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1705-maximum-number-of-eaten-apples/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1711. 统计好数对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1711-count-good-meals/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1711-count-good-meals/</guid><description>Medium | Array, Hash Table</description></item><item><title>1719. 重构一棵树的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1719-number-of-ways-to-reconstruct-a-tree/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1719-number-of-ways-to-reconstruct-a-tree/</guid><description>Hard | Array, Hash Table, Tree, Graph Theory, Simulation</description></item><item><title>1727. 重新排列后的最大子矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1727-largest-submatrix-with-rearrangements/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1727-largest-submatrix-with-rearrangements/</guid><description>Medium | Array, Greedy, Sorting, Matrix</description></item><item><title>1765. 最高峰地图</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1765-map-of-highest-peak/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1765-map-of-highest-peak/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>1770. 执行乘法运算的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1770-maximum-score-from-performing-multiplication-operations/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1770-maximum-score-from-performing-multiplication-operations/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>1774. 最接近的甜点成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1774-closest-dessert-cost/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1774-closest-dessert-cost/</guid><description>Medium | Array, Dynamic Programming, Backtracking</description></item><item><title>1776. 车队 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1776-car-fleet-ii/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1776-car-fleet-ii/</guid><description>Hard | Array, Math, Stack, Heap (Priority Queue), Monotonic Stack</description></item><item><title>1787. 使所有 K 个大小的段的异或为零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1787-make-the-xor-of-all-segments-equal-to-zero/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1787-make-the-xor-of-all-segments-equal-to-zero/</guid><description>Hard | Array, Hash Table, Dynamic Programming, Bit Manipulation, Counting</description></item><item><title>1792. 最大平均通过率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1792-maximum-average-pass-ratio/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1792-maximum-average-pass-ratio/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1803. 区间内异或对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1803-count-pairs-with-xor-in-a-range/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1803-count-pairs-with-xor-in-a-range/</guid><description>Hard | Array, Bit Manipulation, Trie</description></item><item><title>1806. 重新初始化排列的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1806-minimum-number-of-operations-to-reinitialize-a-permutation/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1806-minimum-number-of-operations-to-reinitialize-a-permutation/</guid><description>Medium | Array, Math, Simulation</description></item><item><title>1819. 不同子序列 GCD 的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1819-number-of-different-subsequences-gcds/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1819-number-of-different-subsequences-gcds/</guid><description>Hard | Array, Math, Counting, Number Theory</description></item><item><title>1834. 单线程 CPU</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1834-single-threaded-cpu/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1834-single-threaded-cpu/</guid><description>Medium | Array, Sorting, Heap (Priority Queue)</description></item><item><title>1861. 旋转盒子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1861-rotating-the-box/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1861-rotating-the-box/</guid><description>Medium | Array, Two Pointers, Matrix</description></item><item><title>1882. 使用服务器处理任务</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1882-process-tasks-using-servers/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1882-process-tasks-using-servers/</guid><description>Medium | Array, Heap (Priority Queue)</description></item><item><title>1883. 准时到达会议现场的最小跳过次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1883-minimum-skips-to-arrive-at-meeting-on-time/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1883-minimum-skips-to-arrive-at-meeting-on-time/</guid><description>Hard | Array, Dynamic Programming</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>1899. 合并三元组以形成目标三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1899-merge-triplets-to-form-target-triplet/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1899-merge-triplets-to-form-target-triplet/</guid><description>Medium | Array, Greedy</description></item><item><title>1909. 移除一个元素使数组严格递增</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1909-remove-one-element-to-make-the-array-strictly-increasing/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1909-remove-one-element-to-make-the-array-strictly-increasing/</guid><description>Easy | Array</description></item><item><title>1926. 迷宫中离入口最近的出口</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1926-nearest-exit-from-entrance-in-maze/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1926-nearest-exit-from-entrance-in-maze/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>1947. 最大兼容性评分和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1947-maximum-compatibility-score-sum/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1947-maximum-compatibility-score-sum/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask</description></item><item><title>1992. 查找农田的所有组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1992-find-all-groups-of-farmland/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1992-find-all-groups-of-farmland/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>1994. 好子集的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1994-the-number-of-good-subsets/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1994-the-number-of-good-subsets/</guid><description>Hard | Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Counting, Number Theory, Bitmask</description></item><item><title>1995. 统计特殊四元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1995-count-special-quadruplets/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1995-count-special-quadruplets/</guid><description>Easy | Array, Hash Table, Enumeration</description></item><item><title>2006. 绝对差值为 K 的数对数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2006-count-number-of-pairs-with-absolute-difference-k/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2006-count-number-of-pairs-with-absolute-difference-k/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>2018. 检查单词是否可以放在纵横填字游戏中</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2018-check-if-word-can-be-placed-in-crossword/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2018-check-if-word-can-be-placed-in-crossword/</guid><description>Medium | Array, Matrix, Enumeration</description></item><item><title>2019. 学生们解数学表达式的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2019-the-score-of-students-solving-math-expression/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2019-the-score-of-students-solving-math-expression/</guid><description>Hard | Array, Hash Table, Math, String, Dynamic Programming, Stack, Memoization</description></item><item><title>2023. 数字字符串配对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2023-number-of-pairs-of-strings-with-concatenation-equal-to-target/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2023-number-of-pairs-of-strings-with-concatenation-equal-to-target/</guid><description>Medium | Array, Hash Table, String, Counting</description></item><item><title>2025. 数组分割的最大方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2025-maximum-number-of-ways-to-partition-an-array/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2025-maximum-number-of-ways-to-partition-an-array/</guid><description>Hard | Array, Hash Table, Counting, Enumeration, Prefix Sum</description></item><item><title>2039. 网络空闲的时刻</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2039-the-time-when-the-network-becomes-idle/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2039-the-time-when-the-network-becomes-idle/</guid><description>Medium | Array, Breadth-First Search, Graph Theory</description></item><item><title>2059. 转换数字的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2059-minimum-operations-to-convert-number/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2059-minimum-operations-to-convert-number/</guid><description>Medium | Array, Breadth-First Search</description></item><item><title>2088. 统计农场中肥沃金字塔的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2088-count-fertile-pyramids-in-a-land/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2088-count-fertile-pyramids-in-a-land/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>2114. 句子中的最多单词数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2114-maximum-number-of-words-found-in-sentences/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2114-maximum-number-of-words-found-in-sentences/</guid><description>Easy | Array, String</description></item><item><title>2125. 银行中的激光束数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2125-number-of-laser-beams-in-a-bank/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2125-number-of-laser-beams-in-a-bank/</guid><description>Medium | Array, Math, String, Matrix</description></item><item><title>2132. 邮票网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2132-stamping-the-grid/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2132-stamping-the-grid/</guid><description>Hard | Array, Greedy, Matrix, Prefix Sum</description></item><item><title>2141. N 台电脑的最长运行时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2141-maximum-running-time-of-n-computers/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2141-maximum-running-time-of-n-computers/</guid><description>Hard | Array, Binary Search, Greedy, Sorting</description></item><item><title>2146. 价格范围内 K 个最高排名的物品</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2146-k-highest-ranked-items-within-a-price-range/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2146-k-highest-ranked-items-within-a-price-range/</guid><description>Medium | Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>2151. 根据陈述统计最多好人数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2151-maximum-good-people-based-on-statements/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2151-maximum-good-people-based-on-statements/</guid><description>Hard | Array, Backtracking, Bit Manipulation, Enumeration</description></item><item><title>2163. 移除元素后两个数组的最小差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2163-minimum-difference-in-sums-after-removal-of-elements/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2163-minimum-difference-in-sums-after-removal-of-elements/</guid><description>Hard | Array, Dynamic Programming, Heap (Priority Queue)</description></item><item><title>2176. 统计数组中相等且可被整除的数对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2176-count-equal-and-divisible-pairs-in-an-array/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2176-count-equal-and-divisible-pairs-in-an-array/</guid><description>Easy | Array</description></item><item><title>2188. 完成比赛的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2188-minimum-time-to-finish-the-race/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2188-minimum-time-to-finish-the-race/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>2233. K 次递增后的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2233-maximum-product-after-k-increments/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2233-maximum-product-after-k-increments/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>2239. 找最接近零的数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2239-find-closest-number-to-zero/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2239-find-closest-number-to-zero/</guid><description>Easy | Array</description></item><item><title>2242. 节点序列的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2242-maximum-score-of-a-node-sequence/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2242-maximum-score-of-a-node-sequence/</guid><description>Hard | Array, Graph Theory, Sorting, Enumeration</description></item><item><title>2257. 统计网格图中没有被保卫的格子数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2257-count-unguarded-cells-in-the-grid/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2257-count-unguarded-cells-in-the-grid/</guid><description>Medium | Array, Matrix, Simulation</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>2261. K 个可被整除元素的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2261-k-divisible-elements-subarrays/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2261-k-divisible-elements-subarrays/</guid><description>Medium | Array, Hash Table, Trie, Rolling Hash, Hash Function, Enumeration</description></item><item><title>2284. 单词数最多的发送者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2284-sender-with-largest-word-count/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2284-sender-with-largest-word-count/</guid><description>Medium | Array, Hash Table, String, Counting</description></item><item><title>2293. 最小最大游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2293-min-max-game/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2293-min-max-game/</guid><description>Easy | Array, Simulation</description></item><item><title>2301. 替换后匹配子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2301-match-substring-after-replacement/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2301-match-substring-after-replacement/</guid><description>Hard | Array, Hash Table, String, String Matching</description></item><item><title>2319. 检查矩阵是否为 X 矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2319-check-if-matrix-is-x-matrix/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2319-check-if-matrix-is-x-matrix/</guid><description>Easy | Array, 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>2391. 收集垃圾的最少总时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2391-minimum-amount-of-time-to-collect-garbage/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2391-minimum-amount-of-time-to-collect-garbage/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>2392. 构造满足条件的矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2392-build-a-matrix-with-conditions/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2392-build-a-matrix-with-conditions/</guid><description>Hard | Array, Graph Theory, Topological Sort, Matrix</description></item><item><title>2397. 列覆盖的最大行数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2397-maximum-rows-covered-by-columns/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2397-maximum-rows-covered-by-columns/</guid><description>Medium | Array, Backtracking, Bit Manipulation, Matrix, Enumeration</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>36. 有效的数独</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0036-valid-sudoku/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0036-valid-sudoku/</guid><description>Medium | Array, Hash Table, Matrix</description></item><item><title>37. 数独求解器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0037-sudoku-solver/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0037-sudoku-solver/</guid><description>Hard | Array, Hash Table, Backtracking, Matrix</description></item><item><title>1023. 驼峰式匹配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1023-camelcase-matching/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1023-camelcase-matching/</guid><description>Medium | Array, Two Pointers, String, Trie, String Matching</description></item><item><title>1034. 边界着色</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1034-coloring-a-border/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1034-coloring-a-border/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>1035. 不相交的线</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1035-uncrossed-lines/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1035-uncrossed-lines/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1093. 大样本统计</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1093-statistics-from-a-large-sample/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1093-statistics-from-a-large-sample/</guid><description>Medium | Array, Math, Probability and Statistics</description></item><item><title>1139. 最大 1 边界正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1139-largest-1-bordered-square/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1139-largest-1-bordered-square/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1162. 地图中的最高点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1162-as-far-from-land-as-possible/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1162-as-far-from-land-as-possible/</guid><description>Medium | Array, Dynamic Programming, Breadth-First Search, Matrix</description></item><item><title>1169. 无效的交易</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1169-invalid-transactions/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1169-invalid-transactions/</guid><description>Medium | Array, Hash Table, String, Sorting</description></item><item><title>1223. 掷骰子模拟</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1223-dice-roll-simulation/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1223-dice-roll-simulation/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>1224. 最大相等频率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1224-maximum-equal-frequency/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1224-maximum-equal-frequency/</guid><description>Hard | Array, Hash Table</description></item><item><title>1239. 具有唯一字符的最长子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1239-maximum-length-of-a-concatenated-string-with-unique-characters/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1239-maximum-length-of-a-concatenated-string-with-unique-characters/</guid><description>Medium | Array, String, Backtracking, Bit Manipulation</description></item><item><title>1267. 统计参与通信的服务器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1267-count-servers-that-communicate/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1267-count-servers-that-communicate/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix, Counting</description></item><item><title>1277. 统计全为 1 的正方形子矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1277-count-square-submatrices-with-all-ones/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1277-count-square-submatrices-with-all-ones/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1288. 删除被覆盖区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1288-remove-covered-intervals/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1288-remove-covered-intervals/</guid><description>Medium | Array, Sorting</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>1301. 最大得分的路径数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1301-number-of-paths-with-max-score/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1301-number-of-paths-with-max-score/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>1333. 根据素食友好、价格和距离过滤餐厅</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1333-filter-restaurants-by-vegan-friendly-price-and-distance/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1333-filter-restaurants-by-vegan-friendly-price-and-distance/</guid><description>Medium | Array, 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>1349. 参加考试的最大学生数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1349-maximum-students-taking-exam/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1349-maximum-students-taking-exam/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask</description></item><item><title>1356. 根据数字二进制下1的数目排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1356-sort-integers-by-the-number-of-1-bits/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1356-sort-integers-by-the-number-of-1-bits/</guid><description>Easy | Array, Bit Manipulation, Sorting, Counting</description></item><item><title>1380. 矩阵中的幸运数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1380-lucky-numbers-in-a-matrix/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1380-lucky-numbers-in-a-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>1388. 3n 块披萨</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1388-pizza-with-3n-slices/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1388-pizza-with-3n-slices/</guid><description>Hard | Array, Dynamic Programming, Greedy, Heap (Priority Queue)</description></item><item><title>1390. 四因数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1390-four-divisors/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1390-four-divisors/</guid><description>Medium | Array, Math</description></item><item><title>1438. 绝对差不超过限制的最长连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/</guid><description>Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue</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>1442. 统计能形成两个相等异或数组的三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1442-count-triplets-that-can-form-two-arrays-of-equal-xor/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1442-count-triplets-that-can-form-two-arrays-of-equal-xor/</guid><description>Medium | Array, Hash Table, Math, Bit Manipulation, Prefix Sum</description></item><item><title>1444. 切披萨的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1444-number-of-ways-of-cutting-a-pizza/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1444-number-of-ways-of-cutting-a-pizza/</guid><description>Hard | Array, Dynamic Programming, Memoization, Matrix, Prefix Sum</description></item><item><title>1452. 喜爱的公司列表不是其他列表子集的人</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/</guid><description>Medium | Array, Hash Table, String</description></item><item><title>1473. 粉刷房子 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1473-paint-house-iii/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1473-paint-house-iii/</guid><description>Hard | Array, Dynamic Programming</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>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>1504. 统计全为1的子矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1504-count-submatrices-with-all-ones/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1504-count-submatrices-with-all-ones/</guid><description>Medium | Array, Dynamic Programming, Stack, Matrix, Monotonic Stack</description></item><item><title>1536. 排列二进制网格的最少交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1536-minimum-swaps-to-arrange-a-binary-grid/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1536-minimum-swaps-to-arrange-a-binary-grid/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1559. 检测二维网格中的环</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1559-detect-cycles-in-2d-grid/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1559-detect-cycles-in-2d-grid/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1568. 使岛屿分离的最少天数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1568-minimum-number-of-days-to-disconnect-island/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1568-minimum-number-of-days-to-disconnect-island/</guid><description>Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Component</description></item><item><title>1577. 平方数等于两数乘积的方法数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/</guid><description>Medium | Array, Hash Table, Math, Two Pointers</description></item><item><title>1582. 二进制矩阵中的特殊位置</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1582-special-positions-in-a-binary-matrix/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1582-special-positions-in-a-binary-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>1595. 连接两组点的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1595-minimum-cost-to-connect-two-groups-of-points/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1595-minimum-cost-to-connect-two-groups-of-points/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask</description></item><item><title>1620. 最大网络质量的坐标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1620-coordinate-with-maximum-network-quality/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1620-coordinate-with-maximum-network-quality/</guid><description>Medium | Array, Enumeration</description></item><item><title>1629. 最慢的键</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1629-slowest-key/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1629-slowest-key/</guid><description>Easy | Array, String</description></item><item><title>1914. 循环轮转矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1914-cyclically-rotating-a-grid/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1914-cyclically-rotating-a-grid/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>1916. 蚁群建房间的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1916-count-ways-to-build-rooms-in-an-ant-colony/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1916-count-ways-to-build-rooms-in-an-ant-colony/</guid><description>Hard | Array, Math, Dynamic Programming, Tree, Depth-First Search, Graph Theory, Topological Sort, Combinatorics</description></item><item><title>1920. 基于排列构建数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1920-build-array-from-permutation/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1920-build-array-from-permutation/</guid><description>Easy | Array, Simulation</description></item><item><title>221. 最大正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0221-maximal-square/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0221-maximal-square/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>2765. 最长交替子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2765-longest-alternating-subarray/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2765-longest-alternating-subarray/</guid><description>Easy | Array, Enumeration</description></item><item><title>2766. 重新放置弹珠</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2766-relocate-marbles/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2766-relocate-marbles/</guid><description>Medium | Array, Hash Table, Sorting, Simulation</description></item><item><title>2768. 黑色方块的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2768-number-of-black-blocks/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2768-number-of-black-blocks/</guid><description>Medium | Array, Hash Table, Enumeration</description></item><item><title>2770. 到达最后一个下标的最大跳跃数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2770-maximum-number-of-jumps-to-reach-the-last-index/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2770-maximum-number-of-jumps-to-reach-the-last-index/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>2771. 从两个数组中构造最长非递减子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2771-longest-non-decreasing-subarray-from-two-arrays/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2771-longest-non-decreasing-subarray-from-two-arrays/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>2772. 通过操作使所有数组元素等于零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2772-apply-operations-to-make-all-array-elements-equal-to-zero/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2772-apply-operations-to-make-all-array-elements-equal-to-zero/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>2778. 特殊元素平方和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2778-sum-of-squares-of-special-elements/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2778-sum-of-squares-of-special-elements/</guid><description>Easy | Array, Enumeration</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>2780. 有效分割的最小下标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2780-minimum-index-of-a-valid-split/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2780-minimum-index-of-a-valid-split/</guid><description>Medium | Array, Hash Table, Sorting</description></item><item><title>2781. 最长有效子字符串的长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2781-length-of-the-longest-valid-substring/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2781-length-of-the-longest-valid-substring/</guid><description>Hard | Array, Hash Table, String, Sliding Window</description></item><item><title>2784. 检查数组是否是好数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2784-check-if-array-is-good/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2784-check-if-array-is-good/</guid><description>Easy | Array, Hash Table, Sorting</description></item><item><title>2786. 访问数组位置使得分最大化</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2786-visit-array-positions-to-maximize-score/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2786-visit-array-positions-to-maximize-score/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>2788. 按分隔符分割字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2788-split-strings-by-separator/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2788-split-strings-by-separator/</guid><description>Easy | Array, String</description></item><item><title>2789. 合并操作后数组中的最大元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2789-largest-element-in-an-array-after-merge-operations/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2789-largest-element-in-an-array-after-merge-operations/</guid><description>Medium | Array, Greedy</description></item><item><title>2790. 递增长度的最大分组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2790-maximum-number-of-groups-with-increasing-length/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2790-maximum-number-of-groups-with-increasing-length/</guid><description>Hard | Array, Math, Binary Search, Greedy, Sorting</description></item><item><title>2798. 达到目标工作时长的员工数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2798-number-of-employees-who-met-the-target/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2798-number-of-employees-who-met-the-target/</guid><description>Easy | Array</description></item><item><title>2799. 统计数组中的完全子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2799-count-complete-subarrays-in-an-array/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2799-count-complete-subarrays-in-an-array/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>289. 生命游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0289-game-of-life/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0289-game-of-life/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>313. 超级丑数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0313-super-ugly-number/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0313-super-ugly-number/</guid><description>Medium | Array, Math, Dynamic Programming</description></item><item><title>318. 单词长度最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0318-maximum-product-of-word-lengths/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0318-maximum-product-of-word-lengths/</guid><description>Medium | Array, String, Bit Manipulation</description></item><item><title>335. 路径交叉</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0335-self-crossing/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0335-self-crossing/</guid><description>Hard | Array, Math, Geometry</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>3572. 通过选择三个不同X值的三元组最大化Y值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3572-maximize-ysum-by-picking-a-triplet-of-distinct-xvalues/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3572-maximize-ysum-by-picking-a-triplet-of-distinct-xvalues/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>3573. 买卖股票的最佳时机 V</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3573-best-time-to-buy-and-sell-stock-v/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3573-best-time-to-buy-and-sell-stock-v/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3574. 最大化子数组GCD分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3574-maximize-subarray-gcd-score/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3574-maximize-subarray-gcd-score/</guid><description>Hard | Array, Math, Enumeration, Number Theory</description></item><item><title>3575. 最大好子树分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3575-maximum-good-subtree-score/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3575-maximum-good-subtree-score/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Bitmask</description></item><item><title>3576. 将数组转换为所有元素相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3576-transform-array-to-all-equal-elements/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3576-transform-array-to-all-equal-elements/</guid><description>Medium | Array, Greedy</description></item><item><title>3577. 计算计算机解锁排列的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3577-count-the-number-of-computer-unlocking-permutations/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3577-count-the-number-of-computer-unlocking-permutations/</guid><description>Medium | Array, Math, Brainteaser, Combinatorics</description></item><item><title>3578. 计算最大值最小值差值不超过K的分割数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3578-count-partitions-with-max-min-difference-at-most-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3578-count-partitions-with-max-min-difference-at-most-k/</guid><description>Medium | Array, Dynamic Programming, Queue, Sliding Window, Prefix Sum, Monotonic Queue</description></item><item><title>363. 矩形区域不超过 K 的最大数值和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</guid><description>Hard | Array, Binary Search, Matrix, Prefix Sum, Ordered Set</description></item><item><title>368. 最大整除子集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0368-largest-divisible-subset/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0368-largest-divisible-subset/</guid><description>Medium | Array, Math, Dynamic Programming, Sorting</description></item><item><title>406. 根据身高重建队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0406-queue-reconstruction-by-height/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0406-queue-reconstruction-by-height/</guid><description>Medium | Array, Binary Indexed Tree, Segment Tree, Sorting</description></item><item><title>407. 接雨水 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0407-trapping-rain-water-ii/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0407-trapping-rain-water-ii/</guid><description>Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix</description></item><item><title>419. 甲板上的战舰</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0419-battleships-in-a-board/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0419-battleships-in-a-board/</guid><description>Medium | Array, Depth-First Search, Matrix</description></item><item><title>427. 构造四叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0427-construct-quad-tree/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0427-construct-quad-tree/</guid><description>Medium | Array, Divide and Conquer, Tree, Matrix</description></item><item><title>447. 回旋镖的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0447-number-of-boomerangs/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0447-number-of-boomerangs/</guid><description>Medium | Array, Hash Table, Math</description></item><item><title>463. 岛屿的周长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0463-island-perimeter/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0463-island-perimeter/</guid><description>Easy | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>472. 连接词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0472-concatenated-words/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0472-concatenated-words/</guid><description>Hard | Array, String, Dynamic Programming, Depth-First Search, Trie, Sorting</description></item><item><title>474. 一和零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0474-ones-and-zeroes/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0474-ones-and-zeroes/</guid><description>Medium | Array, String, Dynamic Programming</description></item><item><title>480. 滑动窗口中位数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0480-sliding-window-median/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0480-sliding-window-median/</guid><description>Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)</description></item><item><title>522. 最长特殊序列 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0522-longest-uncommon-subsequence-ii/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0522-longest-uncommon-subsequence-ii/</guid><description>Medium | Array, Hash Table, Two Pointers, String, Sorting</description></item><item><title>524. 通过删除字母匹配到字典里最长单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0524-longest-word-in-dictionary-through-deleting/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0524-longest-word-in-dictionary-through-deleting/</guid><description>Medium | Array, Two Pointers, String, Sorting</description></item><item><title>526. 优美的排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0526-beautiful-arrangement/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0526-beautiful-arrangement/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask</description></item><item><title>542. 01 矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0542-01-matrix/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0542-01-matrix/</guid><description>Medium | Array, Dynamic Programming, Breadth-First Search, Matrix</description></item><item><title>560. 和为 K 的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0560-subarray-sum-equals-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0560-subarray-sum-equals-k/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>587. 安装栅栏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0587-erect-the-fence/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0587-erect-the-fence/</guid><description>Hard | Array, Math, Geometry</description></item><item><title>599. 两个列表的最小索引总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0599-minimum-index-sum-of-two-lists/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0599-minimum-index-sum-of-two-lists/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>632. 覆盖所有列表的最小区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0632-smallest-range-covering-elements-from-k-lists/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0632-smallest-range-covering-elements-from-k-lists/</guid><description>Hard | Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue)</description></item><item><title>665. 非递减数列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0665-non-decreasing-array/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0665-non-decreasing-array/</guid><description>Medium | Array</description></item><item><title>692. 前K个高频单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0692-top-k-frequent-words/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0692-top-k-frequent-words/</guid><description>Medium | Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting</description></item><item><title>695. 岛屿的最大面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0695-max-area-of-island/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0695-max-area-of-island/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</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>722. 移除注释</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0722-remove-comments/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0722-remove-comments/</guid><description>Medium | Array, String</description></item><item><title>735. 小行星碰撞</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0735-asteroid-collision/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0735-asteroid-collision/</guid><description>Medium | Array, Stack, Simulation</description></item><item><title>749. 围堵病毒</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0749-contain-virus/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0749-contain-virus/</guid><description>Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Simulation</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>794. 有效的井字游戏状态</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0794-valid-tic-tac-toe-state/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0794-valid-tic-tac-toe-state/</guid><description>Medium | Array, Matrix</description></item><item><title>809. 情感丰富的文字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0809-expressive-words/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0809-expressive-words/</guid><description>Medium | Array, Two Pointers, String</description></item><item><title>811. 子域名访问计数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0811-subdomain-visit-count/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0811-subdomain-visit-count/</guid><description>Medium | Array, Hash Table, String, Counting</description></item><item><title>823. 因数二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0823-binary-trees-with-factors/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0823-binary-trees-with-factors/</guid><description>Medium | Array, Hash Table, Dynamic Programming, Sorting</description></item><item><title>827. 最大人工岛</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0827-making-a-large-island/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0827-making-a-large-island/</guid><description>Hard | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>832. 翻转图像</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0832-flipping-an-image/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0832-flipping-an-image/</guid><description>Easy | Array, Two Pointers, Bit Manipulation, Matrix, Simulation</description></item><item><title>835. 图像重叠</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0835-image-overlap/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0835-image-overlap/</guid><description>Medium | Array, Matrix</description></item><item><title>839. 相似字符串组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0839-similar-string-groups/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0839-similar-string-groups/</guid><description>Hard | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find</description></item><item><title>843. 猜单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0843-guess-the-word/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0843-guess-the-word/</guid><description>Hard | Array, Math, String, Interactive, Game Theory</description></item><item><title>864. 获取所有钥匙的最短路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/</guid><description>Hard | Array, Bit Manipulation, Breadth-First Search, Matrix</description></item><item><title>893. 特殊等价字符串组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0893-groups-of-special-equivalent-strings/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0893-groups-of-special-equivalent-strings/</guid><description>Medium | Array, Hash Table, String, Sorting</description></item><item><title>90. 子集 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0090-subsets-ii/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0090-subsets-ii/</guid><description>Medium | Array, Backtracking, Bit Manipulation</description></item><item><title>904. 水果成篮</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0904-fruit-into-baskets/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0904-fruit-into-baskets/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>923. 三数之和的多种可能</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0923-3sum-with-multiplicity/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0923-3sum-with-multiplicity/</guid><description>Medium | Array, Hash Table, Two Pointers, Sorting, Counting</description></item><item><title>929. 独特的电子邮件地址</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0929-unique-email-addresses/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0929-unique-email-addresses/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>934. 最短的桥</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0934-shortest-bridge/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0934-shortest-bridge/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>937. 重新排列日志文件</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0937-reorder-data-in-log-files/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0937-reorder-data-in-log-files/</guid><description>Medium | Array, String, Sorting</description></item><item><title>939. 最小面积矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0939-minimum-area-rectangle/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0939-minimum-area-rectangle/</guid><description>Medium | Array, Hash Table, Math, Geometry, Sorting</description></item><item><title>943. 寻找最短超级字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0943-find-the-shortest-superstring/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0943-find-the-shortest-superstring/</guid><description>Hard | Array, String, Dynamic Programming, Bit Manipulation, Bitmask</description></item><item><title>959. 由斜杠分割的区域</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0959-regions-cut-by-slashes/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0959-regions-cut-by-slashes/</guid><description>Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>963. 最小面积矩形 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0963-minimum-area-rectangle-ii/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0963-minimum-area-rectangle-ii/</guid><description>Medium | Array, Hash Table, Math, Geometry</description></item><item><title>969. 煎饼排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0969-pancake-sorting/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0969-pancake-sorting/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>973. K 个最接近原点的点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0973-k-closest-points-to-origin/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0973-k-closest-points-to-origin/</guid><description>Medium | Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect</description></item><item><title>980. 不同路径 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0980-unique-paths-iii/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0980-unique-paths-iii/</guid><description>Hard | Array, Backtracking, Bit Manipulation, Matrix</description></item><item><title>982. 按位与为零的三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0982-triples-with-bitwise-and-equal-to-zero/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0982-triples-with-bitwise-and-equal-to-zero/</guid><description>Hard | Array, Hash Table, Bit Manipulation</description></item><item><title>994. 腐烂的橘子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0994-rotting-oranges/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0994-rotting-oranges/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>996. 平方数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0996-number-of-squareful-arrays/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0996-number-of-squareful-arrays/</guid><description>Hard | Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask</description></item><item><title>999. 车的可用捕获量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0999-available-captures-for-rook/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0999-available-captures-for-rook/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>3201. 寻找最长有效子序列 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3201-find-the-maximum-length-of-valid-subsequence-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3201-find-the-maximum-length-of-valid-subsequence-i/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3202. 求有效子序列的最大长度 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3202-find-the-maximum-length-of-valid-subsequence-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3202-find-the-maximum-length-of-valid-subsequence-ii/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3206. 交替组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3206-alternating-groups-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3206-alternating-groups-i/</guid><description>Easy | Array, Sliding Window</description></item><item><title>3207. 敌人战斗后的最大点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3207-maximum-points-after-enemy-battles/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3207-maximum-points-after-enemy-battles/</guid><description>Medium | Array, Greedy</description></item><item><title>3208. 交替组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3208-alternating-groups-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3208-alternating-groups-ii/</guid><description>Medium | Array, Sliding Window</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>3212. 计算 X 和 Y 频率相等的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3212-count-submatrices-with-equal-frequency-of-x-and-y/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3212-count-submatrices-with-equal-frequency-of-x-and-y/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>3213. 构造最小代价的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3213-construct-string-with-minimum-cost/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3213-construct-string-with-minimum-cost/</guid><description>Hard | Array, String, Dynamic Programming, Suffix Array</description></item><item><title>3217. 从链表中删除存在于数组中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3217-delete-nodes-from-linked-list-present-in-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3217-delete-nodes-from-linked-list-present-in-array/</guid><description>Medium | Array, Hash Table, Linked List</description></item><item><title>3218. 切蛋糕的最小总开销 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3218-minimum-cost-for-cutting-cake-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3218-minimum-cost-for-cutting-cake-i/</guid><description>Medium | Array, Two Pointers, Dynamic Programming, Greedy, Sorting</description></item><item><title>3219. 切割蛋糕的最小总开销 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3219-minimum-cost-for-cutting-cake-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3219-minimum-cost-for-cutting-cake-ii/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>3224. 使数组差值相等的最少数组修改次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3224-minimum-array-changes-to-make-differences-equal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3224-minimum-array-changes-to-make-differences-equal/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3225. 网格操作的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3225-maximum-score-from-grid-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3225-maximum-score-from-grid-operations/</guid><description>Hard | Array, Dynamic Programming, Matrix, Prefix Sum</description></item><item><title>3229. 使数组等于目标数组所需的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3229-minimum-operations-to-make-array-equal-to-target/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3229-minimum-operations-to-make-array-equal-to-target/</guid><description>Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>3232. 找出数字游戏是否能获胜</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3232-find-if-digit-game-can-be-won/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3232-find-if-digit-game-can-be-won/</guid><description>Easy | Array, Math</description></item><item><title>3233. 找出不是特殊数字的数字数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3233-find-the-count-of-numbers-which-are-not-special/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3233-find-the-count-of-numbers-which-are-not-special/</guid><description>Medium | Array, Math, Number Theory</description></item><item><title>3235. 检查矩形角落是否可达</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3235-check-if-the-rectangle-corner-is-reachable/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3235-check-if-the-rectangle-corner-is-reachable/</guid><description>Hard | Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometry</description></item><item><title>3238. 获胜玩家的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3238-find-the-number-of-winning-players/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3238-find-the-number-of-winning-players/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>3239. 使二进制网格回文的最少翻转次数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3239-minimum-number-of-flips-to-make-binary-grid-palindromic-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3239-minimum-number-of-flips-to-make-binary-grid-palindromic-i/</guid><description>Medium | Array, Two Pointers, Matrix</description></item><item><title>3240. 使二进制网格回文的最少翻转次数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3240-minimum-number-of-flips-to-make-binary-grid-palindromic-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3240-minimum-number-of-flips-to-make-binary-grid-palindromic-ii/</guid><description>Medium | Array, Two Pointers, Matrix</description></item><item><title>3242. 设计邻居和服务</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3242-design-neighbor-sum-service/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3242-design-neighbor-sum-service/</guid><description>Easy | Array, Hash Table, Design, Matrix, Simulation</description></item><item><title>3243. 道路查询后的最短距离 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3243-shortest-distance-after-road-addition-queries-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3243-shortest-distance-after-road-addition-queries-i/</guid><description>Medium | Array, Breadth-First Search, Graph Theory</description></item><item><title>3244. 道路修建查询后的最短距离 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/</guid><description>Hard | Array, Greedy, Graph Theory, Ordered Set</description></item><item><title>3245. 交替组 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3245-alternating-groups-iii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3245-alternating-groups-iii/</guid><description>Hard | Array, Binary Indexed Tree, Ordered Set</description></item><item><title>3248. 矩阵中的蛇</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3248-snake-in-matrix/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3248-snake-in-matrix/</guid><description>Easy | Array, String, Simulation</description></item><item><title>3250. 单调对的数目 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3250-find-the-count-of-monotonic-pairs-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3250-find-the-count-of-monotonic-pairs-i/</guid><description>Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum</description></item><item><title>3251. 单调数对的数目 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3251-find-the-count-of-monotonic-pairs-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3251-find-the-count-of-monotonic-pairs-ii/</guid><description>Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum</description></item><item><title>3254. 长度为 K 的子数组的能量值 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3254-find-the-power-of-k-size-subarrays-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3254-find-the-power-of-k-size-subarrays-i/</guid><description>Medium | Array, Sliding Window</description></item><item><title>3255. 找到K大小子数组的幂II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3255-find-the-power-of-k-size-subarrays-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3255-find-the-power-of-k-size-subarrays-ii/</guid><description>Medium | Array, Sliding Window</description></item><item><title>3256. 通过放置三个车获得的最大价值和 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3256-maximum-value-sum-by-placing-three-rooks-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3256-maximum-value-sum-by-placing-three-rooks-i/</guid><description>Hard | Array, Dynamic Programming, Matrix, Enumeration</description></item><item><title>3257. 通过放置三个车获得最大价值和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3257-maximum-value-sum-by-placing-three-rooks-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3257-maximum-value-sum-by-placing-three-rooks-ii/</guid><description>Hard | Array, Dynamic Programming, Matrix, Enumeration</description></item><item><title>3259. 两种饮品的最大能量提升</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3259-maximum-energy-boost-from-two-drinks/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3259-maximum-energy-boost-from-two-drinks/</guid><description>Medium | Array, Dynamic Programming</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>3264. K 次乘法运算后的最终数组状态 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3264-final-array-state-after-k-multiplication-operations-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3264-final-array-state-after-k-multiplication-operations-i/</guid><description>Easy | Array, Math, Heap (Priority Queue), Simulation</description></item><item><title>3265. 统计几乎相等数对 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3265-count-almost-equal-pairs-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3265-count-almost-equal-pairs-i/</guid><description>Medium | Array, Hash Table, Sorting, Counting, Enumeration</description></item><item><title>3266. K 次乘法运算后的最终数组状态 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3266-final-array-state-after-k-multiplication-operations-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3266-final-array-state-after-k-multiplication-operations-ii/</guid><description>Hard | Array, Heap (Priority Queue), Simulation</description></item><item><title>3267. 统计几乎相等数对 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3267-count-almost-equal-pairs-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3267-count-almost-equal-pairs-ii/</guid><description>Hard | Array, Hash Table, Sorting, Counting, Enumeration</description></item><item><title>3273. 对鲍勃造成的最小伤害数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3273-minimum-amount-of-damage-dealt-to-bob/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3273-minimum-amount-of-damage-dealt-to-bob/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>3275. 第 K 近障碍物查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3275-k-th-nearest-obstacle-queries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3275-k-th-nearest-obstacle-queries/</guid><description>Medium | Array, Heap (Priority Queue)</description></item><item><title>3276. 在网格中选择具有最大分数的单元格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3276-select-cells-in-grid-with-maximum-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3276-select-cells-in-grid-with-maximum-score/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask</description></item><item><title>3277. 最大异或分数子数组查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3277-maximum-xor-score-subarray-queries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3277-maximum-xor-score-subarray-queries/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>3281. 区间内数字的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3281-maximize-score-of-numbers-in-ranges/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3281-maximize-score-of-numbers-in-ranges/</guid><description>Medium | Array, Binary Search, Greedy, Sorting</description></item><item><title>3282. 到达数组末尾的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3282-reach-end-of-array-with-max-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3282-reach-end-of-array-with-max-score/</guid><description>Medium | Array, Greedy</description></item><item><title>3283. 击杀所有兵的最大移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3283-maximum-number-of-moves-to-kill-all-pawns/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3283-maximum-number-of-moves-to-kill-all-pawns/</guid><description>Hard | Array, Math, Bit Manipulation, Breadth-First Search, Game Theory, Bitmask</description></item><item><title>3285. 寻找稳定山脉的索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3285-find-indices-of-stable-mountains/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3285-find-indices-of-stable-mountains/</guid><description>Easy | Array</description></item><item><title>3286. 在网格中寻找安全路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/</guid><description>Medium | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>3287. 找到数组的最大序列值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3287-find-the-maximum-sequence-value-of-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3287-find-the-maximum-sequence-value-of-array/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation</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>3289. 数字村的两个调皮数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3289-the-two-sneaky-numbers-of-digitville/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3289-the-two-sneaky-numbers-of-digitville/</guid><description>Easy | Array, Hash Table, Math</description></item><item><title>3290. 最大乘积分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3290-maximum-multiplication-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3290-maximum-multiplication-score/</guid><description>Medium | Array, Dynamic Programming</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>3295. 举报垃圾信息</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3295-report-spam-message/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3295-report-spam-message/</guid><description>Medium | Array, Hash Table, String</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>3300. 数字替换后的最小元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3300-minimum-element-after-replacement-with-digit-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3300-minimum-element-after-replacement-with-digit-sum/</guid><description>Easy | Array, Math</description></item><item><title>3301. 最大化独特塔的总高度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3301-maximize-the-total-height-of-unique-towers/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3301-maximize-the-total-height-of-unique-towers/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3309. 通过二进制串联构造最大可能数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3309-maximum-possible-number-by-binary-concatenation/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3309-maximum-possible-number-by-binary-concatenation/</guid><description>Medium | Array, Bit Manipulation, Enumeration</description></item><item><title>3311. 构造匹配图布局的 2D 网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3311-construct-2d-grid-matching-graph-layout/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3311-construct-2d-grid-matching-graph-layout/</guid><description>Hard | Array, Hash Table, Graph Theory, Matrix</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>3314. 构造最小按位数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3314-construct-the-minimum-bitwise-array-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3314-construct-the-minimum-bitwise-array-i/</guid><description>Easy | Array, Bit Manipulation</description></item><item><title>3315. 构造最小按位数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3315-construct-the-minimum-bitwise-array-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3315-construct-the-minimum-bitwise-array-ii/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>3316. 从源字符串中删除的最大数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3316-find-maximum-removals-from-source-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3316-find-maximum-removals-from-source-string/</guid><description>Medium | Array, Hash Table, Two Pointers, String, Dynamic Programming</description></item><item><title>3318. 所有 K 长度子数组的 X-Sum I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3318-find-x-sum-of-all-k-long-subarrays-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3318-find-x-sum-of-all-k-long-subarrays-i/</guid><description>Easy | Array, Hash Table, Sliding Window, Heap (Priority Queue)</description></item><item><title>3326. 使数组非递减的最小除法运算次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3326-minimum-division-operations-to-make-array-non-decreasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3326-minimum-division-operations-to-make-array-non-decreasing/</guid><description>Medium | Array, Math, Greedy, Number Theory</description></item><item><title>3327. 检查DFS字符串是否为回文</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3327-check-if-dfs-strings-are-palindromes/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3327-check-if-dfs-strings-are-palindromes/</guid><description>Hard | Array, Hash Table, String, Tree, Depth-First Search, Hash Function</description></item><item><title>3331. 找出变化后的子树大小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3331-find-subtree-sizes-after-changes/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3331-find-subtree-sizes-after-changes/</guid><description>Medium | Array, Hash Table, String, Tree, Depth-First Search</description></item><item><title>3332. 游客能够获得的最大积分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3332-maximum-points-tourist-can-earn/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3332-maximum-points-tourist-can-earn/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3334. 找到数组的最大因子分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3334-find-the-maximum-factor-score-of-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3334-find-the-maximum-factor-score-of-array/</guid><description>Medium | Array, Math, Number Theory</description></item><item><title>3336. 寻找 GCD 相等的子序列对数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3336-find-the-number-of-subsequences-with-equal-gcd/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3336-find-the-number-of-subsequences-with-equal-gcd/</guid><description>Hard | Array, Math, Dynamic Programming, Number Theory</description></item><item><title>3341. 找到到达最后一个房间的最短时间 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/</guid><description>Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>3342. 寻找到达最后一个房间的最小时间 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/</guid><description>Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</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>3349. 相邻递增子数组检测 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3349-adjacent-increasing-subarrays-detection-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3349-adjacent-increasing-subarrays-detection-i/</guid><description>Easy | Array</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>3351. 好子序列的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3351-sum-of-good-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3351-sum-of-good-subsequences/</guid><description>Hard | Array, Hash Table, Dynamic Programming</description></item><item><title>3354. 使数组元素等于零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3354-make-array-elements-equal-to-zero/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3354-make-array-elements-equal-to-zero/</guid><description>Easy | Array, Simulation, Prefix Sum</description></item><item><title>3355. 零数组变换I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3355-zero-array-transformation-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3355-zero-array-transformation-i/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3356. 零数组变换 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3356-zero-array-transformation-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3356-zero-array-transformation-ii/</guid><description>Medium | Array, Two Pointers, Binary Search, Prefix Sum</description></item><item><title>3361. 两字符串间的移位距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3361-shift-distance-between-two-strings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3361-shift-distance-between-two-strings/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>3362. 零数组转换 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3362-zero-array-transformation-iii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3362-zero-array-transformation-iii/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum</description></item><item><title>3363. 找出可以收集的最大水果数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3363-find-the-maximum-number-of-fruits-collected/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3363-find-the-maximum-number-of-fruits-collected/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>3364. 最小正和子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3364-minimum-positive-sum-subarray/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3364-minimum-positive-sum-subarray/</guid><description>Easy | Array, Sliding Window, Prefix Sum</description></item><item><title>3366. 最小数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3366-minimum-array-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3366-minimum-array-sum/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3371. 识别数组中的最大异常值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3371-identify-the-largest-outlier-in-an-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3371-identify-the-largest-outlier-in-an-array/</guid><description>Medium | Array, Hash Table, Counting, Enumeration</description></item><item><title>3375. 使数组值等于 K 的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3375-minimum-operations-to-make-array-values-equal-to-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3375-minimum-operations-to-make-array-values-equal-to-k/</guid><description>Easy | Array, Hash Table</description></item><item><title>3376. 打破锁的最少时间 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3376-minimum-time-to-break-locks-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3376-minimum-time-to-break-locks-i/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Breadth-First Search, Bitmask</description></item><item><title>3378. LCM 图中的连通分量数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3378-count-connected-components-in-lcm-graph/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3378-count-connected-components-in-lcm-graph/</guid><description>Hard | Array, Hash Table, Math, Union-Find, Number Theory</description></item><item><title>3379. 转换数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3379-transformed-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3379-transformed-array/</guid><description>Easy | Array, Simulation</description></item><item><title>3380. 最大矩形面积与点约束 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3380-maximum-area-rectangle-with-point-constraints-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3380-maximum-area-rectangle-with-point-constraints-i/</guid><description>Medium | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumeration</description></item><item><title>3381. 长度可被 K 整除的最大子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3381-maximum-subarray-sum-with-length-divisible-by-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3381-maximum-subarray-sum-with-length-divisible-by-k/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3382. 具有点约束的最大面积矩形 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3382-maximum-area-rectangle-with-point-constraints-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3382-maximum-area-rectangle-with-point-constraints-ii/</guid><description>Hard | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting</description></item><item><title>3386. 按键时间最长的按钮</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3386-button-with-longest-push-time/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3386-button-with-longest-push-time/</guid><description>Easy | Array</description></item><item><title>3387. 两天转换后的最大金额</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3387-maximize-amount-after-two-days-of-conversions/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3387-maximize-amount-after-two-days-of-conversions/</guid><description>Medium | Array, String, Depth-First Search, Breadth-First Search, Graph Theory</description></item><item><title>3388. 数组中的美丽分割数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3388-count-beautiful-splits-in-an-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3388-count-beautiful-splits-in-an-array/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3392. 满足条件的长度为三的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3392-count-subarrays-of-length-three-with-a-condition/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3392-count-subarrays-of-length-three-with-a-condition/</guid><description>Easy | Array</description></item><item><title>3393. 具有给定异或值的路径数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3393-count-paths-with-the-given-xor-value/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3393-count-paths-with-the-given-xor-value/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation, Matrix</description></item><item><title>3394. 检查网格是否可以被切割成多个部分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3394-check-if-grid-can-be-cut-into-sections/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3394-check-if-grid-can-be-cut-into-sections/</guid><description>Medium | Array, Sorting</description></item><item><title>3395. 具有唯一中间众数的子序列 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3395-subsequences-with-a-unique-middle-mode-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3395-subsequences-with-a-unique-middle-mode-i/</guid><description>Hard | Array, Hash Table, Math, Combinatorics</description></item><item><title>3396. 使数组元素互不相同的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3396-minimum-number-of-operations-to-make-elements-in-array-distinct/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3396-minimum-number-of-operations-to-make-elements-in-array-distinct/</guid><description>Easy | Array, Hash Table</description></item><item><title>3397. 操作后的最大不同元素数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3397-maximum-number-of-distinct-elements-after-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3397-maximum-number-of-distinct-elements-after-operations/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>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>3402. 使列严格递增的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3402-minimum-operations-to-make-columns-strictly-increasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3402-minimum-operations-to-make-columns-strictly-increasing/</guid><description>Easy | Array, Greedy, Matrix</description></item><item><title>3404. 统计特殊子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3404-count-special-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3404-count-special-subsequences/</guid><description>Medium | Array, Hash Table, Math, Enumeration</description></item><item><title>3409. 相邻差递减的最长子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3409-longest-subsequence-with-decreasing-adjacent-difference/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3409-longest-subsequence-with-decreasing-adjacent-difference/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3410. 删除一个元素的所有出现后最大化子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3410-maximize-subarray-sum-after-removing-all-occurrences-of-one-element/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3410-maximize-subarray-sum-after-removing-all-occurrences-of-one-element/</guid><description>Hard | Array, Dynamic Programming, Segment Tree</description></item><item><title>3411. 乘积等价最长子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3411-maximum-subarray-with-equal-products/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3411-maximum-subarray-with-equal-products/</guid><description>Easy | Array, Math, Sliding Window, Enumeration, Number Theory</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>3417. 跳跃的之字形网格遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3417-zigzag-grid-traversal-with-skip/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3417-zigzag-grid-traversal-with-skip/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>3420. 经过 K 次操作后非递减子数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3420-count-non-decreasing-subarrays-after-k-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3420-count-non-decreasing-subarrays-after-k-operations/</guid><description>Hard | Array, Stack, Segment Tree, Queue, Sliding Window, Monotonic Stack, Monotonic Queue</description></item><item><title>3423. 循环数组中相邻元素的最大差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3423-maximum-difference-between-adjacent-elements-in-a-circular-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3423-maximum-difference-between-adjacent-elements-in-a-circular-array/</guid><description>Easy | Array</description></item><item><title>3424. 使数组相同的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3424-minimum-cost-to-make-arrays-identical/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3424-minimum-cost-to-make-arrays-identical/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3425. 最长特殊路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3425-longest-special-path/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3425-longest-special-path/</guid><description>Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum</description></item><item><title>3427. 可变长度子数组的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3427-sum-of-variable-length-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3427-sum-of-variable-length-subarrays/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>3428. 最多K个元素子序列的最大值和最小值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences/</guid><description>Medium | Array, Math, Dynamic Programming, Sorting, Combinatorics</description></item><item><title>3429. 粉刷房子 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3429-paint-house-iv/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3429-paint-house-iv/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3430. 最多 K 个元素的子数组的最大值和最小值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3430-maximum-and-minimum-sums-of-at-most-size-k-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3430-maximum-and-minimum-sums-of-at-most-size-k-subarrays/</guid><description>Hard | Array, Math, Stack, Monotonic Stack</description></item><item><title>3432. 偶数和差分的分割数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3432-count-partitions-with-even-sum-difference/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3432-count-partitions-with-even-sum-difference/</guid><description>Easy | Array, Math, Prefix Sum</description></item><item><title>3433. 计算每个用户的提及次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3433-count-mentions-per-user/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3433-count-mentions-per-user/</guid><description>Medium | Array, Math, Sorting, Simulation</description></item><item><title>3434. 子数组操作后的最大频率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3434-maximum-frequency-after-subarray-operation/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3434-maximum-frequency-after-subarray-operation/</guid><description>Medium | Array, Hash Table, Dynamic Programming, Greedy, Enumeration, Prefix Sum</description></item><item><title>3435. 最短超序列的频次</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3435-frequencies-of-shortest-supersequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3435-frequencies-of-shortest-supersequences/</guid><description>Hard | Array, String, Bit Manipulation, Graph Theory, Topological Sort, Enumeration</description></item><item><title>3439. 重新安排会议以最大化空闲时间 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3439-reschedule-meetings-for-maximum-free-time-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3439-reschedule-meetings-for-maximum-free-time-i/</guid><description>Medium | Array, Greedy, Sliding Window</description></item><item><title>3444. 数组中目标倍数的最小增量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3444-minimum-increments-for-target-multiples-in-an-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3444-minimum-increments-for-target-multiples-in-an-array/</guid><description>Hard | Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask</description></item><item><title>3446. 按对角线排序矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3446-sort-matrix-by-diagonals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3446-sort-matrix-by-diagonals/</guid><description>Medium | Array, Sorting, Matrix</description></item><item><title>3447. 将元素分配给带约束的组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3447-assign-elements-to-groups-with-constraints/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3447-assign-elements-to-groups-with-constraints/</guid><description>Medium | Array, Hash Table</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>3452. 好数字的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3452-sum-of-good-numbers/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3452-sum-of-good-numbers/</guid><description>Easy | Array</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>3457. 吃披萨！</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3457-eat-pizzas/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3457-eat-pizzas/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3459. 最长 V 形对角线段的长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3459-length-of-longest-v-shaped-diagonal-segment/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3459-length-of-longest-v-shaped-diagonal-segment/</guid><description>Hard | Array, Dynamic Programming, Memoization, Matrix</description></item><item><title>3462. 最多 K 个元素的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>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>3467. 按奇偶性转换数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3467-transform-array-by-parity/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3467-transform-array-by-parity/</guid><description>Easy | Array, Sorting, Counting</description></item><item><title>3468. 查找复制数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3468-find-the-number-of-copy-arrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3468-find-the-number-of-copy-arrays/</guid><description>Medium | Array, Math</description></item><item><title>3469. 找到移除数组元素的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3469-find-minimum-cost-to-remove-array-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3469-find-minimum-cost-to-remove-array-elements/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3470. 交替排列 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3470-permutations-iv/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3470-permutations-iv/</guid><description>Hard | Array, Math, Combinatorics, Enumeration</description></item><item><title>3471. 寻找最大的几乎缺失整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3471-find-the-largest-almost-missing-integer/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3471-find-the-largest-almost-missing-integer/</guid><description>Easy | Array, Hash Table</description></item><item><title>3473. 长度至少为 M 的 K 个子数组的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3473-sum-of-k-subarrays-with-length-at-least-m/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3473-sum-of-k-subarrays-with-length-at-least-m/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>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>3478. 选择 K 个元素获得最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3478-choose-k-elements-with-maximum-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3478-choose-k-elements-with-maximum-sum/</guid><description>Medium | Array, Sorting, Heap (Priority Queue)</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>3480. 删除一个冲突对后的最大子数组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3480-maximize-subarrays-after-removing-one-conflicting-pair/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3480-maximize-subarrays-after-removing-one-conflicting-pair/</guid><description>Hard | Array, Segment Tree, Enumeration, Prefix Sum</description></item><item><title>3483. 独特的三位偶数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3483-unique-3-digit-even-numbers/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3483-unique-3-digit-even-numbers/</guid><description>Easy | Array, Hash Table, Recursion, Enumeration</description></item><item><title>3484. 设计电子表格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3484-design-spreadsheet/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3484-design-spreadsheet/</guid><description>Medium | Array, Hash Table, String, Design, Matrix</description></item><item><title>3485. 删除 K 个字符串后的最长公共前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3485-longest-common-prefix-of-k-strings-after-removal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3485-longest-common-prefix-of-k-strings-after-removal/</guid><description>Hard | Array, String, Trie</description></item><item><title>3486. 最长特殊路径 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3486-longest-special-path-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3486-longest-special-path-ii/</guid><description>Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum</description></item><item><title>3487. 删除后最大唯一子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3487-maximum-unique-subarray-sum-after-deletion/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3487-maximum-unique-subarray-sum-after-deletion/</guid><description>Easy | Array, Hash Table, Greedy</description></item><item><title>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>3489. 零数组变换 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3489-zero-array-transformation-iv/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3489-zero-array-transformation-iv/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3493. 属性图</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3493-properties-graph/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3493-properties-graph/</guid><description>Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</description></item><item><title>3494. 找到冲泡魔法药剂的最小时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3494-find-the-minimum-amount-of-time-to-brew-potions/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3494-find-the-minimum-amount-of-time-to-brew-potions/</guid><description>Medium | Array, Simulation, Prefix Sum</description></item><item><title>3495. 使数组元素全部变为零的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3495-minimum-operations-to-make-array-elements-zero/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3495-minimum-operations-to-make-array-elements-zero/</guid><description>Hard | Array, Math, Bit Manipulation</description></item><item><title>3500. 将数组分成子数组的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3500-minimum-cost-to-divide-array-into-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3500-minimum-cost-to-divide-array-into-subarrays/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>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>3502. 到达每个位置的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3502-minimum-cost-to-reach-every-position/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3502-minimum-cost-to-reach-every-position/</guid><description>Easy | Array</description></item><item><title>3505. 使 K 个子数组内元素相等的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3505-minimum-operations-to-make-elements-within-k-subarrays-equal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3505-minimum-operations-to-make-elements-within-k-subarrays-equal/</guid><description>Hard | Array, Hash Table, Math, Dynamic Programming, Sliding Window, Heap (Priority Queue)</description></item><item><title>3507. 最小配对移除操作使数组有序 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3507-minimum-pair-removal-to-sort-array-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3507-minimum-pair-removal-to-sort-array-i/</guid><description>Easy | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set</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>3509. 求交替和等于 K 的子序列的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k/</guid><description>Hard | Array, Hash Table, Dynamic Programming</description></item><item><title>3510. 最小配对移除使数组有序 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3510-minimum-pair-removal-to-sort-array-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3510-minimum-pair-removal-to-sort-array-ii/</guid><description>Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set</description></item><item><title>3512. 使数组总和能被 K 整除的最小操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3512-minimum-operations-to-make-array-sum-divisible-by-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3512-minimum-operations-to-make-array-sum-divisible-by-k/</guid><description>Easy | Array, Math</description></item><item><title>3513. 唯一异或三元组数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3513-number-of-unique-xor-triplets-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3513-number-of-unique-xor-triplets-i/</guid><description>Medium | Array, Math, Bit Manipulation</description></item><item><title>3514. 唯一异或三元组的数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3514-number-of-unique-xor-triplets-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3514-number-of-unique-xor-triplets-ii/</guid><description>Medium | Array, Math, Bit Manipulation, Enumeration</description></item><item><title>3522. 执行指令后计算分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3522-calculate-score-after-performing-instructions/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3522-calculate-score-after-performing-instructions/</guid><description>Medium | Array, Hash Table, String, Simulation</description></item><item><title>3523. 使数组非递减</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3523-make-array-non-decreasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3523-make-array-non-decreasing/</guid><description>Medium | Array, Stack, Greedy, Monotonic Stack</description></item><item><title>3524. 寻找数组的X值 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3524-find-x-value-of-array-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3524-find-x-value-of-array-i/</guid><description>Medium | Array, Math, Dynamic Programming</description></item><item><title>3525. 求数组的 X 值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3525-find-x-value-of-array-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3525-find-x-value-of-array-ii/</guid><description>Hard | Array, Math, Segment Tree</description></item><item><title>3527. 寻找最常见的回复</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3527-find-the-most-common-response/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3527-find-the-most-common-response/</guid><description>Medium | Array, Hash Table, String, Counting</description></item><item><title>3529. 统计水平和垂直子串重叠的单元格数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3529-count-cells-in-overlapping-horizontal-and-vertical-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3529-count-cells-in-overlapping-horizontal-and-vertical-substrings/</guid><description>Medium | Array, String, Rolling Hash, String Matching, Matrix, Hash Function</description></item><item><title>3530. 有向无环图中拓扑排序的最大利润</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3530-maximum-profit-from-valid-topological-order-in-dag/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3530-maximum-profit-from-valid-topological-order-in-dag/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Graph Theory, Topological Sort, Bitmask</description></item><item><title>3531. 统计被覆盖的建筑物数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3531-count-covered-buildings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3531-count-covered-buildings/</guid><description>Medium | Array, Hash Table, Sorting</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>3533. 串联整除性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3533-concatenated-divisibility/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3533-concatenated-divisibility/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Bitmask</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>3537. 填充特殊网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3537-fill-a-special-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3537-fill-a-special-grid/</guid><description>Medium | Array, Divide and Conquer, Matrix</description></item><item><title>3538. 最小旅行时间的合并操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3538-merge-operations-for-minimum-travel-time/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3538-merge-operations-for-minimum-travel-time/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3539. 寻找神奇序列的数组乘积之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3539-find-sum-of-array-product-of-magical-sequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3539-find-sum-of-array-product-of-magical-sequences/</guid><description>Hard | Array, Math, Dynamic Programming, Bit Manipulation, Combinatorics, Bitmask</description></item><item><title>3542. 将所有元素转换为零的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3542-minimum-operations-to-convert-all-elements-to-zero/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3542-minimum-operations-to-convert-all-elements-to-zero/</guid><description>Medium | Array, Hash Table, Stack, Greedy, Monotonic Stack</description></item><item><title>3544. 子树反转和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3544-subtree-inversion-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3544-subtree-inversion-sum/</guid><description>Hard | Array, Dynamic Programming, Tree, Depth-First Search</description></item><item><title>3546. 相等和网格划分 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3546-equal-sum-grid-partition-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3546-equal-sum-grid-partition-i/</guid><description>Medium | Array, Matrix, Enumeration, Prefix Sum</description></item><item><title>3550. 数字和等于索引的最小下标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3550-smallest-index-with-digit-sum-equal-to-index/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3550-smallest-index-with-digit-sum-equal-to-index/</guid><description>Easy | Array, Math</description></item><item><title>3551. 按数字和排序的最小交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3551-minimum-swaps-to-sort-by-digit-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3551-minimum-swaps-to-sort-by-digit-sum/</guid><description>Medium | Array, Hash Table, Sorting</description></item><item><title>3552. 网格传送遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3552-grid-teleportation-traversal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3552-grid-teleportation-traversal/</guid><description>Medium | Array, Hash Table, Breadth-First Search, Matrix</description></item><item><title>3553. 带权重子图的最小路径 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3553-minimum-weighted-subgraph-with-the-required-paths-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3553-minimum-weighted-subgraph-with-the-required-paths-ii/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search</description></item><item><title>3559. 边权重分配的方案数II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3559-number-of-ways-to-assign-edge-weights-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3559-number-of-ways-to-assign-edge-weights-ii/</guid><description>Hard | Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search</description></item><item><title>3562. 股票交易折扣的最大利润</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3562-maximum-profit-from-trading-stocks-with-discounts/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3562-maximum-profit-from-trading-stocks-with-discounts/</guid><description>Hard | Array, Dynamic Programming, Tree, Depth-First Search</description></item><item><title>3566. 将数组分割为两个乘积相等的子集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3566-partition-array-into-two-equal-product-subsets/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3566-partition-array-into-two-equal-product-subsets/</guid><description>Medium | Array, Bit Manipulation, Recursion, Enumeration</description></item><item><title>3567. 滑动子矩阵的最小绝对差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3567-minimum-absolute-difference-in-sliding-submatrix/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3567-minimum-absolute-difference-in-sliding-submatrix/</guid><description>Medium | Array, Sorting, Matrix</description></item><item><title>3568. 清理教室的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3568-minimum-moves-to-clean-the-classroom/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3568-minimum-moves-to-clean-the-classroom/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix</description></item><item><title>3569. 分割后不同质数个数的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3569-maximize-count-of-distinct-primes-after-split/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3569-maximize-count-of-distinct-primes-after-split/</guid><description>Hard | Array, Math, Segment Tree, Number Theory</description></item><item><title>3583. 统计特殊三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3583-count-special-triplets/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3583-count-special-triplets/</guid><description>Medium | Array, Hash Table, Counting</description></item><item><title>3584. 子序列首尾元素乘积的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3584-maximum-product-of-first-and-last-elements-of-a-subsequence/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3584-maximum-product-of-first-and-last-elements-of-a-subsequence/</guid><description>Medium | Array, Two Pointers</description></item><item><title>3587. 最小相邻交换次数使奇偶性交替</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3587-minimum-adjacent-swaps-to-alternate-parity/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3587-minimum-adjacent-swaps-to-alternate-parity/</guid><description>Medium | Array, Greedy</description></item><item><title>3588. 找到三角形的最大面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3588-find-maximum-area-of-a-triangle/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3588-find-maximum-area-of-a-triangle/</guid><description>Medium | Array, Hash Table, Math, Greedy, Geometry, Enumeration</description></item><item><title>3589. 统计质数间隔平衡的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3589-count-prime-gap-balanced-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3589-count-prime-gap-balanced-subarrays/</guid><description>Medium | Array, Math, Queue, Sliding Window, Number Theory, Monotonic Queue</description></item><item><title>3590. 第K小路径异或和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3590-kth-smallest-path-xor-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3590-kth-smallest-path-xor-sum/</guid><description>Hard | Array, Tree, Depth-First Search, Ordered Set</description></item><item><title>3591. 检查是否有元素的频率为质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3591-check-if-any-element-has-prime-frequency/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3591-check-if-any-element-has-prime-frequency/</guid><description>Easy | Array, Hash Table, Math, Counting, Number Theory</description></item><item><title>3592. 逆向硬币找零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3592-inverse-coin-change/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3592-inverse-coin-change/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3593. 最少增量使叶子路径相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3593-minimum-increments-to-equalize-leaf-paths/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3593-minimum-increments-to-equalize-leaf-paths/</guid><description>Medium | Array, Dynamic Programming, Tree, Depth-First Search</description></item><item><title>3594. 运输所有个体的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/</guid><description>Hard | Array, Bit Manipulation, Graph Theory, Heap (Priority Queue), Shortest Path, Bitmask</description></item><item><title>3598. 删除元素后相邻字符串的最长公共前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3598-longest-common-prefix-between-adjacent-strings-after-removals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3598-longest-common-prefix-between-adjacent-strings-after-removals/</guid><description>Medium | Array, String</description></item><item><title>3599. 分割数组以最小化异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3599-partition-array-to-minimize-xor/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3599-partition-array-to-minimize-xor/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation, Prefix Sum</description></item><item><title>3603. 交替方向的最小成本路径 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3603-minimum-cost-path-with-alternating-directions-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3603-minimum-cost-path-with-alternating-directions-ii/</guid><description>Medium | Array, Dynamic Programming, Matrix</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>3606. 优惠券代码验证器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3606-coupon-code-validator/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3606-coupon-code-validator/</guid><description>Easy | Array, Hash Table, String, Sorting</description></item><item><title>3607. 电网维护</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3607-power-grid-maintenance/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3607-power-grid-maintenance/</guid><description>Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Set</description></item><item><title>3618. 按质数索引分割数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3618-split-array-by-prime-indices/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3618-split-array-by-prime-indices/</guid><description>Medium | Array, Math, Number Theory</description></item><item><title>3619. 统计总价值能被 K 整除的岛屿数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3619-count-islands-with-total-value-divisible-by-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3619-count-islands-with-total-value-divisible-by-k/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</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>3623. 计算梯形数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3623-count-number-of-trapezoids-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3623-count-number-of-trapezoids-i/</guid><description>Medium | Array, Hash Table, Math, Geometry</description></item><item><title>3624. 具有相等popcount深度K的整数数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3624-number-of-integers-with-popcount-depth-equal-to-k-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3624-number-of-integers-with-popcount-depth-equal-to-k-ii/</guid><description>Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree</description></item><item><title>3625. 计算梯形数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3625-count-number-of-trapezoids-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3625-count-number-of-trapezoids-ii/</guid><description>Hard | Array, Hash Table, Math, Geometry</description></item><item><title>3627. 长度为3的子序列的最大中位数和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3627-maximum-median-sum-of-subsequences-of-size-3/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3627-maximum-median-sum-of-subsequences-of-size-3/</guid><description>Medium | Array, Math, Greedy, Sorting, Game Theory</description></item><item><title>3629. 通过质数传送达到末尾的最小跳跃次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3629-minimum-jumps-to-reach-end-via-prime-teleportation/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3629-minimum-jumps-to-reach-end-via-prime-teleportation/</guid><description>Medium | Array, Hash Table, Math, Breadth-First Search, Number Theory</description></item><item><title>3630. 划分数组以最大化异或和与运算</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3630-partition-array-for-maximum-xor-and-and/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3630-partition-array-for-maximum-xor-and-and/</guid><description>Hard | Array, Math, Greedy, Bit Manipulation, Enumeration</description></item><item><title>3633. 陆地和水上游乐设施的最早完成时间 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3633-earliest-finish-time-for-land-and-water-rides-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3633-earliest-finish-time-for-land-and-water-rides-i/</guid><description>Easy | Array, Two Pointers, Binary Search, Greedy, Sorting</description></item><item><title>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>3637. 三离子数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3637-trionic-array-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3637-trionic-array-i/</guid><description>Easy | Array</description></item><item><title>3638. 最大平衡货运数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3638-maximum-balanced-shipments/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3638-maximum-balanced-shipments/</guid><description>Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>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>3640. 三调子数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3640-trionic-array-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3640-trionic-array-ii/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>3643. 垂直翻转正方形子矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3643-flip-square-submatrix-vertically/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3643-flip-square-submatrix-vertically/</guid><description>Easy | Array, Two Pointers, Matrix</description></item><item><title>3644. 排列的最大排序K值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3644-maximum-k-to-sort-a-permutation/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3644-maximum-k-to-sort-a-permutation/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>3645. 从最优激活顺序中获得的最大总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3645-maximum-total-from-optimal-activation-order/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3645-maximum-total-from-optimal-activation-order/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>3649. 完美对的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3649-number-of-perfect-pairs/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3649-number-of-perfect-pairs/</guid><description>Medium | Array, Math, Two Pointers, Sorting</description></item><item><title>3651. 有传送功能的最小路径代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3651-minimum-cost-path-with-teleportations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3651-minimum-cost-path-with-teleportations/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>3652. 使用策略买卖股票的最佳时机</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3652-best-time-to-buy-and-sell-stock-using-strategy/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3652-best-time-to-buy-and-sell-stock-using-strategy/</guid><description>Medium | Array, Sliding Window, Prefix Sum</description></item><item><title>3653. 范围乘法查询后的异或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3653-xor-after-range-multiplication-queries-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3653-xor-after-range-multiplication-queries-i/</guid><description>Medium | Array, Divide and Conquer, Simulation</description></item><item><title>3654. 可整除子数组删除后的最小和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3654-minimum-sum-after-divisible-sum-deletions/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3654-minimum-sum-after-divisible-sum-deletions/</guid><description>Medium | Array, Hash Table, Dynamic Programming, Prefix Sum</description></item><item><title>3655. 区间乘法查询后的异或值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3655-xor-after-range-multiplication-queries-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3655-xor-after-range-multiplication-queries-ii/</guid><description>Hard | Array, Divide and Conquer</description></item><item><title>3659. 将数组分割成K个不同元素的组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3659-partition-array-into-k-distinct-groups/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3659-partition-array-into-k-distinct-groups/</guid><description>Medium | Array, Hash Table, Counting</description></item><item><title>3660. 跳跃游戏 IX</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3660-jump-game-ix/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3660-jump-game-ix/</guid><description>Medium | Array, Dynamic Programming</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>3663. 找到出现频率最少的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3663-find-the-least-frequent-digit/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3663-find-the-least-frequent-digit/</guid><description>Easy | Array, Hash Table, Math, Counting</description></item><item><title>3664. 双字母卡牌游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3664-two-letter-card-game/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3664-two-letter-card-game/</guid><description>Medium | Array, Hash Table, String, Counting, Enumeration</description></item><item><title>3665. 扭曲镜面路径计数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3665-twisted-mirror-path-count/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3665-twisted-mirror-path-count/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3668. 恢复完赛顺序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3668-restore-finishing-order/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3668-restore-finishing-order/</guid><description>Easy | Array, Hash Table</description></item><item><title>3670. 没有公共位的两个整数的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3670-maximum-product-of-two-integers-with-no-common-bits/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3670-maximum-product-of-two-integers-with-no-common-bits/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation</description></item><item><title>3671. 美丽子序列的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3671-sum-of-beautiful-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3671-sum-of-beautiful-subsequences/</guid><description>Hard | Array, Math, Binary Indexed Tree, Number Theory</description></item><item><title>3674. 使数组元素相等的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3674-minimum-operations-to-equalize-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3674-minimum-operations-to-equalize-array/</guid><description>Easy | Array, Bit Manipulation, Brainteaser</description></item><item><title>3676. 碗形子数组计数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3676-count-bowl-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3676-count-bowl-subarrays/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>3678. 大于平均值的最小缺失正整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3678-smallest-absent-positive-greater-than-average/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3678-smallest-absent-positive-greater-than-average/</guid><description>Easy | Array, Hash Table</description></item><item><title>3679. 平衡库存的最少丢弃次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3679-minimum-discards-to-balance-inventory/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3679-minimum-discards-to-balance-inventory/</guid><description>Medium | Array, Hash Table, Sliding Window, Simulation, Counting</description></item><item><title>3680. 生成赛程表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3680-generate-schedule/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3680-generate-schedule/</guid><description>Medium | Array, Math, Greedy</description></item><item><title>3681. 子序列的最大异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3681-maximum-xor-of-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3681-maximum-xor-of-subsequences/</guid><description>Hard | Array, Math, Greedy, Bit Manipulation</description></item><item><title>3683. 完成一个任务的最早时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3683-earliest-time-to-finish-one-task/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3683-earliest-time-to-finish-one-task/</guid><description>Easy | Array</description></item><item><title>3684. 最大化最多K个不同元素的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3684-maximize-sum-of-at-most-k-distinct-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3684-maximize-sum-of-at-most-k-distinct-elements/</guid><description>Easy | Array, Hash Table, Greedy, Sorting</description></item><item><title>3685. 限制元素后的子序列和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3685-subsequence-sum-after-capping-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3685-subsequence-sum-after-capping-elements/</guid><description>Medium | Array, Two Pointers, Dynamic Programming, Sorting</description></item><item><title>3686. 稳定子序列的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3686-number-of-stable-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3686-number-of-stable-subsequences/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>3688. 数组中偶数的按位或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3688-bitwise-or-of-even-numbers-in-an-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3688-bitwise-or-of-even-numbers-in-an-array/</guid><description>Easy | Array, Bit Manipulation, Simulation</description></item><item><title>3689. 最大子数组总值 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3689-maximum-total-subarray-value-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3689-maximum-total-subarray-value-i/</guid><description>Medium | Array, Greedy</description></item><item><title>3690. 分割合并数组变换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3690-split-and-merge-array-transformation/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3690-split-and-merge-array-transformation/</guid><description>Medium | Array, Hash Table, Breadth-First Search</description></item><item><title>3691. 最大子数组值总和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3691-maximum-total-subarray-value-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3691-maximum-total-subarray-value-ii/</guid><description>Hard | Array, Greedy, Segment Tree, Heap (Priority Queue)</description></item><item><title>3693. 爬楼梯 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3693-climbing-stairs-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3693-climbing-stairs-ii/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3695. 使用交换最大化交替和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3695-maximize-alternating-sum-using-swaps/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3695-maximize-alternating-sum-using-swaps/</guid><description>Hard | Array, Greedy, Union-Find, Sorting</description></item><item><title>3697. 计算十进制表示</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3697-compute-decimal-representation/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3697-compute-decimal-representation/</guid><description>Easy | Array, Math</description></item><item><title>3698. 最小差值分割数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3698-split-array-with-minimum-difference/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3698-split-array-with-minimum-difference/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3701. 计算交替和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3701-compute-alternating-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3701-compute-alternating-sum/</guid><description>Easy | Array, Simulation</description></item><item><title>3702. 最长非零按位异或子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3702-longest-subsequence-with-non-zero-bitwise-xor/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3702-longest-subsequence-with-non-zero-bitwise-xor/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>3708. 最长斐波那契子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3708-longest-fibonacci-subarray/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3708-longest-fibonacci-subarray/</guid><description>Medium | Array</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>3712. 频率能被 K 整除的元素之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3712-sum-of-elements-with-frequency-divisible-by-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3712-sum-of-elements-with-frequency-divisible-by-k/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>3715. 完全平方祖先节点的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3715-sum-of-perfect-square-ancestors/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3715-sum-of-perfect-square-ancestors/</guid><description>Hard | Array, Hash Table, Math, Tree, Depth-First Search, Counting, Number Theory</description></item><item><title>3718. 缺失的最小 K 的倍数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3718-smallest-missing-multiple-of-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3718-smallest-missing-multiple-of-k/</guid><description>Easy | Array, Hash Table</description></item><item><title>3719. 最长平衡子数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3719-longest-balanced-subarray-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3719-longest-balanced-subarray-i/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum</description></item><item><title>3721. 最长平衡子数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3721-longest-balanced-subarray-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3721-longest-balanced-subarray-ii/</guid><description>Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum</description></item><item><title>3724. 使数组转换的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3724-minimum-operations-to-transform-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3724-minimum-operations-to-transform-array/</guid><description>Medium | Array, Greedy</description></item><item><title>3725. 从行中选择互质整数的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3725-count-ways-to-choose-coprime-integers-from-rows/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3725-count-ways-to-choose-coprime-integers-from-rows/</guid><description>Hard | Array, Math, Dynamic Programming, Matrix, Combinatorics, Number Theory</description></item><item><title>3727. 最大交替平方和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3727-maximum-alternating-sum-of-squares/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3727-maximum-alternating-sum-of-squares/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3728. 边界和内部和相等的稳定子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3728-stable-subarrays-with-equal-boundary-and-interior-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3728-stable-subarrays-with-equal-boundary-and-interior-sum/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3729. 统计有序数组中能被K整除的不同子数组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3729-count-distinct-subarrays-divisible-by-k-in-sorted-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3729-count-distinct-subarrays-divisible-by-k-in-sorted-array/</guid><description>Hard | Array, Hash Table, Prefix Sum</description></item><item><title>3731. 寻找缺失的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3731-find-missing-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3731-find-missing-elements/</guid><description>Easy | Array, Hash Table, Sorting</description></item><item><title>3732. 一次替换后三个元素的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3732-maximum-product-of-three-elements-after-one-replacement/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3732-maximum-product-of-three-elements-after-one-replacement/</guid><description>Medium | Array, Math, Greedy, Sorting</description></item><item><title>3736. 使数组元素相等的最少移动次数 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3736-minimum-moves-to-equal-array-elements-iii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3736-minimum-moves-to-equal-array-elements-iii/</guid><description>Easy | Array, Math</description></item><item><title>3737. 统计具有主要元素的子数组数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3737-count-subarrays-with-majority-element-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3737-count-subarrays-with-majority-element-i/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Counting, Prefix Sum</description></item><item><title>3738. 最多替换一个元素后的最长非递减子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3738-longest-non-decreasing-subarray-after-replacing-at-most-one-element/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3738-longest-non-decreasing-subarray-after-replacing-at-most-one-element/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3739. 计算多数元素子数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/</guid><description>Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Prefix Sum</description></item><item><title>3740. 三个相等元素的最小距离 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3740-minimum-distance-between-three-equal-elements-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3740-minimum-distance-between-three-equal-elements-i/</guid><description>Easy | Array, Hash Table</description></item><item><title>3741. 三个相等元素之间的最小距离 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3741-minimum-distance-between-three-equal-elements-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3741-minimum-distance-between-three-equal-elements-ii/</guid><description>Medium | Array, Hash Table</description></item><item><title>3742. 网格中的最大路径分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3742-maximum-path-score-in-a-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3742-maximum-path-score-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3743. 最大化循环分割得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3743-maximize-cyclic-partition-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3743-maximize-cyclic-partition-score/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>3745. 最大化三个元素的表达式</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3745-maximize-expression-of-three-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3745-maximize-expression-of-three-elements/</guid><description>Easy | Array, Greedy, Sorting, Enumeration</description></item><item><title>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>3752. 字典序最小的求和为目标值的带符号排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3752-lexicographically-smallest-negated-permutation-that-sums-to-target/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3752-lexicographically-smallest-negated-permutation-that-sums-to-target/</guid><description>Medium | Array, Math, Two Pointers, Greedy, Sorting</description></item><item><title>3755. 寻找最大平衡异或子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3755-find-maximum-balanced-xor-subarray-length/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3755-find-maximum-balanced-xor-subarray-length/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Prefix Sum</description></item><item><title>3757. 有效子序列的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3757-number-of-effective-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3757-number-of-effective-subsequences/</guid><description>Hard | Array, Math, Dynamic Programming, Bit Manipulation, Combinatorics</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>3761. 镜像对之间的最小绝对距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3761-minimum-absolute-distance-between-mirror-pairs/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3761-minimum-absolute-distance-between-mirror-pairs/</guid><description>Medium | Array, Hash Table, Math</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>3767. 选择K个任务后的最大积分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3767-maximize-points-after-choosing-k-tasks/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3767-maximize-points-after-choosing-k-tasks/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>3768. 固定长度子数组的最小逆序对数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3768-minimum-inversion-count-in-subarrays-of-fixed-length/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3768-minimum-inversion-count-in-subarrays-of-fixed-length/</guid><description>Hard | Array, Segment Tree, Sliding Window</description></item><item><title>3769. 按二进制反射排序整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3769-sort-integers-by-binary-reflection/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3769-sort-integers-by-binary-reflection/</guid><description>Easy | Array, Sorting</description></item><item><title>3770. 从连续质数和得到的最大质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3770-largest-prime-from-consecutive-prime-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3770-largest-prime-from-consecutive-prime-sum/</guid><description>Medium | Array, Math, Number Theory</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>3772. 树中子图的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3772-maximum-subgraph-score-in-a-tree/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3772-maximum-subgraph-score-in-a-tree/</guid><description>Hard | Array, Dynamic Programming, Tree, Depth-First Search</description></item><item><title>3774. 最大和最小 K 个元素的绝对差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3774-absolute-difference-between-maximum-and-minimum-k-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3774-absolute-difference-between-maximum-and-minimum-k-elements/</guid><description>Easy | Array, Sorting</description></item><item><title>3776. 平衡循环数组的最小移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3776-minimum-moves-to-balance-circular-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3776-minimum-moves-to-balance-circular-array/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3779. 使数组元素互不相同的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3779-minimum-number-of-operations-to-have-distinct-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3779-minimum-number-of-operations-to-have-distinct-elements/</guid><description>Medium | Array, Hash Table</description></item><item><title>3780. 能被三整除的三个数的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3780-maximum-sum-of-three-numbers-divisible-by-three/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3780-maximum-sum-of-three-numbers-divisible-by-three/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>3781. 二进制交换后的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3781-maximum-score-after-binary-swaps/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3781-maximum-score-after-binary-swaps/</guid><description>Medium | Array, String, Greedy, Heap (Priority Queue)</description></item><item><title>3784. 使所有字符相等的最小删除成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3784-minimum-deletion-cost-to-make-all-characters-equal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3784-minimum-deletion-cost-to-make-all-characters-equal/</guid><description>Medium | Array, Hash Table, String, Enumeration</description></item><item><title>3785. 避免禁止值的最小交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3785-minimum-swaps-to-avoid-forbidden-values/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3785-minimum-swaps-to-avoid-forbidden-values/</guid><description>Hard | Array, Hash Table, Greedy, Counting</description></item><item><title>3786. 树形分组的交互成本总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3786-total-sum-of-interaction-cost-in-tree-groups/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3786-total-sum-of-interaction-cost-in-tree-groups/</guid><description>Hard | Array, Tree, Depth-First Search</description></item><item><title>3788. 分割数组的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3788-maximum-score-of-a-split/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3788-maximum-score-of-a-split/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3795. 不同元素和至少为 K 的最短子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3795-minimum-subarray-length-with-distinct-sum-at-least-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3795-minimum-subarray-length-with-distinct-sum-at-least-k/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>3796. 在约束序列中找最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3796-find-maximum-value-in-a-constrained-sequence/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3796-find-maximum-value-in-a-constrained-sequence/</guid><description>Medium | Array, Greedy</description></item><item><title>3797. 计算攀爬矩形网格的路径数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3797-count-routes-to-climb-a-rectangular-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3797-count-routes-to-climb-a-rectangular-grid/</guid><description>Hard | Array, Dynamic Programming, Matrix, Prefix Sum</description></item><item><title>3799. 单词方格 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3799-word-squares-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3799-word-squares-ii/</guid><description>Medium | Array, String, Backtracking, Sorting, Enumeration</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>3804. 居中子数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3804-number-of-centered-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3804-number-of-centered-subarrays/</guid><description>Medium | Array, Hash Table, Enumeration</description></item><item><title>3805. 计算凯撒密码对数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3805-count-caesar-cipher-pairs/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3805-count-caesar-cipher-pairs/</guid><description>Medium | Array, Hash Table, Math, String, Counting</description></item><item><title>3806. 递增操作后的最大按位与</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3806-maximum-bitwise-and-after-increment-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3806-maximum-bitwise-and-after-increment-operations/</guid><description>Hard | Array, Greedy, Bit Manipulation, Sorting</description></item><item><title>3809. 最佳可达塔台</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3809-best-reachable-tower/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3809-best-reachable-tower/</guid><description>Medium | Array</description></item><item><title>3810. 达到目标数组的最小操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3810-minimum-operations-to-reach-target-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3810-minimum-operations-to-reach-target-array/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>3811. 交替异或分割数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3811-number-of-alternating-xor-partitions/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3811-number-of-alternating-xor-partitions/</guid><description>Medium | Array, Hash Table, 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>3818. 使数组严格递增的最小前缀移除长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3818-minimum-prefix-removal-to-make-array-strictly-increasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3818-minimum-prefix-removal-to-make-array-strictly-increasing/</guid><description>Medium | Array</description></item><item><title>3819. 旋转非负元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3819-rotate-non-negative-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3819-rotate-non-negative-elements/</guid><description>Medium | Array, Simulation</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>3826. 最小分割得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/</guid><description>Hard | Array, Divide and Conquer, Dynamic Programming, Queue, Prefix Sum, Monotonic Queue</description></item><item><title>3828. 子数组删除后的最终元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3828-final-element-after-subarray-deletions/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3828-final-element-after-subarray-deletions/</guid><description>Medium | Array, Math, Brainteaser, Game Theory</description></item><item><title>3830. 删除最多一个元素后的最长交替子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3830-longest-alternating-subarray-after-removing-at-most-one-element/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3830-longest-alternating-subarray-after-removing-at-most-one-element/</guid><description>Hard | Array, Dynamic Programming, Enumeration</description></item><item><title>3833. 统计主导索引的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3833-count-dominant-indices/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3833-count-dominant-indices/</guid><description>Easy | Array, Enumeration</description></item><item><title>3834. 合并相邻相等元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3834-merge-adjacent-equal-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3834-merge-adjacent-equal-elements/</guid><description>Medium | Array, Stack, Simulation</description></item><item><title>3835. 统计花费小于等于 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3835-count-subarrays-with-cost-less-than-or-equal-to-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3835-count-subarrays-with-cost-less-than-or-equal-to-k/</guid><description>Medium | Array, Queue, Monotonic Queue</description></item><item><title>3836. 使用恰好 K 对的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3836-maximum-score-using-exactly-k-pairs/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3836-maximum-score-using-exactly-k-pairs/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>3838. 加权单词映射</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3838-weighted-word-mapping/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3838-weighted-word-mapping/</guid><description>Easy | Array, String, Simulation</description></item><item><title>3839. 前缀连接组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3839-number-of-prefix-connected-groups/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3839-number-of-prefix-connected-groups/</guid><description>Medium | Array, Hash Table, String, Counting</description></item><item><title>3840. 打家劫舍 V</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3840-house-robber-v/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3840-house-robber-v/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3842. 切换灯泡</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3842-toggle-light-bulbs/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3842-toggle-light-bulbs/</guid><description>Easy | Array, Hash Table, Sorting, Simulation</description></item><item><title>3843. 第一个频率唯一的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3843-first-element-with-unique-frequency/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3843-first-element-with-unique-frequency/</guid><description>Medium | Array, Hash Table, Counting</description></item><item><title>3845. 有界范围内的最大子数组异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/</guid><description>Hard | Array, Bit Manipulation, Trie, Queue, Sliding Window, Prefix Sum, Monotonic Queue</description></item><item><title>3847. 找到游戏中的分数差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3847-find-the-score-difference-in-a-game/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3847-find-the-score-difference-in-a-game/</guid><description>Medium | Array, Simulation</description></item><item><title>3850. 计算到达K的序列数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3850-count-sequences-to-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3850-count-sequences-to-k/</guid><description>Hard | Array, Math, Dynamic Programming, Memoization, Number Theory</description></item><item><title>3852. 频率不同的最小数对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3852-smallest-pair-with-different-frequencies/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3852-smallest-pair-with-different-frequencies/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>3854. 使数组奇偶性交替的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3854-minimum-operations-to-make-array-parity-alternating/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3854-minimum-operations-to-make-array-parity-alternating/</guid><description>Medium | Array, Greedy</description></item><item><title>3858. 网格中的最小按位或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3858-minimum-bitwise-or-from-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3858-minimum-bitwise-or-from-grid/</guid><description>Medium | Array, Greedy, Bit Manipulation, Matrix</description></item><item><title>3859. 含有 K 个不同整数的子数组计数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3859-count-subarrays-with-k-distinct-integers/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3859-count-subarrays-with-k-distinct-integers/</guid><description>Hard | Array, Hash Table, Sliding Window, Counting</description></item><item><title>3861. 最小容量盒子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3861-minimum-capacity-box/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3861-minimum-capacity-box/</guid><description>Easy | Array</description></item><item><title>3862. 寻找最小平衡索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3862-find-the-smallest-balanced-index/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3862-find-the-smallest-balanced-index/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3866. 第一个唯一偶数元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3866-first-unique-even-element/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3866-first-unique-even-element/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>3867. 构成配对的最大公约数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3867-sum-of-gcd-of-formed-pairs/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3867-sum-of-gcd-of-formed-pairs/</guid><description>Medium | Array, Math, Two Pointers, Simulation, Number Theory</description></item><item><title>3868. 使用交换使数组相等的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3868-minimum-cost-to-equalize-arrays-using-swaps/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3868-minimum-cost-to-equalize-arrays-using-swaps/</guid><description>Medium | Array, Hash Table, Greedy, Counting</description></item><item><title>3872. 最多修改一个元素后的最长等差数列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3872-longest-arithmetic-sequence-after-changing-at-most-one-element/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3872-longest-arithmetic-sequence-after-changing-at-most-one-element/</guid><description>Medium | Array, Enumeration</description></item><item><title>3873. 通过添加一个点激活的最大点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3873-maximum-points-activated-with-one-addition/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3873-maximum-points-activated-with-one-addition/</guid><description>Hard | Array, Hash Table, Union-Find</description></item><item><title>3875. 构造统一奇偶性数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3875-construct-uniform-parity-array-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3875-construct-uniform-parity-array-i/</guid><description>Easy | Array, Math</description></item><item><title>3876. 构造统一奇偶性数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3876-construct-uniform-parity-array-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3876-construct-uniform-parity-array-ii/</guid><description>Medium | Array, Math</description></item><item><title>3877. 实现目标异或值的最少移除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3877-minimum-removals-to-achieve-target-xor/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3877-minimum-removals-to-achieve-target-xor/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation</description></item><item><title>3878. 统计好子数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3878-count-good-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3878-count-good-subarrays/</guid><description>Hard | Array, Stack, Bit Manipulation, Monotonic Stack</description></item><item><title>3880. 两个值之间的最小绝对差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3880-minimum-absolute-difference-between-two-values/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3880-minimum-absolute-difference-between-two-values/</guid><description>Easy | Array, Enumeration</description></item><item><title>3882. 网格中的最小异或路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3882-minimum-xor-path-in-a-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3882-minimum-xor-path-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation, Matrix</description></item><item><title>3883. 统计具有给定数字和的非递减数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3883-count-non-decreasing-arrays-with-given-digit-sums/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3883-count-non-decreasing-arrays-with-given-digit-sums/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3885. 设计事件管理器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3885-design-event-manager/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3885-design-event-manager/</guid><description>Medium | Array, Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>3886. 可排序整数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3886-sum-of-sortable-integers/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3886-sum-of-sortable-integers/</guid><description>Hard | Array, Math, Sorting, Enumeration</description></item><item><title>3891. 最小增量以最大化特殊索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3891-minimum-increase-to-maximize-special-indices/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3891-minimum-increase-to-maximize-special-indices/</guid><description>Medium | Array, Dynamic Programming, Greedy, Prefix Sum</description></item><item><title>3892. 实现至少 K 个峰值的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3892-minimum-operations-to-achieve-at-least-k-peaks/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3892-minimum-operations-to-achieve-at-least-k-peaks/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>2961. 双模幂运算</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2961-double-modular-exponentiation/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2961-double-modular-exponentiation/</guid><description>Medium | Array, Math, Simulation</description></item><item><title>2962. 统计最大元素出现至少 K 次的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2962-count-subarrays-where-max-element-appears-at-least-k-times/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2962-count-subarrays-where-max-element-appears-at-least-k-times/</guid><description>Medium | Array, Sliding Window</description></item><item><title>2963. 统计好分割方案的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2963-count-the-number-of-good-partitions/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2963-count-the-number-of-good-partitions/</guid><description>Hard | Array, Hash Table, Math, Combinatorics</description></item><item><title>2965. 找出缺失和重复的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2965-find-missing-and-repeated-values/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2965-find-missing-and-repeated-values/</guid><description>Easy | Array, Hash Table, Math, Matrix</description></item><item><title>2966. 将数组按最大差值分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2966-divide-array-into-arrays-with-max-difference/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2966-divide-array-into-arrays-with-max-difference/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2967. 使数组成为等回文数组的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2967-minimum-cost-to-make-array-equalindromic/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2967-minimum-cost-to-make-array-equalindromic/</guid><description>Medium | Array, Math, Binary Search, Greedy, Sorting</description></item><item><title>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>2971. 寻找周长最大的多边形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2971-find-polygon-with-the-largest-perimeter/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2971-find-polygon-with-the-largest-perimeter/</guid><description>Medium | Array, Greedy, Sorting, Prefix Sum</description></item><item><title>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>2974. 最小数字游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2974-minimum-number-game/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2974-minimum-number-game/</guid><description>Easy | Array, Sorting, Heap (Priority Queue), Simulation</description></item><item><title>2975. 通过移除栅栏获得的最大正方形面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2975-maximum-square-area-by-removing-fences-from-a-field/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2975-maximum-square-area-by-removing-fences-from-a-field/</guid><description>Medium | Array, Hash Table, Enumeration</description></item><item><title>2976. 最小代价转换字符串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2976-minimum-cost-to-convert-string-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2976-minimum-cost-to-convert-string-i/</guid><description>Medium | Array, String, Graph Theory, Shortest Path</description></item><item><title>2977. 字符串转换的最小成本 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2977-minimum-cost-to-convert-string-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2977-minimum-cost-to-convert-string-ii/</guid><description>Hard | Array, String, Dynamic Programming, Graph Theory, Trie, Shortest Path</description></item><item><title>2980. 检查按位或运算是否有尾随零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2980-check-if-bitwise-or-has-trailing-zeros/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2980-check-if-bitwise-or-has-trailing-zeros/</guid><description>Easy | Array, Bit Manipulation</description></item><item><title>2983. 回文重新排列查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2983-palindrome-rearrangement-queries/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2983-palindrome-rearrangement-queries/</guid><description>Hard | Array, Hash Table, String, Prefix Sum</description></item><item><title>2996. 大于序列前缀和的最小缺失整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2996-smallest-missing-integer-greater-than-sequential-prefix-sum/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2996-smallest-missing-integer-greater-than-sequential-prefix-sum/</guid><description>Easy | Array, Hash Table, Sorting</description></item><item><title>2997. 使数组异或等于 K 的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2997-minimum-number-of-operations-to-make-array-xor-equal-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2997-minimum-number-of-operations-to-make-array-xor-equal-to-k/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>3000. 最长对角线矩形的最大面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3000-maximum-area-of-longest-diagonal-rectangle/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3000-maximum-area-of-longest-diagonal-rectangle/</guid><description>Easy | Array</description></item><item><title>3002. 移除后集合的最大大小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3002-maximum-size-of-a-set-after-removals/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3002-maximum-size-of-a-set-after-removals/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>3005. 统计最大频数的元素数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3005-count-elements-with-maximum-frequency/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3005-count-elements-with-maximum-frequency/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>3010. 将数组分割成最小代价的三个子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3010-divide-an-array-into-subarrays-with-minimum-cost-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3010-divide-an-array-into-subarrays-with-minimum-cost-i/</guid><description>Easy | Array, Sorting, Enumeration</description></item><item><title>3011. 判断数组是否可以排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3011-find-if-array-can-be-sorted/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3011-find-if-array-can-be-sorted/</guid><description>Medium | Array, Bit Manipulation, Sorting</description></item><item><title>3012. 使用操作最小化数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3012-minimize-length-of-array-using-operations/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3012-minimize-length-of-array-using-operations/</guid><description>Medium | Array, Math, Greedy, Number Theory</description></item><item><title>3020. 找到子集中的最大元素数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3020-find-the-maximum-number-of-elements-in-subset/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3020-find-the-maximum-number-of-elements-in-subset/</guid><description>Medium | Array, Hash Table, Enumeration</description></item><item><title>3022. 最小化剩余元素的按位或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3022-minimize-or-of-remaining-elements-using-operations/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3022-minimize-or-of-remaining-elements-using-operations/</guid><description>Hard | Array, Greedy, Bit Manipulation</description></item><item><title>3024. 三角形的类型</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3024-type-of-triangle/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3024-type-of-triangle/</guid><description>Easy | Array, Math, Sorting</description></item><item><title>3025. 找到放置人员的方案数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3025-find-the-number-of-ways-to-place-people-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3025-find-the-number-of-ways-to-place-people-i/</guid><description>Medium | Array, Math, Geometry, Sorting, Enumeration</description></item><item><title>3026. 最大好子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3026-maximum-good-subarray-sum/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3026-maximum-good-subarray-sum/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>3027. 找到放置人员的方案数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3027-find-the-number-of-ways-to-place-people-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3027-find-the-number-of-ways-to-place-people-ii/</guid><description>Hard | Array, Math, Geometry, Sorting, Enumeration</description></item><item><title>3028. 边界上的蚂蚁</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3028-ant-on-the-boundary/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3028-ant-on-the-boundary/</guid><description>Easy | Array, Simulation, Prefix Sum</description></item><item><title>3030. 找到区域平均值的网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3030-find-the-grid-of-region-average/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3030-find-the-grid-of-region-average/</guid><description>Medium | Array, Matrix</description></item><item><title>3033. 修改矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3033-modify-the-matrix/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3033-modify-the-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>3034. 匹配模式的子数组数目 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3034-number-of-subarrays-that-match-a-pattern-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3034-number-of-subarrays-that-match-a-pattern-i/</guid><description>Medium | Array, Rolling Hash, String Matching, Hash Function</description></item><item><title>3035. 操作后的最大回文数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3035-maximum-palindromes-after-operations/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3035-maximum-palindromes-after-operations/</guid><description>Medium | Array, Hash Table, String, Greedy, Sorting, Counting</description></item><item><title>3036. 匹配模式的子数组数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3036-number-of-subarrays-that-match-a-pattern-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3036-number-of-subarrays-that-match-a-pattern-ii/</guid><description>Hard | Array, Rolling Hash, String Matching, Hash Function</description></item><item><title>3038. 具有相同分数的最大操作数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3038-maximum-number-of-operations-with-the-same-score-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3038-maximum-number-of-operations-with-the-same-score-i/</guid><description>Easy | Array, Simulation</description></item><item><title>3039. 使字符串变空的操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3039-apply-operations-to-make-string-empty/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3039-apply-operations-to-make-string-empty/</guid><description>Medium | Array, Hash Table, Sorting, Counting</description></item><item><title>3040. 相同分数的最大操作数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3040-maximum-number-of-operations-with-the-same-score-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3040-maximum-number-of-operations-with-the-same-score-ii/</guid><description>Medium | Array, Dynamic Programming, Memoization</description></item><item><title>3041. 修改数组后的最大连续元素数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3041-maximize-consecutive-elements-in-an-array-after-modification/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3041-maximize-consecutive-elements-in-an-array-after-modification/</guid><description>Hard | Array, Dynamic Programming, Sorting</description></item><item><title>3042. 统计前缀和后缀对 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3042-count-prefix-and-suffix-pairs-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3042-count-prefix-and-suffix-pairs-i/</guid><description>Easy | Array, String, Trie, Rolling Hash, String Matching, Hash Function</description></item><item><title>3043. 寻找最长公共前缀的长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3043-find-the-length-of-the-longest-common-prefix/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3043-find-the-length-of-the-longest-common-prefix/</guid><description>Medium | Array, Hash Table, String, Trie</description></item><item><title>3044. 最频繁的质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3044-most-frequent-prime/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3044-most-frequent-prime/</guid><description>Medium | Array, Hash Table, Math, Matrix, Counting, Enumeration, Number Theory</description></item><item><title>3045. 统计前缀和后缀对 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3045-count-prefix-and-suffix-pairs-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3045-count-prefix-and-suffix-pairs-ii/</guid><description>Hard | Array, String, Trie, Rolling Hash, String Matching, Hash Function</description></item><item><title>3046. 分割数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3046-split-the-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3046-split-the-array/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>3047. 寻找两矩形内最大正方形面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3047-find-the-largest-area-of-square-inside-two-rectangles/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3047-find-the-largest-area-of-square-inside-two-rectangles/</guid><description>Medium | Array, Math, Geometry</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>3065. 超过阈值的最少操作数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3065-minimum-operations-to-exceed-threshold-value-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3065-minimum-operations-to-exceed-threshold-value-i/</guid><description>Easy | Array</description></item><item><title>3066. 使数组元素大于等于阈值的最小操作数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3066-minimum-operations-to-exceed-threshold-value-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3066-minimum-operations-to-exceed-threshold-value-ii/</guid><description>Medium | Array, Heap (Priority Queue), Simulation</description></item><item><title>3067. 加权树网络中可连接服务器对的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3067-count-pairs-of-connectable-servers-in-a-weighted-tree-network/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3067-count-pairs-of-connectable-servers-in-a-weighted-tree-network/</guid><description>Medium | Array, Tree, Depth-First Search</description></item><item><title>3068. 找到节点值的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3068-find-the-maximum-sum-of-node-values/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3068-find-the-maximum-sum-of-node-values/</guid><description>Hard | Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting</description></item><item><title>3069. 分发元素到两个数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3069-distribute-elements-into-two-arrays-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3069-distribute-elements-into-two-arrays-i/</guid><description>Easy | Array, Simulation</description></item><item><title>3070. 统计包含左上角元素且和小于等于k的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3070-count-submatrices-with-top-left-element-and-sum-less-than-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3070-count-submatrices-with-top-left-element-and-sum-less-than-k/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>3071. 在网格上写字母Y的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3071-minimum-operations-to-write-the-letter-y-on-a-grid/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3071-minimum-operations-to-write-the-letter-y-on-a-grid/</guid><description>Medium | Array, Hash Table, Matrix, Counting</description></item><item><title>3072. 将元素分配到两个数组中 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3072-distribute-elements-into-two-arrays-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3072-distribute-elements-into-two-arrays-ii/</guid><description>Hard | Array, Binary Indexed Tree, Segment Tree, Simulation</description></item><item><title>3074. 苹果重新分装到盒子里</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3074-apple-redistribution-into-boxes/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3074-apple-redistribution-into-boxes/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>3075. 选择儿童的最大幸福值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3075-maximize-happiness-of-selected-children/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3075-maximize-happiness-of-selected-children/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3076. 数组中最短的不同子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3076-shortest-uncommon-substring-in-an-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3076-shortest-uncommon-substring-in-an-array/</guid><description>Medium | Array, Hash Table, String, Trie</description></item><item><title>3077. K个不相交子数组的最大强度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3077-maximum-strength-of-k-disjoint-subarrays/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3077-maximum-strength-of-k-disjoint-subarrays/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3079. 加密整数的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3079-find-the-sum-of-encrypted-integers/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3079-find-the-sum-of-encrypted-integers/</guid><description>Easy | Array, Math</description></item><item><title>3080. 标记数组中的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3080-mark-elements-on-array-by-performing-queries/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3080-mark-elements-on-array-by-performing-queries/</guid><description>Medium | Array, Hash Table, Sorting, Heap (Priority Queue), Simulation</description></item><item><title>3082. 求所有子序列的幂之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3082-find-the-sum-of-the-power-of-all-subsequences/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3082-find-the-sum-of-the-power-of-all-subsequences/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>3086. 收集 K 个 1 的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3086-minimum-moves-to-pick-k-ones/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3086-minimum-moves-to-pick-k-ones/</guid><description>Hard | Array, Greedy, Sliding Window, Prefix Sum</description></item><item><title>3092. 最频繁的 IDs</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3092-most-frequent-ids/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3092-most-frequent-ids/</guid><description>Medium | Array, Hash Table, Heap (Priority Queue), Ordered Set</description></item><item><title>3093. 最长公共后缀查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3093-longest-common-suffix-queries/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3093-longest-common-suffix-queries/</guid><description>Hard | Array, String, Trie</description></item><item><title>3095. 或运算至少为 K 的最短子数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3095-shortest-subarray-with-or-at-least-k-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3095-shortest-subarray-with-or-at-least-k-i/</guid><description>Easy | Array, Bit Manipulation, Sliding Window</description></item><item><title>3096. 获得更多分数所需的最少层数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3096-minimum-levels-to-gain-more-points/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3096-minimum-levels-to-gain-more-points/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>3097. 与 K 至少相等的最短子数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3097-shortest-subarray-with-or-at-least-k-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3097-shortest-subarray-with-or-at-least-k-ii/</guid><description>Medium | Array, Bit Manipulation, Sliding Window</description></item><item><title>3098. 子序列能量之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3098-find-the-sum-of-subsequence-powers/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3098-find-the-sum-of-subsequence-powers/</guid><description>Hard | Array, Dynamic Programming, Sorting</description></item><item><title>3101. 计算交替子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3101-count-alternating-subarrays/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3101-count-alternating-subarrays/</guid><description>Medium | Array, Math</description></item><item><title>3102. 最小化曼哈顿距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3102-minimize-manhattan-distances/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3102-minimize-manhattan-distances/</guid><description>Hard | Array, Math, Geometry, Sorting, Ordered Set</description></item><item><title>3105. 最长严格递增或严格递减子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3105-longest-strictly-increasing-or-strictly-decreasing-subarray/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3105-longest-strictly-increasing-or-strictly-decreasing-subarray/</guid><description>Easy | Array</description></item><item><title>3107. 使数组中位数等于 K 的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3107-minimum-operations-to-make-median-of-array-equal-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3107-minimum-operations-to-make-median-of-array-equal-to-k/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3108. 加权图中的最小费用路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3108-minimum-cost-walk-in-weighted-graph/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3108-minimum-cost-walk-in-weighted-graph/</guid><description>Hard | Array, Bit Manipulation, Union-Find, Graph Theory</description></item><item><title>3111. 覆盖点的最小矩形数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3111-minimum-rectangles-to-cover-points/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3111-minimum-rectangles-to-cover-points/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3112. 访问消失节点的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3112-minimum-time-to-visit-disappearing-nodes/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3112-minimum-time-to-visit-disappearing-nodes/</guid><description>Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path</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>3115. 最大质数差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3115-maximum-prime-difference/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3115-maximum-prime-difference/</guid><description>Medium | Array, Math, Number Theory</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>3122. 满足条件的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3122-minimum-number-of-operations-to-satisfy-conditions/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3122-minimum-number-of-operations-to-satisfy-conditions/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3127. 构造相同颜色的正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3127-make-a-square-with-the-same-color/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3127-make-a-square-with-the-same-color/</guid><description>Easy | Array, Matrix, Enumeration</description></item><item><title>3128. 直角三角形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3128-right-triangles/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3128-right-triangles/</guid><description>Medium | Array, Hash Table, Math, Combinatorics, Counting</description></item><item><title>3131. 找到添加到数组 I 的整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3131-find-the-integer-added-to-array-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3131-find-the-integer-added-to-array-i/</guid><description>Easy | Array</description></item><item><title>3132. 找到数组中被加数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3132-find-the-integer-added-to-array-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3132-find-the-integer-added-to-array-ii/</guid><description>Medium | Array, Two Pointers, Sorting, Enumeration</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>3139. 使数组相等的最小开销</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3139-minimum-cost-to-equalize-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3139-minimum-cost-to-equalize-array/</guid><description>Hard | Array, Greedy, Enumeration</description></item><item><title>3142. 检查网格中的条件</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3142-check-if-grid-satisfies-conditions/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3142-check-if-grid-satisfies-conditions/</guid><description>Easy | Array, Matrix</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>3147. 从神秘地牢中获取最大能量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3147-taking-maximum-energy-from-the-mystic-dungeon/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3147-taking-maximum-energy-from-the-mystic-dungeon/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>3148. 网格中的最大差值得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3148-maximum-difference-score-in-a-grid/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3148-maximum-difference-score-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3149. 找到最小代价的数组排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3149-find-the-minimum-cost-array-permutation/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3149-find-the-minimum-cost-array-permutation/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Bitmask</description></item><item><title>3151. 特殊数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3151-special-array-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3151-special-array-i/</guid><description>Easy | Array</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>3153. 所有数对的数位差之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3153-sum-of-digit-differences-of-all-pairs/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3153-sum-of-digit-differences-of-all-pairs/</guid><description>Medium | Array, Hash Table, Math, Counting</description></item><item><title>3158. 找到出现两次的数字的异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3158-find-the-xor-of-numbers-which-appear-twice/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3158-find-the-xor-of-numbers-which-appear-twice/</guid><description>Easy | Array, Hash Table, Bit Manipulation</description></item><item><title>3159. 在数组中查找元素的第几次出现</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3159-find-occurrences-of-an-element-in-an-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3159-find-occurrences-of-an-element-in-an-array/</guid><description>Medium | Array, Hash Table</description></item><item><title>3160. 找出球的不同颜色数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3160-find-the-number-of-distinct-colors-among-the-balls/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3160-find-the-number-of-distinct-colors-among-the-balls/</guid><description>Medium | Array, Hash Table, Simulation</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>3162. 找出好数对的数目 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3162-find-the-number-of-good-pairs-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3162-find-the-number-of-good-pairs-i/</guid><description>Easy | Array, Hash Table</description></item><item><title>3164. 寻找好数对的数目 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3164-find-the-number-of-good-pairs-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3164-find-the-number-of-good-pairs-ii/</guid><description>Medium | Array, Hash Table</description></item><item><title>3165. 非相邻元素子序列的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3165-maximum-sum-of-subsequence-with-non-adjacent-elements/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3165-maximum-sum-of-subsequence-with-non-adjacent-elements/</guid><description>Hard | Array, Divide and Conquer, Dynamic Programming, Segment Tree</description></item><item><title>3169. 计算没有会议的天数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3169-count-days-without-meetings/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3169-count-days-without-meetings/</guid><description>Medium | Array, Sorting</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>3175. 找到第一个连续赢K场比赛的玩家</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3175-find-the-first-player-to-win-k-games-in-a-row/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3175-find-the-first-player-to-win-k-games-in-a-row/</guid><description>Medium | Array, Simulation</description></item><item><title>3176. 找到好子序列的最大长度 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3176-find-the-maximum-length-of-a-good-subsequence-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3176-find-the-maximum-length-of-a-good-subsequence-i/</guid><description>Medium | Array, Hash Table, Dynamic Programming</description></item><item><title>3177. 找到好子序列的最大长度 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3177-find-the-maximum-length-of-a-good-subsequence-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3177-find-the-maximum-length-of-a-good-subsequence-ii/</guid><description>Hard | Array, Hash Table, Dynamic Programming</description></item><item><title>3179. 找出第 K 秒后的第 N 个值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3179-find-the-n-th-value-after-k-seconds/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3179-find-the-n-th-value-after-k-seconds/</guid><description>Medium | Array, Math, Simulation, Combinatorics, Prefix Sum</description></item><item><title>3180. 使用操作获取最大总奖励 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3180-maximum-total-reward-using-operations-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3180-maximum-total-reward-using-operations-i/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3181. 使用操作的最大总奖励 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3181-maximum-total-reward-using-operations-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3181-maximum-total-reward-using-operations-ii/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation</description></item><item><title>3184. 构成整天的下标对数目 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3184-count-pairs-that-form-a-complete-day-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3184-count-pairs-that-form-a-complete-day-i/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>3185. 组成整天的配对数目 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3185-count-pairs-that-form-a-complete-day-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3185-count-pairs-that-form-a-complete-day-ii/</guid><description>Medium | Array, Hash Table, Counting</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>3187. 数组中的峰值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3187-peaks-in-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3187-peaks-in-array/</guid><description>Hard | Array, Binary Indexed Tree, Segment Tree</description></item><item><title>3190. 使所有数组元素都能被三整除的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3190-find-minimum-operations-to-make-all-elements-divisible-by-three/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3190-find-minimum-operations-to-make-all-elements-divisible-by-three/</guid><description>Easy | Array, Math</description></item><item><title>3191. 使二进制数组元素等于 1 的最小操作数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i/</guid><description>Medium | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum</description></item><item><title>3192. 使二进制数组元素全部等于 1 的最少操作次数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>3193. 统计逆序对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3193-count-the-number-of-inversions/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3193-count-the-number-of-inversions/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>3194. 最小和最大元素的最小平均值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3194-minimum-average-of-smallest-and-largest-elements/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3194-minimum-average-of-smallest-and-largest-elements/</guid><description>Easy | Array, Two Pointers, Sorting</description></item><item><title>3195. 寻找覆盖所有1的最小矩形面积 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3195-find-the-minimum-area-to-cover-all-ones-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3195-find-the-minimum-area-to-cover-all-ones-i/</guid><description>Medium | Array, Matrix</description></item><item><title>3196. 最大化交替子数组的总成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3196-maximize-total-cost-of-alternating-subarrays/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3196-maximize-total-cost-of-alternating-subarrays/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>3200. 三角形的最大高度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3200-maximum-height-of-a-triangle/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3200-maximum-height-of-a-triangle/</guid><description>Easy | Array, Enumeration</description></item><item><title>2643. 一的数量最多的行</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2643-row-with-maximum-ones/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2643-row-with-maximum-ones/</guid><description>Easy | Array, Matrix</description></item><item><title>2644. 寻找最大可整除性分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2644-find-the-maximum-divisibility-score/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2644-find-the-maximum-divisibility-score/</guid><description>Easy | Array</description></item><item><title>2646. 最小化旅行的价格总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2646-minimize-the-total-price-of-the-trips/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2646-minimize-the-total-price-of-the-trips/</guid><description>Hard | Array, Dynamic Programming, Tree, Depth-First Search, Graph Theory</description></item><item><title>2653. 滑动子数组美丽值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2653-sliding-subarray-beauty/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2653-sliding-subarray-beauty/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>2654. 使数组所有元素都等于 1 的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1/</guid><description>Medium | Array, Math, Number Theory</description></item><item><title>2656. 恰好使用 K 个元素求最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2656-maximum-sum-with-exactly-k-elements/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2656-maximum-sum-with-exactly-k-elements/</guid><description>Easy | Array, Greedy</description></item><item><title>2657. 两数组的前缀公共数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2657-find-the-prefix-common-array-of-two-arrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2657-find-the-prefix-common-array-of-two-arrays/</guid><description>Medium | Array, Hash Table, Bit Manipulation</description></item><item><title>2658. 网格中鱼的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2658-maximum-number-of-fish-in-a-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2658-maximum-number-of-fish-in-a-grid/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</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>2660. 确定保龄球游戏的获胜者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2660-determine-the-winner-of-a-bowling-game/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2660-determine-the-winner-of-a-bowling-game/</guid><description>Easy | Array, Simulation</description></item><item><title>2661. 第一个完全被涂色的行或列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2661-first-completely-painted-row-or-column/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2661-first-completely-painted-row-or-column/</guid><description>Medium | Array, Hash Table, Matrix</description></item><item><title>2662. 具有特殊道路的路径最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2662-minimum-cost-of-a-path-with-special-roads/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2662-minimum-cost-of-a-path-with-special-roads/</guid><description>Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path</description></item><item><title>2670. 找到不同差值数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2670-find-the-distinct-difference-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2670-find-the-distinct-difference-array/</guid><description>Easy | Array, Hash Table</description></item><item><title>2672. 相邻元素颜色相同的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2672-number-of-adjacent-elements-with-the-same-color/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2672-number-of-adjacent-elements-with-the-same-color/</guid><description>Medium | Array</description></item><item><title>2673. 使二叉树中所有路径的代价相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2673-make-costs-of-paths-equal-in-a-binary-tree/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2673-make-costs-of-paths-equal-in-a-binary-tree/</guid><description>Medium | Array, Dynamic Programming, Greedy, Tree, Binary Tree</description></item><item><title>2678. 老年人的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2678-number-of-senior-citizens/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2678-number-of-senior-citizens/</guid><description>Easy | Array, String</description></item><item><title>2679. 矩阵中的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2679-sum-in-a-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2679-sum-in-a-matrix/</guid><description>Medium | Array, Sorting, Heap (Priority Queue), Matrix, Simulation</description></item><item><title>2680. 最大或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2680-maximum-or/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2680-maximum-or/</guid><description>Medium | Array, Greedy, Bit Manipulation, Prefix Sum</description></item><item><title>2681. 英雄的力量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2681-power-of-heroes/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2681-power-of-heroes/</guid><description>Hard | Array, Math, Dynamic Programming, Sorting, Prefix Sum</description></item><item><title>2682. 找出环形游戏的失败者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2682-find-the-losers-of-the-circular-game/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2682-find-the-losers-of-the-circular-game/</guid><description>Easy | Array, Hash Table, Simulation</description></item><item><title>2683. 相邻位异或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2683-neighboring-bitwise-xor/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2683-neighboring-bitwise-xor/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>2684. 网格中的最大移动数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2684-maximum-number-of-moves-in-a-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2684-maximum-number-of-moves-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>2706. 购买两块巧克力</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2706-buy-two-chocolates/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2706-buy-two-chocolates/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>2707. 字符串中的额外字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2707-extra-characters-in-a-string/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2707-extra-characters-in-a-string/</guid><description>Medium | Array, Hash Table, String, Dynamic Programming, Trie</description></item><item><title>2708. 群体的最大强度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2708-maximum-strength-of-a-group/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2708-maximum-strength-of-a-group/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Greedy, Bit Manipulation, Sorting, Enumeration</description></item><item><title>2709. 最大公约数遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2709-greatest-common-divisor-traversal/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2709-greatest-common-divisor-traversal/</guid><description>Hard | Array, Math, Union-Find, Number Theory</description></item><item><title>2711. 对角线上不同值数量的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2711-difference-of-number-of-distinct-values-on-diagonals/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2711-difference-of-number-of-distinct-values-on-diagonals/</guid><description>Medium | Array, Hash Table, Matrix</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>2717. 半有序排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2717-semi-ordered-permutation/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2717-semi-ordered-permutation/</guid><description>Easy | Array, Simulation</description></item><item><title>2718. 查询后矩阵的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2718-sum-of-matrix-after-queries/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2718-sum-of-matrix-after-queries/</guid><description>Medium | Array, Hash Table</description></item><item><title>2731. 机器人运动</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2731-movement-of-robots/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2731-movement-of-robots/</guid><description>Medium | Array, Brainteaser, Sorting, Prefix Sum</description></item><item><title>2732. 找到矩阵的好子集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2732-find-a-good-subset-of-the-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2732-find-a-good-subset-of-the-matrix/</guid><description>Hard | Array, Hash Table, Bit Manipulation, Matrix</description></item><item><title>2733. 既不是最小值也不是最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2733-neither-minimum-nor-maximum/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2733-neither-minimum-nor-maximum/</guid><description>Easy | Array, Sorting</description></item><item><title>2735. 收集巧克力</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2735-collecting-chocolates/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2735-collecting-chocolates/</guid><description>Medium | Array, Enumeration</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>2740. 找出分割的值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2740-find-the-value-of-the-partition/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2740-find-the-value-of-the-partition/</guid><description>Medium | Array, Sorting</description></item><item><title>2741. 特殊排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2741-special-permutations/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2741-special-permutations/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation, Bitmask</description></item><item><title>2742. 粉刷房子的墙壁</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2742-painting-the-walls/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2742-painting-the-walls/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>2744. 找出字符串的最大配对数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2744-find-maximum-number-of-string-pairs/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2744-find-maximum-number-of-string-pairs/</guid><description>Easy | Array, Hash Table, String, Simulation</description></item><item><title>2746. 递减字符串连接</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2746-decremental-string-concatenation/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2746-decremental-string-concatenation/</guid><description>Medium | Array, String, Dynamic Programming</description></item><item><title>2747. 零请求服务器数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2747-count-zero-request-servers/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2747-count-zero-request-servers/</guid><description>Medium | Array, Hash Table, Sliding Window, Sorting</description></item><item><title>2748. 美丽对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2748-number-of-beautiful-pairs/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2748-number-of-beautiful-pairs/</guid><description>Easy | Array, Hash Table, Math, Counting, Number Theory</description></item><item><title>2750. 将数组拆分为若干好子数组的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2750-ways-to-split-array-into-good-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2750-ways-to-split-array-into-good-subarrays/</guid><description>Medium | Array, Math, Dynamic Programming</description></item><item><title>2751. 机器人碰撞</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2751-robot-collisions/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2751-robot-collisions/</guid><description>Hard | Array, Stack, Sorting, Simulation</description></item><item><title>2760. 满足阈值条件的最长奇偶子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2760-longest-even-odd-subarray-with-threshold/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2760-longest-even-odd-subarray-with-threshold/</guid><description>Easy | Array, Sliding Window</description></item><item><title>2761. 目标和的质数对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2761-prime-pairs-with-target-sum/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2761-prime-pairs-with-target-sum/</guid><description>Medium | Array, Math, Enumeration, Number Theory</description></item><item><title>2762. 连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2762-continuous-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2762-continuous-subarrays/</guid><description>Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue</description></item><item><title>2763. 所有子数组不平衡数字之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2763-sum-of-imbalance-numbers-of-all-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2763-sum-of-imbalance-numbers-of-all-subarrays/</guid><description>Hard | Array, Hash Table, Enumeration</description></item><item><title>2808. 均匀化圆形数组的最少秒数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2808-minimum-seconds-to-equalize-a-circular-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2808-minimum-seconds-to-equalize-a-circular-array/</guid><description>Medium | Array, Hash Table</description></item><item><title>2809. 使数组和小于等于 x 的最少时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2809-minimum-time-to-make-array-sum-at-most-x/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2809-minimum-time-to-make-array-sum-at-most-x/</guid><description>Hard | Array, Dynamic Programming, Sorting</description></item><item><title>2811. 检查是否可以拆分数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2811-check-if-it-is-possible-to-split-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2811-check-if-it-is-possible-to-split-array/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>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>2813. 最大 K 长度子序列的优雅度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2813-maximum-elegance-of-a-k-length-subsequence/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2813-maximum-elegance-of-a-k-length-subsequence/</guid><description>Hard | Array, Hash Table, Stack, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2815. 数组中的最大数对和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2815-max-pair-sum-in-an-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2815-max-pair-sum-in-an-array/</guid><description>Easy | Array, Hash Table</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>2818. 应用操作最大化分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/</guid><description>Hard | Array, Math, Stack, Greedy, Sorting, Monotonic Stack, Number Theory</description></item><item><title>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>2828. 检查字符串是否为单词数组的首字母缩略词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2828-check-if-a-string-is-an-acronym-of-words/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2828-check-if-a-string-is-an-acronym-of-words/</guid><description>Easy | Array, String</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>2835. 形成目标和子序列的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2835-minimum-operations-to-form-subsequence-with-target-sum/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2835-minimum-operations-to-form-subsequence-with-target-sum/</guid><description>Hard | Array, Greedy, Bit Manipulation</description></item><item><title>2836. 传球游戏中函数的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2836-maximize-value-of-function-in-a-ball-passing-game/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2836-maximize-value-of-function-in-a-ball-passing-game/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation</description></item><item><title>2841. 几乎唯一子数组的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2841-maximum-sum-of-almost-unique-subarray/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2841-maximum-sum-of-almost-unique-subarray/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>2845. 有趣子数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2845-count-of-interesting-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2845-count-of-interesting-subarrays/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>2846. 树中边权重均衡查询的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2846-minimum-edge-weight-equilibrium-queries-in-a-tree/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2846-minimum-edge-weight-equilibrium-queries-in-a-tree/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search</description></item><item><title>2848. 与汽车相交的点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2848-points-that-intersect-with-cars/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2848-points-that-intersect-with-cars/</guid><description>Easy | Array, Hash Table, Prefix Sum</description></item><item><title>2850. 将石头分散到网格中的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2850-minimum-moves-to-spread-stones-over-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2850-minimum-moves-to-spread-stones-over-grid/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Matrix, Bitmask</description></item><item><title>2855. 最少右移次数排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2855-minimum-right-shifts-to-sort-the-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2855-minimum-right-shifts-to-sort-the-array/</guid><description>Easy | Array</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>2857. 计算距离为k的点对数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2857-count-pairs-of-points-with-distance-k/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2857-count-pairs-of-points-with-distance-k/</guid><description>Medium | Array, Hash Table, Bit Manipulation</description></item><item><title>2859. K 个置位位数的索引对应元素的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2859-sum-of-values-at-indices-with-k-set-bits/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2859-sum-of-values-at-indices-with-k-set-bits/</guid><description>Easy | Array, Bit Manipulation</description></item><item><title>2860. 快乐的学生</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2860-happy-students/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2860-happy-students/</guid><description>Medium | Array, Sorting, Enumeration</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>2862. 完整子集的最大元素和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2862-maximum-element-sum-of-a-complete-subset-of-indices/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2862-maximum-element-sum-of-a-complete-subset-of-indices/</guid><description>Hard | Array, Math, Number Theory</description></item><item><title>2865. 美丽塔 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2865-beautiful-towers-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2865-beautiful-towers-i/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>2866. 美丽塔 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2866-beautiful-towers-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2866-beautiful-towers-ii/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>2869. 收集元素的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2869-minimum-operations-to-collect-elements/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2869-minimum-operations-to-collect-elements/</guid><description>Easy | Array, Hash Table, Bit Manipulation</description></item><item><title>2870. 使数组为空的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2870-minimum-number-of-operations-to-make-array-empty/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2870-minimum-number-of-operations-to-make-array-empty/</guid><description>Medium | Array, Hash Table, Greedy, Counting</description></item><item><title>2871. 将数组分割成最多数量的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2871-split-array-into-maximum-number-of-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2871-split-array-into-maximum-number-of-subarrays/</guid><description>Medium | Array, Greedy, Bit Manipulation</description></item><item><title>2873. 有序三元组的最大值 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2873-maximum-value-of-an-ordered-triplet-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2873-maximum-value-of-an-ordered-triplet-i/</guid><description>Easy | Array</description></item><item><title>2874. 有序三元组的最大值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2874-maximum-value-of-an-ordered-triplet-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2874-maximum-value-of-an-ordered-triplet-ii/</guid><description>Medium | Array</description></item><item><title>2875. 无限数组中的最小子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2875-minimum-size-subarray-in-infinite-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2875-minimum-size-subarray-in-infinite-array/</guid><description>Medium | Array, Hash Table, Sliding Window, Prefix Sum</description></item><item><title>2895. 最小处理时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2895-minimum-processing-time/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2895-minimum-processing-time/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2897. 对数组执行操作以最大化平方和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2897-apply-operations-on-array-to-maximize-sum-of-squares/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2897-apply-operations-on-array-to-maximize-sum-of-squares/</guid><description>Hard | Array, Hash Table, Greedy, Bit Manipulation</description></item><item><title>2899. 最后访问的整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2899-last-visited-integers/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2899-last-visited-integers/</guid><description>Easy | Array, Simulation</description></item><item><title>2900. 最长不等邻接分组子序列 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2900-longest-unequal-adjacent-groups-subsequence-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2900-longest-unequal-adjacent-groups-subsequence-i/</guid><description>Easy | Array, String, Dynamic Programming, Greedy</description></item><item><title>2901. 最长不相邻组子序列 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2901-longest-unequal-adjacent-groups-subsequence-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2901-longest-unequal-adjacent-groups-subsequence-ii/</guid><description>Medium | Array, String, Dynamic Programming</description></item><item><title>2902. 有界和的子多重集计数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2902-count-of-sub-multisets-with-bounded-sum/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2902-count-of-sub-multisets-with-bounded-sum/</guid><description>Hard | Array, Hash Table, Dynamic Programming, Sliding Window</description></item><item><title>2903. 查找满足索引和值差值条件的索引 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2903-find-indices-with-index-and-value-difference-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2903-find-indices-with-index-and-value-difference-i/</guid><description>Easy | Array, Two Pointers</description></item><item><title>2905. 找到满足索引和值差异的两个索引 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2905-find-indices-with-index-and-value-difference-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2905-find-indices-with-index-and-value-difference-ii/</guid><description>Medium | Array, Two Pointers</description></item><item><title>2906. 构造乘积矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2906-construct-product-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2906-construct-product-matrix/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2908. 山形三元组的最小和 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2908-minimum-sum-of-mountain-triplets-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2908-minimum-sum-of-mountain-triplets-i/</guid><description>Easy | Array</description></item><item><title>2909. 山脉三元组的最小和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2909-minimum-sum-of-mountain-triplets-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2909-minimum-sum-of-mountain-triplets-ii/</guid><description>Medium | Array</description></item><item><title>2910. 创建有效分组的最少组数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2910-minimum-number-of-groups-to-create-a-valid-assignment/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2910-minimum-number-of-groups-to-create-a-valid-assignment/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>2913. 子数组不同元素数目的平方和 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2913-subarrays-distinct-element-sum-of-squares-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2913-subarrays-distinct-element-sum-of-squares-i/</guid><description>Easy | Array, Hash Table</description></item><item><title>2915. 和为目标值且长度最长的子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2915-length-of-the-longest-subsequence-that-sums-to-target/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2915-length-of-the-longest-subsequence-that-sums-to-target/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>2916. 子数组不同元素数目的平方和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2916-subarrays-distinct-element-sum-of-squares-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2916-subarrays-distinct-element-sum-of-squares-ii/</guid><description>Hard | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree</description></item><item><title>2917. 找到数组的 K-or 值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2917-find-the-k-or-of-an-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2917-find-the-k-or-of-an-array/</guid><description>Easy | Array, Bit Manipulation</description></item><item><title>2918. 替换零后两数组的最小相等和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros/</guid><description>Medium | Array, Greedy</description></item><item><title>2919. 使数组美丽的最小增量操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2919-minimum-increment-operations-to-make-array-beautiful/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2919-minimum-increment-operations-to-make-array-beautiful/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>2920. 收集所有节点硬币后的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2920-maximum-points-after-collecting-coins-from-all-nodes/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2920-maximum-points-after-collecting-coins-from-all-nodes/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Memoization</description></item><item><title>2923. 找冠军 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2923-find-champion-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2923-find-champion-i/</guid><description>Easy | Array, Matrix</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>2931. 购买物品后的最大开销</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2931-maximum-spending-after-buying-items/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2931-maximum-spending-after-buying-items/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>2932. 最大强数对 XOR 值 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2932-maximum-strong-pair-xor-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2932-maximum-strong-pair-xor-i/</guid><description>Easy | Array, Hash Table, Bit Manipulation, Trie, Sliding Window</description></item><item><title>2933. 高频访问员工</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2933-high-access-employees/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2933-high-access-employees/</guid><description>Medium | Array, Hash Table, String, Sorting</description></item><item><title>2934. 使数组最后元素最大的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2934-minimum-operations-to-maximize-last-elements-in-arrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2934-minimum-operations-to-maximize-last-elements-in-arrays/</guid><description>Medium | Array, Enumeration</description></item><item><title>2935. 最大强数对异或值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2935-maximum-strong-pair-xor-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2935-maximum-strong-pair-xor-ii/</guid><description>Hard | Array, Hash Table, Bit Manipulation, Trie, Sliding Window</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>2942. 查找包含指定字符的单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2942-find-words-containing-character/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2942-find-words-containing-character/</guid><description>Easy | Array, String</description></item><item><title>2943. 最大化网格中正方形洞的面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2943-maximize-area-of-square-hole-in-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2943-maximize-area-of-square-hole-in-grid/</guid><description>Medium | Array, Sorting</description></item><item><title>2944. 购买水果需要的最少硬币数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2944-minimum-number-of-coins-for-fruits/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2944-minimum-number-of-coins-for-fruits/</guid><description>Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue</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>2946. 循环移位后的矩阵相似性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2946-matrix-similarity-after-cyclic-shifts/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2946-matrix-similarity-after-cyclic-shifts/</guid><description>Easy | Array, Math, Matrix, Simulation</description></item><item><title>2948. 通过交换元素使数组字典序最小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2948-make-lexicographically-smallest-array-by-swapping-elements/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2948-make-lexicographically-smallest-array-by-swapping-elements/</guid><description>Medium | Array, Union-Find, Sorting</description></item><item><title>2951. 找到峰值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2951-find-the-peaks/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2951-find-the-peaks/</guid><description>Easy | Array, Enumeration</description></item><item><title>2952. 需要添加的硬币的最小数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2952-minimum-number-of-coins-to-be-added/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2952-minimum-number-of-coins-to-be-added/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2954. 感染序列的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2954-count-the-number-of-infection-sequences/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2954-count-the-number-of-infection-sequences/</guid><description>Hard | Array, Math, Combinatorics</description></item><item><title>2956. 找到两个数组的公共元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2956-find-common-elements-between-two-arrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2956-find-common-elements-between-two-arrays/</guid><description>Easy | Array, Hash Table</description></item><item><title>2958. 频率不超过 K 的最长子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2958-length-of-longest-subarray-with-at-most-k-frequency/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2958-length-of-longest-subarray-with-at-most-k-frequency/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>2960. 计算测试后的设备数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2960-count-tested-devices-after-test-operations/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2960-count-tested-devices-after-test-operations/</guid><description>Easy | Array, Simulation, Counting</description></item><item><title>2001. 可互换矩形的组数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2001-number-of-pairs-of-interchangeable-rectangles/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2001-number-of-pairs-of-interchangeable-rectangles/</guid><description>Medium | Array, Hash Table, Math, Counting, Number Theory</description></item><item><title>2003. 每个子树内缺失的最小遗传值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2003-smallest-missing-genetic-value-in-each-subtree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2003-smallest-missing-genetic-value-in-each-subtree/</guid><description>Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Find</description></item><item><title>2007. 从双倍数组中还原原始数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2007-find-original-array-from-doubled-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2007-find-original-array-from-doubled-array/</guid><description>Medium | Array, Hash Table, Greedy, Sorting</description></item><item><title>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>2011. 执行操作后的变量最终值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2011-final-value-of-variable-after-performing-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2011-final-value-of-variable-after-performing-operations/</guid><description>Easy | Array, String, Simulation</description></item><item><title>2012. 数组中的美丽值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2012-sum-of-beauty-in-the-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2012-sum-of-beauty-in-the-array/</guid><description>Medium | Array</description></item><item><title>2013. 检测正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2013-detect-squares/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2013-detect-squares/</guid><description>Medium | Array, Hash Table, Design, Counting, Data Stream</description></item><item><title>2016. 递增元素间的最大差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2016-maximum-difference-between-increasing-elements/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2016-maximum-difference-between-increasing-elements/</guid><description>Easy | Array</description></item><item><title>2017. 网格游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2017-grid-game/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2017-grid-game/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2022. 将一维数组转换为二维数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2022-convert-1d-array-into-2d-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2022-convert-1d-array-into-2d-array/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>2028. 找出缺失的观测数据</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2028-find-missing-observations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2028-find-missing-observations/</guid><description>Medium | Array, Math, Simulation</description></item><item><title>2029. 石子游戏 IX</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2029-stone-game-ix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2029-stone-game-ix/</guid><description>Medium | Array, Math, Greedy, Counting, Game Theory</description></item><item><title>2032. 三个数组中的两个</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2032-two-out-of-three/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2032-two-out-of-three/</guid><description>Easy | Array, Hash Table, Bit Manipulation</description></item><item><title>2033. 使网格化为等值网格的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2033-minimum-operations-to-make-a-uni-value-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2033-minimum-operations-to-make-a-uni-value-grid/</guid><description>Medium | Array, Math, Sorting, Matrix</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>2037. 让每个学生都有座位的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2037-minimum-number-of-moves-to-seat-everyone/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2037-minimum-number-of-moves-to-seat-everyone/</guid><description>Easy | Array, Greedy, Sorting, Counting Sort</description></item><item><title>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>2043. 简单银行系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2043-simple-bank-system/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2043-simple-bank-system/</guid><description>Medium | Array, Hash Table, Design, Simulation</description></item><item><title>2044. 统计按位或能得到最大值的子集数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2044-count-number-of-maximum-bitwise-or-subsets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2044-count-number-of-maximum-bitwise-or-subsets/</guid><description>Medium | Array, Backtracking, Bit Manipulation, Enumeration</description></item><item><title>2049. 统计最高分的节点数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2049-count-nodes-with-the-highest-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2049-count-nodes-with-the-highest-score/</guid><description>Medium | Array, Tree, Depth-First Search, Binary Tree</description></item><item><title>2050. 并行课程 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2050-parallel-courses-iii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2050-parallel-courses-iii/</guid><description>Hard | Array, Dynamic Programming, Graph Theory, Topological Sort</description></item><item><title>2053. 数组中的第 K 个不同字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2053-kth-distinct-string-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2053-kth-distinct-string-in-an-array/</guid><description>Easy | Array, Hash Table, String, Counting</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>2056. 棋盘上有效移动组合的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2056-number-of-valid-move-combinations-on-chessboard/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2056-number-of-valid-move-combinations-on-chessboard/</guid><description>Hard | Array, String, Backtracking, Simulation</description></item><item><title>2057. 数值等于下标的最小下标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2057-smallest-index-with-equal-value/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2057-smallest-index-with-equal-value/</guid><description>Easy | Array</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>2065. 图中的最大路径质量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2065-maximum-path-quality-of-a-graph/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2065-maximum-path-quality-of-a-graph/</guid><description>Hard | Array, Backtracking, Graph Theory</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>2073. 买票需要的时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2073-time-needed-to-buy-tickets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2073-time-needed-to-buy-tickets/</guid><description>Easy | Array, Queue, Simulation</description></item><item><title>2078. 两栋不同颜色房屋的最大距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2078-two-furthest-houses-with-different-colors/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2078-two-furthest-houses-with-different-colors/</guid><description>Easy | Array, Greedy</description></item><item><title>2079. 浇水植物</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2079-watering-plants/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2079-watering-plants/</guid><description>Medium | Array, Simulation</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>2085. 统计出现一次的公共字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2085-count-common-words-with-one-occurrence/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2085-count-common-words-with-one-occurrence/</guid><description>Easy | Array, Hash Table, String, Counting</description></item><item><title>2087. 网格中机器人的最小代价回家路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2087-minimum-cost-homecoming-of-a-robot-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2087-minimum-cost-homecoming-of-a-robot-in-a-grid/</guid><description>Medium | Array, Greedy</description></item><item><title>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>2090. K 半径子数组平均值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2090-k-radius-subarray-averages/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2090-k-radius-subarray-averages/</guid><description>Medium | Array, Sliding Window</description></item><item><title>2091. 移除数组中的最小值和最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2091-removing-minimum-and-maximum-from-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2091-removing-minimum-and-maximum-from-array/</guid><description>Medium | Array, Greedy</description></item><item><title>2094. 寻找三位偶数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2094-finding-3-digit-even-numbers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2094-finding-3-digit-even-numbers/</guid><description>Easy | Array, Hash Table, Recursion, Sorting, Enumeration</description></item><item><title>2097. 有效数对排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2097-valid-arrangement-of-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2097-valid-arrangement-of-pairs/</guid><description>Hard | Array, Depth-First Search, Graph Theory, Eulerian Circuit</description></item><item><title>2099. 找到长度为 K 且和最大的子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2099-find-subsequence-of-length-k-with-the-largest-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2099-find-subsequence-of-length-k-with-the-largest-sum/</guid><description>Easy | Array, Hash Table, Sorting, Heap (Priority Queue)</description></item><item><title>2100. 找到抢银行的好日子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2100-find-good-days-to-rob-the-bank/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2100-find-good-days-to-rob-the-bank/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>2101. 引爆最多的炸弹</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2101-detonate-the-maximum-bombs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2101-detonate-the-maximum-bombs/</guid><description>Medium | Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry</description></item><item><title>2104. 子数组范围之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2104-sum-of-subarray-ranges/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2104-sum-of-subarray-ranges/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>2105. 给植物浇水 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2105-watering-plants-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2105-watering-plants-ii/</guid><description>Medium | Array, Two Pointers, Simulation</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>2108. 找到数组中第一个回文字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2108-find-first-palindromic-string-in-the-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2108-find-first-palindromic-string-in-the-array/</guid><description>Easy | Array, Two Pointers, String</description></item><item><title>2109. 给字符串添加空格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2109-adding-spaces-to-a-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2109-adding-spaces-to-a-string/</guid><description>Medium | Array, Two Pointers, String, Simulation</description></item><item><title>2110. 股票的平滑下降阶段数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2110-number-of-smooth-descent-periods-of-a-stock/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2110-number-of-smooth-descent-periods-of-a-stock/</guid><description>Medium | Array, Math, Two Pointers, Dynamic Programming, Sliding Window</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>2115. 从给定原料中找到所有可能的食谱</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2115-find-all-possible-recipes-from-given-supplies/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2115-find-all-possible-recipes-from-given-supplies/</guid><description>Medium | Array, Hash Table, String, Graph Theory, Topological Sort</description></item><item><title>2121. 相同元素间的间隔</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2121-intervals-between-identical-elements/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2121-intervals-between-identical-elements/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>2122. 恢复原数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2122-recover-the-original-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2122-recover-the-original-array/</guid><description>Hard | Array, Hash Table, Two Pointers, Sorting, Enumeration</description></item><item><title>2126. 摧毁小行星</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2126-destroying-asteroids/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2126-destroying-asteroids/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2127. 可以被邀请参加会议的最多员工数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2127-maximum-employees-to-be-invited-to-a-meeting/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2127-maximum-employees-to-be-invited-to-a-meeting/</guid><description>Hard | Array, Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort</description></item><item><title>2131. 通过连接两字母单词构造最长回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2131-longest-palindrome-by-concatenating-two-letter-words/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2131-longest-palindrome-by-concatenating-two-letter-words/</guid><description>Medium | Array, Hash Table, String, Greedy, Counting</description></item><item><title>2133. 检查每一行和每一列是否都包含全部整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2133-check-if-every-row-and-column-contains-all-numbers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2133-check-if-every-row-and-column-contains-all-numbers/</guid><description>Easy | Array, Hash Table, Matrix</description></item><item><title>2134. 使所有1聚集在一起的最少交换次数II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2134-minimum-swaps-to-group-all-1s-together-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2134-minimum-swaps-to-group-all-1s-together-ii/</guid><description>Medium | Array, Sliding Window</description></item><item><title>2135. 添加一个字母后得到单词的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2135-count-words-obtained-after-adding-a-letter/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2135-count-words-obtained-after-adding-a-letter/</guid><description>Medium | Array, Hash Table, String, Bit Manipulation, Sorting</description></item><item><title>2136. 最早盛开的日子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2136-earliest-possible-day-of-full-bloom/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2136-earliest-possible-day-of-full-bloom/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>2140. 用脑力解决问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2140-solving-questions-with-brainpower/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2140-solving-questions-with-brainpower/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>2144. 打折买糖果的最小开销</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2144-minimum-cost-of-buying-candies-with-discount/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2144-minimum-cost-of-buying-candies-with-discount/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>2145. 统计隐藏序列的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2145-count-the-hidden-sequences/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2145-count-the-hidden-sequences/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>2148. 统计既有严格较小元素又有严格较大元素的元素数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2148-count-elements-with-strictly-smaller-and-greater-elements/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2148-count-elements-with-strictly-smaller-and-greater-elements/</guid><description>Easy | Array, Sorting, Counting</description></item><item><title>2149. 按符号重排数组元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2149-rearrange-array-elements-by-sign/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2149-rearrange-array-elements-by-sign/</guid><description>Medium | Array, Two Pointers, Simulation</description></item><item><title>2150. 找出数组中所有孤独数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2150-find-all-lonely-numbers-in-the-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2150-find-all-lonely-numbers-in-the-array/</guid><description>Medium | Array, Hash Table, Counting</description></item><item><title>2154. 保持找到的值乘以二</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2154-keep-multiplying-found-values-by-two/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2154-keep-multiplying-found-values-by-two/</guid><description>Easy | Array, Hash Table, Sorting, Simulation</description></item><item><title>2155. 二进制数组的最高分割分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2155-all-divisions-with-the-highest-score-of-a-binary-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2155-all-divisions-with-the-highest-score-of-a-binary-array/</guid><description>Medium | Array</description></item><item><title>2157. 字符串分组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2157-groups-of-strings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2157-groups-of-strings/</guid><description>Hard | Array, Hash Table, String, Bit Manipulation, Union-Find</description></item><item><title>2161. 根据给定基准值分割数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2161-partition-array-according-to-given-pivot/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2161-partition-array-according-to-given-pivot/</guid><description>Medium | Array, Two Pointers, Simulation</description></item><item><title>2164. 按奇偶性独立排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2164-sort-even-and-odd-indices-independently/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2164-sort-even-and-odd-indices-independently/</guid><description>Easy | Array, Sorting</description></item><item><title>2166. 设计位集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2166-design-bitset/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2166-design-bitset/</guid><description>Medium | Array, Hash Table, String, Design</description></item><item><title>2170. 使数组交替的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2170-minimum-operations-to-make-the-array-alternating/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2170-minimum-operations-to-make-the-array-alternating/</guid><description>Medium | Array, Hash Table, Greedy, Counting</description></item><item><title>2171. 移除魔法豆的最小数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2171-removing-minimum-number-of-magic-beans/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2171-removing-minimum-number-of-magic-beans/</guid><description>Medium | Array, Greedy, Sorting, Enumeration, Prefix Sum</description></item><item><title>2172. 数组的最大与和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2172-maximum-and-sum-of-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2172-maximum-and-sum-of-array/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Bitmask</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>2183. 统计被 K 整除的下标对数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2183-count-array-pairs-divisible-by-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2183-count-array-pairs-divisible-by-k/</guid><description>Hard | Array, Hash Table, Math, Counting, Number Theory</description></item><item><title>2185. 统计包含给定前缀的字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2185-counting-words-with-a-given-prefix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2185-counting-words-with-a-given-prefix/</guid><description>Easy | Array, String, String Matching</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>2190. 数组中跟在 key 后面的最频繁数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2190-most-frequent-number-following-key-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2190-most-frequent-number-following-key-in-an-array/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>2191. 排序混乱的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2191-sort-the-jumbled-numbers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2191-sort-the-jumbled-numbers/</guid><description>Medium | Array, Sorting</description></item><item><title>2195. 用最小和添加K个整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2195-append-k-integers-with-minimal-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2195-append-k-integers-with-minimal-sum/</guid><description>Medium | Array, Math, Greedy, Sorting</description></item><item><title>2196. 根据描述创建二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2196-create-binary-tree-from-descriptions/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2196-create-binary-tree-from-descriptions/</guid><description>Medium | Array, Hash Table, Tree, Binary Tree</description></item><item><title>2197. 替换数组中的非互质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2197-replace-non-coprime-numbers-in-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2197-replace-non-coprime-numbers-in-array/</guid><description>Hard | Array, Math, Stack, Number Theory</description></item><item><title>2200. 找出数组中所有 K 近邻下标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2200-find-all-k-distant-indices-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2200-find-all-k-distant-indices-in-an-array/</guid><description>Easy | Array, Two Pointers</description></item><item><title>2201. 统计可以提取的文物数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2201-count-artifacts-that-can-be-extracted/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2201-count-artifacts-that-can-be-extracted/</guid><description>Medium | Array, Hash Table, Simulation</description></item><item><title>2202. K 次操作后最大化栈顶元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2202-maximize-the-topmost-element-after-k-moves/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2202-maximize-the-topmost-element-after-k-moves/</guid><description>Medium | Array, Greedy</description></item><item><title>2206. 将数组分成相等的对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2206-divide-array-into-equal-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2206-divide-array-into-equal-pairs/</guid><description>Easy | Array, Hash Table, Bit Manipulation, Counting</description></item><item><title>2208. 数组元素减半的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2208-minimum-operations-to-halve-array-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2208-minimum-operations-to-halve-array-sum/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>2210. 统计数组中山峰和山谷的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2210-count-hills-and-valleys-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2210-count-hills-and-valleys-in-an-array/</guid><description>Easy | Array</description></item><item><title>2212. 射箭比赛中的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2212-maximum-points-in-an-archery-competition/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2212-maximum-points-in-an-archery-competition/</guid><description>Medium | Array, Backtracking, Bit Manipulation, Enumeration</description></item><item><title>2213. 单一重复字符的最长子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2213-longest-substring-of-one-repeating-character/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2213-longest-substring-of-one-repeating-character/</guid><description>Hard | Array, String, Segment Tree, Ordered Set</description></item><item><title>2215. 找出两个数组的不同</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2215-find-the-difference-of-two-arrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2215-find-the-difference-of-two-arrays/</guid><description>Easy | Array, Hash Table</description></item><item><title>2216. 使数组变美丽的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2216-minimum-deletions-to-make-array-beautiful/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2216-minimum-deletions-to-make-array-beautiful/</guid><description>Medium | Array, Stack, Greedy</description></item><item><title>2217. 查找指定长度的回文数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2217-find-palindrome-with-fixed-length/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2217-find-palindrome-with-fixed-length/</guid><description>Medium | Array, Math</description></item><item><title>2218. 从数组中取 K 个硬币的最大价值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2218-maximum-value-of-k-coins-from-piles/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2218-maximum-value-of-k-coins-from-piles/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>2221. 数组的三角和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2221-find-triangular-sum-of-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2221-find-triangular-sum-of-an-array/</guid><description>Medium | Array, Math, Simulation, Combinatorics, Number Theory</description></item><item><title>2225. 找出输掉零场或一场比赛的玩家</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2225-find-players-with-zero-or-one-losses/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2225-find-players-with-zero-or-one-losses/</guid><description>Medium | Array, Hash Table, Sorting, Counting</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>2227. 加密和解密字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2227-encrypt-and-decrypt-strings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2227-encrypt-and-decrypt-strings/</guid><description>Hard | Array, Hash Table, String, Design, Trie</description></item><item><title>2234. 花园的最大总美丽值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2234-maximum-total-beauty-of-the-gardens/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2234-maximum-total-beauty-of-the-gardens/</guid><description>Hard | Array, Two Pointers, Binary Search, Greedy, Sorting, Enumeration, Prefix Sum</description></item><item><title>2241. 设计ATM机器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2241-design-an-atm-machine/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2241-design-an-atm-machine/</guid><description>Medium | Array, Greedy, Design</description></item><item><title>2244. 完成所有任务的最少轮数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2244-minimum-rounds-to-complete-all-tasks/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2244-minimum-rounds-to-complete-all-tasks/</guid><description>Medium | Array, Hash Table, Greedy, Counting</description></item><item><title>2245. 拐弯路径的最大尾随零数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2245-maximum-trailing-zeros-in-a-cornered-path/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2245-maximum-trailing-zeros-in-a-cornered-path/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2246. 相邻字符不同的最长路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2246-longest-path-with-different-adjacent-characters/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2246-longest-path-with-different-adjacent-characters/</guid><description>Hard | Array, String, Tree, Depth-First Search, Graph Theory, Topological Sort</description></item><item><title>2248. 多个数组的交集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2248-intersection-of-multiple-arrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2248-intersection-of-multiple-arrays/</guid><description>Easy | Array, Hash Table, Sorting, Counting</description></item><item><title>2249. 计算圆内格点数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2249-count-lattice-points-inside-a-circle/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2249-count-lattice-points-inside-a-circle/</guid><description>Medium | Array, Hash Table, Math, Geometry, Enumeration</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>2255. 统计给定字符串的前缀数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2255-count-prefixes-of-a-given-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2255-count-prefixes-of-a-given-string/</guid><description>Easy | Array, String</description></item><item><title>2256. 最小平均差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2256-minimum-average-difference/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2256-minimum-average-difference/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>2260. 拿起连续卡牌的最小数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2260-minimum-consecutive-cards-to-pick-up/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2260-minimum-consecutive-cards-to-pick-up/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>2267. 检查是否存在有效的括号字符串路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2267-check-if-there-is-a-valid-parentheses-string-path/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2267-check-if-there-is-a-valid-parentheses-string-path/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>2270. 分割数组的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2270-number-of-ways-to-split-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2270-number-of-ways-to-split-array/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>2271. 地毯覆盖的最多白色瓷砖数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2271-maximum-white-tiles-covered-by-a-carpet/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2271-maximum-white-tiles-covered-by-a-carpet/</guid><description>Medium | Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum</description></item><item><title>2273. 移除字母异位词后的结果数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2273-find-resultant-array-after-removing-anagrams/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2273-find-resultant-array-after-removing-anagrams/</guid><description>Easy | Array, Hash Table, String, Sorting</description></item><item><title>2274. 没有特殊楼层的最大连续楼层数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2274-maximum-consecutive-floors-without-special-floors/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2274-maximum-consecutive-floors-without-special-floors/</guid><description>Medium | Array, Sorting</description></item><item><title>2275. 按位与结果大于零的最大组合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2275-largest-combination-with-bitwise-and-greater-than-zero/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2275-largest-combination-with-bitwise-and-greater-than-zero/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Counting</description></item><item><title>2279. 装满石头的袋子的最大数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2279-maximum-bags-with-full-capacity-of-rocks/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2279-maximum-bags-with-full-capacity-of-rocks/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2280. 表示折线图所需的最少线段数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2280-minimum-lines-to-represent-a-line-chart/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2280-minimum-lines-to-represent-a-line-chart/</guid><description>Medium | Array, Math, Geometry, Sorting, Number Theory</description></item><item><title>2281. 巫师的总力量之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2281-sum-of-total-strength-of-wizards/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2281-sum-of-total-strength-of-wizards/</guid><description>Hard | Array, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>2289. 使数组非递减的步数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2289-steps-to-make-array-non-decreasing/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2289-steps-to-make-array-non-decreasing/</guid><description>Medium | Array, Linked List, Dynamic Programming, Stack, Monotonic Stack, Simulation</description></item><item><title>2290. 到达角落的最少障碍移除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/</guid><description>Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>2294. 分割数组使得最大差值为K</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2294-partition-array-such-that-maximum-difference-is-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2294-partition-array-such-that-maximum-difference-is-k/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2295. 替换数组中的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2295-replace-elements-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2295-replace-elements-in-an-array/</guid><description>Medium | Array, Hash Table, Simulation</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>2303. 计算应缴税款</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2303-calculate-amount-paid-in-taxes/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2303-calculate-amount-paid-in-taxes/</guid><description>Easy | Array, Simulation</description></item><item><title>2304. 网格中的最小路径代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2304-minimum-path-cost-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2304-minimum-path-cost-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>2305. 公平分发饼干</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2305-fair-distribution-of-cookies/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2305-fair-distribution-of-cookies/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask</description></item><item><title>2306. 公司命名</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2306-naming-a-company/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2306-naming-a-company/</guid><description>Hard | Array, Hash Table, String, Bit Manipulation, Enumeration</description></item><item><title>2312. 出售木材块</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2312-selling-pieces-of-wood/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2312-selling-pieces-of-wood/</guid><description>Hard | Array, Dynamic Programming, Memoization</description></item><item><title>2317. 操作后的最大异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2317-maximum-xor-after-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2317-maximum-xor-after-operations/</guid><description>Medium | Array, Math, Bit Manipulation</description></item><item><title>2321. 拼接数组的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2321-maximum-score-of-spliced-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2321-maximum-score-of-spliced-array/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>2322. 移除树中边的最小分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2322-minimum-score-after-removals-on-a-tree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2322-minimum-score-after-removals-on-a-tree/</guid><description>Hard | Array, Bit Manipulation, Tree, Depth-First Search</description></item><item><title>2326. 螺旋矩阵 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2326-spiral-matrix-iv/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2326-spiral-matrix-iv/</guid><description>Medium | Array, Linked List, Matrix, Simulation</description></item><item><title>2328. 网格中递增路径的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2328-number-of-increasing-paths-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2328-number-of-increasing-paths-in-a-grid/</guid><description>Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix</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>2334. 元素大于变化阈值的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2334-subarray-with-elements-greater-than-varying-threshold/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2334-subarray-with-elements-greater-than-varying-threshold/</guid><description>Hard | Array, Stack, Union-Find, Monotonic Stack</description></item><item><title>2335. 装满杯子需要的最短总时长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2335-minimum-amount-of-time-to-fill-cups/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2335-minimum-amount-of-time-to-fill-cups/</guid><description>Easy | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2341. 数组中数对的最大数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2341-maximum-number-of-pairs-in-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2341-maximum-number-of-pairs-in-array/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>2342. 数位和相等数对的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2342-max-sum-of-a-pair-with-equal-sum-of-digits/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2342-max-sum-of-a-pair-with-equal-sum-of-digits/</guid><description>Medium | Array, Hash Table, Sorting, Heap (Priority Queue)</description></item><item><title>2343. 查询第 K 小的裁剪数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2343-query-kth-smallest-trimmed-number/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2343-query-kth-smallest-trimmed-number/</guid><description>Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Radix Sort, Quickselect</description></item><item><title>2344. 最少删除使数组可被整除</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2344-minimum-deletions-to-make-array-divisible/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2344-minimum-deletions-to-make-array-divisible/</guid><description>Hard | Array, Math, Sorting, Heap (Priority Queue), Number Theory</description></item><item><title>2347. 最佳扑克手牌</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2347-best-poker-hand/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2347-best-poker-hand/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>2348. 全零子数组的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2348-number-of-zero-filled-subarrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2348-number-of-zero-filled-subarrays/</guid><description>Medium | Array, Math</description></item><item><title>2350. 最短不可能的掷骰子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2350-shortest-impossible-sequence-of-rolls/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2350-shortest-impossible-sequence-of-rolls/</guid><description>Hard | Array, Hash Table, Greedy</description></item><item><title>2352. 相等行列对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2352-equal-row-and-column-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2352-equal-row-and-column-pairs/</guid><description>Medium | Array, Hash Table, Matrix, Simulation</description></item><item><title>2353. 设计食物评分系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2353-design-a-food-rating-system/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2353-design-a-food-rating-system/</guid><description>Medium | Array, Hash Table, String, Design, Heap (Priority Queue), Ordered Set</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>2357. 通过减去相等数量使数组归零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2357-make-array-zero-by-subtracting-equal-amounts/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2357-make-array-zero-by-subtracting-equal-amounts/</guid><description>Easy | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Simulation</description></item><item><title>2358. 进入比赛的最大小组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2358-maximum-number-of-groups-entering-a-competition/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2358-maximum-number-of-groups-entering-a-competition/</guid><description>Medium | Array, Math, Binary Search, Greedy</description></item><item><title>2363. 合并相似的物品</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2363-merge-similar-items/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2363-merge-similar-items/</guid><description>Easy | Array, Hash Table, Sorting, Ordered Set</description></item><item><title>2364. 统计坏数对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2364-count-number-of-bad-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2364-count-number-of-bad-pairs/</guid><description>Medium | Array, Hash Table, Math, Counting</description></item><item><title>2365. 任务调度 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2365-task-scheduler-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2365-task-scheduler-ii/</guid><description>Medium | Array, Hash Table, Simulation</description></item><item><title>2366. 排序数组的最少替换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2366-minimum-replacements-to-sort-the-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2366-minimum-replacements-to-sort-the-array/</guid><description>Hard | Array, Math, Greedy</description></item><item><title>2367. 算术三元组的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2367-number-of-arithmetic-triplets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2367-number-of-arithmetic-triplets/</guid><description>Easy | Array, Hash Table, Two Pointers, Enumeration</description></item><item><title>2368. 有限制的可达节点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2368-reachable-nodes-with-restrictions/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2368-reachable-nodes-with-restrictions/</guid><description>Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</description></item><item><title>2369. 检查是否存在有效的数组划分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2369-check-if-there-is-a-valid-partition-for-the-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2369-check-if-there-is-a-valid-partition-for-the-array/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>2373. 矩阵中的局部最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2373-largest-local-values-in-a-matrix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2373-largest-local-values-in-a-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>2381. 移位字符串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2381-shifting-letters-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2381-shifting-letters-ii/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>2382. 删除后的最大线段和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/</guid><description>Hard | Array, Union-Find, Prefix Sum, Ordered Set</description></item><item><title>2383. 赢得比赛所需的最少训练时长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2383-minimum-hours-of-training-to-win-a-competition/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2383-minimum-hours-of-training-to-win-a-competition/</guid><description>Easy | Array, Greedy</description></item><item><title>2386. 数组的第K大元素和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2386-find-the-k-sum-of-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2386-find-the-k-sum-of-an-array/</guid><description>Hard | Array, Sorting, Heap (Priority Queue)</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>2395. 寻找和相等的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2395-find-subarrays-with-equal-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2395-find-subarrays-with-equal-sum/</guid><description>Easy | Array, Hash Table</description></item><item><title>2399. 检查相同字母间的距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2399-check-distances-between-same-letters/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2399-check-distances-between-same-letters/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>2401. 最长优美子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2401-longest-nice-subarray/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2401-longest-nice-subarray/</guid><description>Medium | Array, Bit Manipulation, Sliding Window</description></item><item><title>2402. 会议室 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2402-meeting-rooms-iii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2402-meeting-rooms-iii/</guid><description>Hard | Array, Hash Table, Sorting, Heap (Priority Queue), Simulation</description></item><item><title>2404. 最频繁的偶数元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2404-most-frequent-even-element/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2404-most-frequent-even-element/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>2406. 将区间分为最少组数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2406-divide-intervals-into-minimum-number-of-groups/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2406-divide-intervals-into-minimum-number-of-groups/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum</description></item><item><title>2407. 最长递增子序列 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/</guid><description>Hard | Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queue</description></item><item><title>2410. 玩家和训练师的最大匹配数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2410-maximum-matching-of-players-with-trainers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2410-maximum-matching-of-players-with-trainers/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>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>2412. 交易前所需的最少资金</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2412-minimum-money-required-before-transactions/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2412-minimum-money-required-before-transactions/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>2416. 字符串的前缀分数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2416-sum-of-prefix-scores-of-strings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2416-sum-of-prefix-scores-of-strings/</guid><description>Hard | Array, String, Trie, Counting</description></item><item><title>2418. 按身高排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2418-sort-the-people/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2418-sort-the-people/</guid><description>Easy | Array, Hash Table, String, Sorting</description></item><item><title>2419. 最大按位与的最长子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2419-longest-subarray-with-maximum-bitwise-and/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2419-longest-subarray-with-maximum-bitwise-and/</guid><description>Medium | Array, Bit Manipulation, Brainteaser</description></item><item><title>2420. 找到所有好下标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2420-find-all-good-indices/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2420-find-all-good-indices/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>2421. 好路径的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2421-number-of-good-paths/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2421-number-of-good-paths/</guid><description>Hard | Array, Hash Table, Tree, Union-Find, Graph Theory, Sorting</description></item><item><title>2425. 所有数对按位异或后的按位异或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2425-bitwise-xor-of-all-pairings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2425-bitwise-xor-of-all-pairings/</guid><description>Medium | Array, Bit Manipulation, Brainteaser</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>2428. 沙漏的最大总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2428-maximum-sum-of-an-hourglass/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2428-maximum-sum-of-an-hourglass/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2432. 完成最长任务的员工</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2432-the-employee-that-worked-on-the-longest-task/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2432-the-employee-that-worked-on-the-longest-task/</guid><description>Easy | Array</description></item><item><title>2433. 找到原数组的前缀异或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2433-find-the-original-array-of-prefix-xor/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2433-find-the-original-array-of-prefix-xor/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>2435. 矩阵中和能被 K 整除的路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2435-paths-in-matrix-whose-sum-is-divisible-by-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2435-paths-in-matrix-whose-sum-is-divisible-by-k/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>2438. 2的幂次方范围乘积查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2438-range-product-queries-of-powers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2438-range-product-queries-of-powers/</guid><description>Medium | Array, Bit Manipulation, Prefix Sum</description></item><item><title>2439. 最小化数组的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2439-minimize-maximum-of-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2439-minimize-maximum-of-array/</guid><description>Medium | Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum</description></item><item><title>2440. 创建价值相等的连通分量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2440-create-components-with-same-value/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2440-create-components-with-same-value/</guid><description>Hard | Array, Math, Tree, Depth-First Search, Enumeration</description></item><item><title>2441. 存在正负值的最大正整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2441-largest-positive-integer-that-exists-with-its-negative/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2441-largest-positive-integer-that-exists-with-its-negative/</guid><description>Easy | Array, Hash Table, Two Pointers, Sorting</description></item><item><title>2442. 反转操作后的不同整数数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2442-count-number-of-distinct-integers-after-reverse-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2442-count-number-of-distinct-integers-after-reverse-operations/</guid><description>Medium | Array, Hash Table, Math, Counting</description></item><item><title>2444. 固定边界的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2444-count-subarrays-with-fixed-bounds/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2444-count-subarrays-with-fixed-bounds/</guid><description>Hard | Array, Queue, Sliding Window, Monotonic Queue</description></item><item><title>2446. 判断两个事件是否存在冲突</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2446-determine-if-two-events-have-conflict/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2446-determine-if-two-events-have-conflict/</guid><description>Easy | Array, String</description></item><item><title>2447. 最大公约数等于 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2447-number-of-subarrays-with-gcd-equal-to-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2447-number-of-subarrays-with-gcd-equal-to-k/</guid><description>Medium | Array, Math, Number Theory</description></item><item><title>2448. 使数组元素相等的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2448-minimum-cost-to-make-array-equal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2448-minimum-cost-to-make-array-equal/</guid><description>Hard | Array, Binary Search, Greedy, Sorting, Prefix Sum</description></item><item><title>2449. 使数组相似的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2449-minimum-number-of-operations-to-make-arrays-similar/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2449-minimum-number-of-operations-to-make-arrays-similar/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>2451. 奇怪的字符串差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2451-odd-string-difference/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2451-odd-string-difference/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>2452. 字典中在两次编辑内的单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2452-words-within-two-edits-of-dictionary/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2452-words-within-two-edits-of-dictionary/</guid><description>Medium | Array, String, Trie</description></item><item><title>2453. 摧毁顺序目标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2453-destroy-sequential-targets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2453-destroy-sequential-targets/</guid><description>Medium | Array, Hash Table, Counting</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>2455. 可被三整除的偶数的平均值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2455-average-value-of-even-numbers-that-are-divisible-by-three/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2455-average-value-of-even-numbers-that-are-divisible-by-three/</guid><description>Easy | Array, Math</description></item><item><title>2456. 最受欢迎的视频创作者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2456-most-popular-video-creator/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2456-most-popular-video-creator/</guid><description>Medium | Array, Hash Table, String, Sorting, Heap (Priority Queue)</description></item><item><title>2458. 移除子树后的二叉树高度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2458-height-of-binary-tree-after-subtree-removal-queries/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2458-height-of-binary-tree-after-subtree-removal-queries/</guid><description>Hard | Array, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>2460. 对数组执行操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2460-apply-operations-to-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2460-apply-operations-to-an-array/</guid><description>Easy | Array, Two Pointers, Simulation</description></item><item><title>2461. 长度为 K 的不同元素子数组的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2461-maximum-sum-of-distinct-subarrays-with-length-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2461-maximum-sum-of-distinct-subarrays-with-length-k/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>2462. 雇佣 K 名工人的总代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2462-total-cost-to-hire-k-workers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2462-total-cost-to-hire-k-workers/</guid><description>Medium | Array, Two Pointers, Heap (Priority Queue), Simulation</description></item><item><title>2463. 机器人修理的最小总距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2463-minimum-total-distance-traveled/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2463-minimum-total-distance-traveled/</guid><description>Hard | Array, Dynamic Programming, Sorting</description></item><item><title>2465. 不同平均值的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2465-number-of-distinct-averages/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2465-number-of-distinct-averages/</guid><description>Easy | Array, Hash Table, Two Pointers, Sorting</description></item><item><title>2467. 树中最大收益路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2467-most-profitable-path-in-a-tree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2467-most-profitable-path-in-a-tree/</guid><description>Medium | Array, Tree, Depth-First Search, Breadth-First Search, Graph Theory</description></item><item><title>2470. 最小公倍数为 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2470-number-of-subarrays-with-lcm-equal-to-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2470-number-of-subarrays-with-lcm-equal-to-k/</guid><description>Medium | Array, Math, Number Theory</description></item><item><title>2475. 数组中不等三元组的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2475-number-of-unequal-triplets-in-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2475-number-of-unequal-triplets-in-array/</guid><description>Easy | Array, Hash Table, Sorting</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>2482. 行列间一和零的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2482-difference-between-ones-and-zeros-in-row-and-column/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2482-difference-between-ones-and-zeros-in-row-and-column/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>2488. 中位数为 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2488-count-subarrays-with-median-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2488-count-subarrays-with-median-k/</guid><description>Hard | Array, Hash Table, Prefix Sum</description></item><item><title>2491. 将玩家分成技能总值相等的队伍</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2491-divide-players-into-teams-of-equal-skill/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2491-divide-players-into-teams-of-equal-skill/</guid><description>Medium | Array, Hash Table, Two Pointers, Sorting</description></item><item><title>2496. 数组中字符串的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2496-maximum-value-of-a-string-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2496-maximum-value-of-a-string-in-an-array/</guid><description>Easy | Array, String</description></item><item><title>2497. 图的最大星形子图和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2497-maximum-star-sum-of-a-graph/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2497-maximum-star-sum-of-a-graph/</guid><description>Medium | Array, Greedy, Graph Theory, Sorting, Heap (Priority Queue)</description></item><item><title>2498. 青蛙跳跃 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2498-frog-jump-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2498-frog-jump-ii/</guid><description>Medium | Array, Binary Search, Greedy</description></item><item><title>2499. 使数组不相等的最小总成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2499-minimum-total-cost-to-make-arrays-unequal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2499-minimum-total-cost-to-make-arrays-unequal/</guid><description>Hard | Array, Hash Table, Greedy, Counting</description></item><item><title>2500. 删除每行中的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2500-delete-greatest-value-in-each-row/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2500-delete-greatest-value-in-each-row/</guid><description>Easy | Array, Sorting, Heap (Priority Queue), Matrix, Simulation</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>2502. 设计内存分配器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2502-design-memory-allocator/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2502-design-memory-allocator/</guid><description>Medium | Array, Hash Table, Design, Simulation</description></item><item><title>2503. 网格查询的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2503-maximum-number-of-points-from-grid-queries/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2503-maximum-number-of-points-from-grid-queries/</guid><description>Hard | Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>2506. 统计相似字符串对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2506-count-pairs-of-similar-strings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2506-count-pairs-of-similar-strings/</guid><description>Easy | Array, Hash Table, String, Bit Manipulation, Counting</description></item><item><title>2509. 树中环长度查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2509-cycle-length-queries-in-a-tree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2509-cycle-length-queries-in-a-tree/</guid><description>Hard | Array, Tree, Binary Tree</description></item><item><title>2511. 可以被捕获的最大敌方城堡数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2511-maximum-enemy-forts-that-can-be-captured/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2511-maximum-enemy-forts-that-can-be-captured/</guid><description>Easy | Array, Two Pointers</description></item><item><title>2512. 奖励最优秀的前 K 名学生</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2512-reward-top-k-students/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2512-reward-top-k-students/</guid><description>Medium | Array, Hash Table, String, Sorting, Heap (Priority Queue)</description></item><item><title>2515. 环形数组中到达目标字符串的最短距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2515-shortest-distance-to-target-string-in-a-circular-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2515-shortest-distance-to-target-string-in-a-circular-array/</guid><description>Easy | Array, String</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>2518. 优秀分割的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2518-number-of-great-partitions/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2518-number-of-great-partitions/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>2521. 数组元素乘积的不同质因数的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2521-distinct-prime-factors-of-product-of-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2521-distinct-prime-factors-of-product-of-array/</guid><description>Medium | Array, Hash Table, Math, Number Theory</description></item><item><title>2527. 数组的异或美丽值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2527-find-xor-beauty-of-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2527-find-xor-beauty-of-array/</guid><description>Medium | Array, Math, Bit Manipulation</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>2530. K次操作后的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2530-maximal-score-after-applying-k-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2530-maximal-score-after-applying-k-operations/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>2535. 数组元素和与数字和的绝对差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2535-difference-between-element-sum-and-digit-sum-of-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2535-difference-between-element-sum-and-digit-sum-of-an-array/</guid><description>Easy | Array, Math</description></item><item><title>2536. 将子矩阵元素增加一</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2536-increment-submatrices-by-one/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2536-increment-submatrices-by-one/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2537. 统计好子数组的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2537-count-the-number-of-good-subarrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2537-count-the-number-of-good-subarrays/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>2538. 最大和最小价格和的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2538-difference-between-maximum-and-minimum-price-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2538-difference-between-maximum-and-minimum-price-sum/</guid><description>Hard | Array, Dynamic Programming, Tree, Depth-First Search</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>2541. 使数组相等 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2541-minimum-operations-to-make-array-equal-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2541-minimum-operations-to-make-array-equal-ii/</guid><description>Medium | Array, Math, Greedy</description></item><item><title>2542. 最大子序列的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2542-maximum-subsequence-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2542-maximum-subsequence-score/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2545. 按第K场考试分数排序学生</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2545-sort-the-students-by-their-kth-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2545-sort-the-students-by-their-kth-score/</guid><description>Medium | Array, Sorting, Matrix</description></item><item><title>2547. 分割数组的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2547-minimum-cost-to-split-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2547-minimum-cost-to-split-an-array/</guid><description>Hard | Array, Hash Table, Dynamic Programming, Counting</description></item><item><title>2549. 计算板上不同数字的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2549-count-distinct-numbers-on-board/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2549-count-distinct-numbers-on-board/</guid><description>Easy | Array, Hash Table, Math, Simulation</description></item><item><title>2551. 将弹珠放入包中</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2551-put-marbles-in-bags/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2551-put-marbles-in-bags/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2552. 递增四元组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2552-count-increasing-quadruplets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2552-count-increasing-quadruplets/</guid><description>Hard | Array, Dynamic Programming, Binary Indexed Tree, Enumeration, Prefix Sum</description></item><item><title>2553. 分隔数组中数字的数位</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2553-separate-the-digits-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2553-separate-the-digits-in-an-array/</guid><description>Easy | Array, Simulation</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>2556. 最多翻转一次使二进制矩阵不连通</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/</guid><description>Medium | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>2558. 从最富有的堆中取礼物</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2558-take-gifts-from-the-richest-pile/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2558-take-gifts-from-the-richest-pile/</guid><description>Easy | Array, Heap (Priority Queue), Simulation</description></item><item><title>2559. 统计范围内的元音字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2559-count-vowel-strings-in-ranges/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2559-count-vowel-strings-in-ranges/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>2560. 打家劫舍 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2560-house-robber-iv/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2560-house-robber-iv/</guid><description>Medium | Array, Binary Search, Dynamic Programming, Greedy</description></item><item><title>2561. 重新排列水果</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2561-rearranging-fruits/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2561-rearranging-fruits/</guid><description>Hard | Array, Hash Table, Greedy, Sort</description></item><item><title>2562. 找到数组的连接值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2562-find-the-array-concatenation-value/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2562-find-the-array-concatenation-value/</guid><description>Easy | Array, Two Pointers, Simulation</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>2564. 子字符串异或查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2564-substring-xor-queries/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2564-substring-xor-queries/</guid><description>Medium | Array, Hash Table, String, Bit Manipulation</description></item><item><title>2567. 通过改变两个元素来最小化分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2567-minimum-score-by-changing-two-elements/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2567-minimum-score-by-changing-two-elements/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2568. 最小不可能的OR值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2568-minimum-impossible-or/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2568-minimum-impossible-or/</guid><description>Medium | Array, Bit Manipulation, Brainteaser</description></item><item><title>2569. 更新后处理求和查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2569-handling-sum-queries-after-update/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2569-handling-sum-queries-after-update/</guid><description>Hard | Array, Segment Tree</description></item><item><title>2570. 合并两个二维数组-求和值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2570-merge-two-2d-arrays-by-summing-values/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2570-merge-two-2d-arrays-by-summing-values/</guid><description>Easy | Array, Hash Table, Two Pointers</description></item><item><title>2572. 无平方子集的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2572-count-the-number-of-square-free-subsets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2572-count-the-number-of-square-free-subsets/</guid><description>Medium | Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask</description></item><item><title>2573. 寻找具有LCP的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/</guid><description>Hard | Array, String, Dynamic Programming, Greedy, Union-Find, Matrix</description></item><item><title>2574. 左右和的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2574-left-and-right-sum-differences/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2574-left-and-right-sum-differences/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>2575. 找出字符串的可整除数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2575-find-the-divisibility-array-of-a-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2575-find-the-divisibility-array-of-a-string/</guid><description>Medium | Array, Math, String</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>2577. 访问网格中单元格的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/</guid><description>Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>2580. 计算分组重叠区间的方法数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2580-count-ways-to-group-overlapping-ranges/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2580-count-ways-to-group-overlapping-ranges/</guid><description>Medium | Array, Sorting</description></item><item><title>2581. 计算可能的根节点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2581-count-number-of-possible-root-nodes/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2581-count-number-of-possible-root-nodes/</guid><description>Hard | Array, Hash Table, Dynamic Programming, Tree, Depth-First Search</description></item><item><title>2584. 分割数组使乘积互质</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2584-split-the-array-to-make-coprime-products/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2584-split-the-array-to-make-coprime-products/</guid><description>Hard | Array, Hash Table, Math, Number Theory</description></item><item><title>2585. 获得分数的方法数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2585-number-of-ways-to-earn-points/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2585-number-of-ways-to-earn-points/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>2586. 统计范围内的元音字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2586-count-the-number-of-vowel-strings-in-range/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2586-count-the-number-of-vowel-strings-in-range/</guid><description>Easy | Array, String, Counting</description></item><item><title>2587. 重新排列数组以最大化前缀分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2587-rearrange-array-to-maximize-prefix-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2587-rearrange-array-to-maximize-prefix-score/</guid><description>Medium | Array, Greedy, Sorting, Prefix Sum</description></item><item><title>2588. 统计美丽子数组的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2588-count-the-number-of-beautiful-subarrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2588-count-the-number-of-beautiful-subarrays/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Prefix Sum</description></item><item><title>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>2592. 最大化数组的伟大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2592-maximize-greatness-of-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2592-maximize-greatness-of-an-array/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>2593. 标记数组中所有元素后的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2593-find-score-of-an-array-after-marking-all-elements/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2593-find-score-of-an-array-after-marking-all-elements/</guid><description>Medium | Array, Hash Table, Sorting, Heap (Priority Queue), Simulation</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>2596. 检查骑士巡游方案</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2596-check-knight-tour-configuration/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2596-check-knight-tour-configuration/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix, Simulation</description></item><item><title>2597. 美丽子集的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2597-the-number-of-beautiful-subsets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2597-the-number-of-beautiful-subsets/</guid><description>Medium | Array, Hash Table, Math, Dynamic Programming, Backtracking, Sorting, Combinatorics</description></item><item><title>2598. 操作后的最小缺失非负整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2598-smallest-missing-non-negative-integer-after-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2598-smallest-missing-non-negative-integer-after-operations/</guid><description>Medium | Array, Hash Table, Math, Greedy</description></item><item><title>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>2603. 收集树中的金币</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2603-collect-coins-in-a-tree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2603-collect-coins-in-a-tree/</guid><description>Hard | Array, Tree, Graph Theory, Topological Sort</description></item><item><title>2605. 从两个数字数组中组成最小数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2605-form-smallest-number-from-two-digit-arrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2605-form-smallest-number-from-two-digit-arrays/</guid><description>Easy | Array, Hash Table, Enumeration</description></item><item><title>2606. 找出最大代价的子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2606-find-the-substring-with-maximum-cost/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2606-find-the-substring-with-maximum-cost/</guid><description>Medium | Array, Hash Table, String, Dynamic Programming</description></item><item><title>2607. 使 K 子数组和相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2607-make-k-subarray-sums-equal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2607-make-k-subarray-sums-equal/</guid><description>Medium | Array, Math, Greedy, Sorting, Number Theory</description></item><item><title>2610. 将数组转换为满足条件的2D数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2610-convert-an-array-into-a-2d-array-with-conditions/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2610-convert-an-array-into-a-2d-array-with-conditions/</guid><description>Medium | Array, Hash Table</description></item><item><title>2611. 老鼠和奶酪</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2611-mice-and-cheese/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2611-mice-and-cheese/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2612. 最小反转操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2612-minimum-reverse-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2612-minimum-reverse-operations/</guid><description>Hard | Array, Hash Table, Breadth-First Search, Union-Find, Ordered Set</description></item><item><title>2614. 对角线上的质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2614-prime-in-diagonal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2614-prime-in-diagonal/</guid><description>Easy | Array, Math, Matrix, Number Theory</description></item><item><title>2615. 距离和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2615-sum-of-distances/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2615-sum-of-distances/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>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>2617. 网格中到达目标的最少访问单元格数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2617-minimum-number-of-visited-cells-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2617-minimum-number-of-visited-cells-in-a-grid/</guid><description>Hard | Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stack</description></item><item><title>2639. 求网格的列宽度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2639-find-the-width-of-columns-of-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2639-find-the-width-of-columns-of-a-grid/</guid><description>Easy | Array, Matrix</description></item><item><title>2640. 数组所有前缀的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2640-find-the-score-of-all-prefixes-of-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2640-find-the-score-of-all-prefixes-of-an-array/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1282. 根据给定的组大小对人员进行分组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1282-group-the-people-given-the-group-size-they-belong-to/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1282-group-the-people-given-the-group-size-they-belong-to/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>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>1284. 将二进制矩阵转换为零矩阵的最小翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/</guid><description>Hard | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix</description></item><item><title>1287. 出现次数超过25%的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1287-element-appearing-more-than-25-in-sorted-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1287-element-appearing-more-than-25-in-sorted-array/</guid><description>Easy | Array</description></item><item><title>1289. 最小下降路径和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1289-minimum-falling-path-sum-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1289-minimum-falling-path-sum-ii/</guid><description>Hard | Array, Dynamic Programming, Matrix</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>1293. 网格中的最短路径（可消除障碍物）</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1293-shortest-path-in-a-grid-with-obstacles-elimination/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1293-shortest-path-in-a-grid-with-obstacles-elimination/</guid><description>Hard | Array, Breadth-First Search, Matrix</description></item><item><title>1295. 统计位数为偶数的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1295-find-numbers-with-even-number-of-digits/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1295-find-numbers-with-even-number-of-digits/</guid><description>Easy | Array, Math</description></item><item><title>1296. 将数组分成 K 个连续数字的集合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1296-divide-array-in-sets-of-k-consecutive-numbers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1296-divide-array-in-sets-of-k-consecutive-numbers/</guid><description>Medium | Array, Hash Table, Greedy, Sorting</description></item><item><title>1298. 从盒子中获取糖果的最大数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1298-maximum-candies-you-can-get-from-boxes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1298-maximum-candies-you-can-get-from-boxes/</guid><description>Hard | Array, Breadth-First Search, Graph Theory</description></item><item><title>1299. 用右侧最大元素替换数组元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1299-replace-elements-with-greatest-element-on-right-side/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1299-replace-elements-with-greatest-element-on-right-side/</guid><description>Easy | Array</description></item><item><title>1304. 找 N 个独特整数的和为零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1304-find-n-unique-integers-sum-up-to-zero/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1304-find-n-unique-integers-sum-up-to-zero/</guid><description>Easy | Array, Math</description></item><item><title>1306. 跳跃游戏 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1306-jump-game-iii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1306-jump-game-iii/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search</description></item><item><title>1307. 单词数学谜题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1307-verbal-arithmetic-puzzle/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1307-verbal-arithmetic-puzzle/</guid><description>Hard | Array, Math, String, Backtracking</description></item><item><title>1310. 子数组异或查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1310-xor-queries-of-a-subarray/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1310-xor-queries-of-a-subarray/</guid><description>Medium | Array, Bit Manipulation, Prefix Sum</description></item><item><title>1311. 获取你好友观看的视频</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1311-get-watched-videos-by-your-friends/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1311-get-watched-videos-by-your-friends/</guid><description>Medium | Array, Hash Table, Breadth-First Search, Graph Theory, Sorting</description></item><item><title>1313. 解压缩游程编码列表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1313-decompress-run-length-encoded-list/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1313-decompress-run-length-encoded-list/</guid><description>Easy | Array</description></item><item><title>1314. 矩阵区域和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1314-matrix-block-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1314-matrix-block-sum/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>1324. 竖直打印单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1324-print-words-vertically/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1324-print-words-vertically/</guid><description>Medium | Array, String, Simulation</description></item><item><title>1326. 浇灌花园的最少水龙头数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1326-minimum-number-of-taps-to-open-to-water-a-garden/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1326-minimum-number-of-taps-to-open-to-water-a-garden/</guid><description>Hard | Array, Dynamic Programming, Greedy</description></item><item><title>1329. 对角线排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1329-sort-the-matrix-diagonally/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1329-sort-the-matrix-diagonally/</guid><description>Medium | Array, Sorting, Matrix</description></item><item><title>1330. 反转子数组以最大化数组价值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1330-reverse-subarray-to-maximize-array-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1330-reverse-subarray-to-maximize-array-value/</guid><description>Hard | Array, Math, Greedy</description></item><item><title>1331. 数组的秩变换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1331-rank-transform-of-an-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1331-rank-transform-of-an-array/</guid><description>Easy | Array, Hash Table, Sorting</description></item><item><title>1335. 工作计划的最低难度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1335-minimum-difficulty-of-a-job-schedule/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1335-minimum-difficulty-of-a-job-schedule/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>1338. 数组大小减半</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1338-reduce-array-size-to-the-half/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1338-reduce-array-size-to-the-half/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>1340. 跳跃游戏 V</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1340-jump-game-v/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1340-jump-game-v/</guid><description>Hard | Array, Dynamic Programming, Sorting</description></item><item><title>1343. 大小为 K 且平均值大于等于阈值的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/</guid><description>Medium | Array, Sliding Window</description></item><item><title>1345. 跳跃游戏 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1345-jump-game-iv/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1345-jump-game-iv/</guid><description>Hard | Array, Hash Table, Breadth-First Search</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>1352. 最后 K 个数字的乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1352-product-of-the-last-k-numbers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1352-product-of-the-last-k-numbers/</guid><description>Medium | Array, Math, Design, Data Stream, Prefix Sum</description></item><item><title>1353. 可以参加的最大活动数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1353-maximum-number-of-events-that-can-be-attended/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1353-maximum-number-of-events-that-can-be-attended/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>1354. 构造目标数组的多个和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1354-construct-target-array-with-multiple-sums/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1354-construct-target-array-with-multiple-sums/</guid><description>Hard | Array, Heap (Priority Queue)</description></item><item><title>1357. 每 n 个顾客打折</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1357-apply-discount-every-n-orders/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1357-apply-discount-every-n-orders/</guid><description>Medium | Array, Hash Table, Design</description></item><item><title>1363. 构成3的最大倍数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1363-largest-multiple-of-three/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1363-largest-multiple-of-three/</guid><description>Hard | Array, Math, Dynamic Programming, Greedy, Sorting</description></item><item><title>1365. 有多少个数字比当前数字小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1365-how-many-numbers-are-smaller-than-the-current-number/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1365-how-many-numbers-are-smaller-than-the-current-number/</guid><description>Easy | Array, Hash Table, Sorting, Counting Sort</description></item><item><title>1366. 通过投票对团队排名</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1366-rank-teams-by-votes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1366-rank-teams-by-votes/</guid><description>Medium | Array, Hash Table, String, Sorting, Counting</description></item><item><title>1368. 使网格中至少有一条有效路径的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/</guid><description>Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>1375. 二进制字符串前缀一致的次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1375-number-of-times-binary-string-is-prefix-aligned/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1375-number-of-times-binary-string-is-prefix-aligned/</guid><description>Medium | Array</description></item><item><title>1381. 设计一个支持增量操作的栈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1381-design-a-stack-with-increment-operation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1381-design-a-stack-with-increment-operation/</guid><description>Medium | Array, Stack, Design</description></item><item><title>1383. 团队的最大工作效率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1383-maximum-performance-of-a-team/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1383-maximum-performance-of-a-team/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>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>1386. 影院座位分配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1386-cinema-seat-allocation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1386-cinema-seat-allocation/</guid><description>Medium | Array, Hash Table, Greedy, Bit Manipulation</description></item><item><title>1389. 按既定顺序创建目标数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1389-create-target-array-in-the-given-order/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1389-create-target-array-in-the-given-order/</guid><description>Easy | Array, Simulation</description></item><item><title>1391. 检查网格中是否存在有效路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1391-check-if-there-is-a-valid-path-in-a-grid/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1391-check-if-there-is-a-valid-path-in-a-grid/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1394. 找到数组中的幸运数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1394-find-lucky-integer-in-an-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1394-find-lucky-integer-in-an-array/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>1395. 统计作战单位数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1395-count-number-of-teams/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1395-count-number-of-teams/</guid><description>Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree</description></item><item><title>1402. 减少菜肴</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1402-reducing-dishes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1402-reducing-dishes/</guid><description>Hard | Array, Dynamic Programming, Greedy, Sorting</description></item><item><title>1403. 非递增顺序的最小子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1403-minimum-subsequence-in-non-increasing-order/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1403-minimum-subsequence-in-non-increasing-order/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>1406. 石子游戏 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1406-stone-game-iii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1406-stone-game-iii/</guid><description>Hard | Array, Math, Dynamic Programming, Game Theory</description></item><item><title>1408. 数组中的字符串匹配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1408-string-matching-in-an-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1408-string-matching-in-an-array/</guid><description>Easy | Array, String, String Matching</description></item><item><title>1409. 带键的排列查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1409-queries-on-a-permutation-with-key/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1409-queries-on-a-permutation-with-key/</guid><description>Medium | Array, Binary Indexed Tree, Simulation</description></item><item><title>1413. 逐步求和得到正数的最小值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1413-minimum-value-to-get-positive-step-by-step-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1413-minimum-value-to-get-positive-step-by-step-sum/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>1418. 餐厅食物订单显示表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1418-display-table-of-food-orders-in-a-restaurant/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1418-display-table-of-food-orders-in-a-restaurant/</guid><description>Medium | Array, Hash Table, String, Sorting, Ordered Set</description></item><item><title>1423. 可获得的最大点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1423-maximum-points-you-can-obtain-from-cards/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1423-maximum-points-you-can-obtain-from-cards/</guid><description>Medium | Array, Sliding Window, Prefix Sum</description></item><item><title>1424. 对角线遍历 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1424-diagonal-traverse-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1424-diagonal-traverse-ii/</guid><description>Medium | Array, Sorting, Heap (Priority Queue)</description></item><item><title>1425. 约束子序列和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1425-constrained-subsequence-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1425-constrained-subsequence-sum/</guid><description>Hard | Array, Dynamic Programming, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue</description></item><item><title>1431. 拥有最多糖果的孩子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1431-kids-with-the-greatest-number-of-candies/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1431-kids-with-the-greatest-number-of-candies/</guid><description>Easy | Array</description></item><item><title>1434. 不同帽子的戴法数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1434-number-of-ways-to-wear-different-hats-to-each-other/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1434-number-of-ways-to-wear-different-hats-to-each-other/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Bitmask</description></item><item><title>1436. 目的地城市</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1436-destination-city/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1436-destination-city/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>1437. 检查所有 1 之间的距离是否至少为 K</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1437-check-if-all-1s-are-at-least-length-k-places-away/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1437-check-if-all-1s-are-at-least-length-k-places-away/</guid><description>Easy | Array</description></item><item><title>1441. 用栈操作构建数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1441-build-an-array-with-stack-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1441-build-an-array-with-stack-operations/</guid><description>Medium | Array, Stack, Simulation</description></item><item><title>1449. 构成目标成本的最大整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1449-form-largest-integer-with-digits-that-add-up-to-target/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1449-form-largest-integer-with-digits-that-add-up-to-target/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>1450. 在给定时间正在做作业的学生人数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1450-number-of-students-doing-homework-at-a-given-time/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1450-number-of-students-doing-homework-at-a-given-time/</guid><description>Easy | Array</description></item><item><title>1453. 圆形靶上的最大飞镖数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1453-maximum-number-of-darts-inside-of-a-circular-dartboard/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1453-maximum-number-of-darts-inside-of-a-circular-dartboard/</guid><description>Hard | Array, Math, Geometry</description></item><item><title>1458. 两个子序列的最大点积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1458-max-dot-product-of-two-subsequences/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1458-max-dot-product-of-two-subsequences/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>1460. 通过翻转子数组使两个数组相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1460-make-two-arrays-equal-by-reversing-subarrays/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1460-make-two-arrays-equal-by-reversing-subarrays/</guid><description>Easy | Array, Hash Table, Sorting</description></item><item><title>1463. 摘樱桃 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1463-cherry-pickup-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1463-cherry-pickup-ii/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>1464. 数组中两元素的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1464-maximum-product-of-two-elements-in-an-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1464-maximum-product-of-two-elements-in-an-array/</guid><description>Easy | Array, Sorting, Heap (Priority Queue)</description></item><item><title>1465. 切蛋糕的最大面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1467. 两个盒子中球的颜色数相同的概率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/</guid><description>Hard | Array, Math, Dynamic Programming, Backtracking, Combinatorics, Probability and Statistics</description></item><item><title>1470. 重新排列数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1470-shuffle-the-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1470-shuffle-the-array/</guid><description>Easy | Array</description></item><item><title>1471. 数组中的 k 个最强值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1471-the-k-strongest-values-in-an-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1471-the-k-strongest-values-in-an-array/</guid><description>Medium | Array, Two Pointers, Sorting</description></item><item><title>1472. 设计浏览器历史记录</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1472-design-browser-history/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1472-design-browser-history/</guid><description>Medium | Array, Linked List, Stack, Design, Doubly-Linked List, Data Stream</description></item><item><title>1475. 商店中每个商品的最终价格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1475-final-prices-with-a-special-discount-in-a-shop/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1475-final-prices-with-a-special-discount-in-a-shop/</guid><description>Easy | Array, Stack, Monotonic Stack</description></item><item><title>1476. 子矩形查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1476-subrectangle-queries/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1476-subrectangle-queries/</guid><description>Medium | Array, Design, Matrix</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>1478. 分配邮箱</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1478-allocate-mailboxes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1478-allocate-mailboxes/</guid><description>Hard | Array, Math, Dynamic Programming, Sorting</description></item><item><title>1480. 一维数组的动态和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1480-running-sum-of-1d-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1480-running-sum-of-1d-array/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>1481. 删除 K 个元素后的最少唯一整数个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1481-least-number-of-unique-integers-after-k-removals/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1481-least-number-of-unique-integers-after-k-removals/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Counting</description></item><item><title>1487. 保证文件名唯一</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1487-making-file-names-unique/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1487-making-file-names-unique/</guid><description>Medium | Array, Hash Table, String</description></item><item><title>1491. 去掉最低工资和最高工资后的工资平均值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1491-average-salary-excluding-the-minimum-and-maximum-salary/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1491-average-salary-excluding-the-minimum-and-maximum-salary/</guid><description>Easy | Array, Sorting</description></item><item><title>1493. 删除一个元素以后最长的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1493-longest-subarray-of-1s-after-deleting-one-element/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1493-longest-subarray-of-1s-after-deleting-one-element/</guid><description>Medium | Array, Dynamic Programming, Sliding Window</description></item><item><title>1497. 检查数组对是否可以被 k 整除</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1497-check-if-array-pairs-are-divisible-by-k/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1497-check-if-array-pairs-are-divisible-by-k/</guid><description>Medium | Array, Hash Table, Counting</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>1499. 等式的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1499-max-value-of-equation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1499-max-value-of-equation/</guid><description>Hard | Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue</description></item><item><title>1502. 判断能否构成等差数列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1502-can-make-arithmetic-progression-from-sequence/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1502-can-make-arithmetic-progression-from-sequence/</guid><description>Easy | Array, Sorting</description></item><item><title>1503. 蚂蚁掉下木板前的最后一刻</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1503-last-moment-before-all-ants-fall-out-of-a-plank/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1503-last-moment-before-all-ants-fall-out-of-a-plank/</guid><description>Medium | Array, Brainteaser, Simulation</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>1509. 最多三次移动后数组最大值最小值的最小差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1512. 好数对的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1512-number-of-good-pairs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1512-number-of-good-pairs/</guid><description>Easy | Array, Hash Table, Math, Counting</description></item><item><title>1514. 最大概率路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1514-path-with-maximum-probability/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1514-path-with-maximum-probability/</guid><description>Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path</description></item><item><title>1515. 服务中心的最佳位置</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1515-best-position-for-a-service-centre/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1515-best-position-for-a-service-centre/</guid><description>Hard | Array, Math, Geometry, Randomized</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>1524. 奇数和的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1524-number-of-sub-arrays-with-odd-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1524-number-of-sub-arrays-with-odd-sum/</guid><description>Medium | Array, Math, Dynamic Programming, Prefix Sum</description></item><item><title>1526. 形成目标数组的子数组最少增加次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array/</guid><description>Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>1528. 重新排列字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1528-shuffle-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1528-shuffle-string/</guid><description>Easy | Array, String</description></item><item><title>1534. 统计好三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1534-count-good-triplets/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1534-count-good-triplets/</guid><description>Easy | Array, Enumeration</description></item><item><title>1535. 找到数组游戏的获胜者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1535-find-the-winner-of-an-array-game/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1535-find-the-winner-of-an-array-game/</guid><description>Medium | Array, Simulation</description></item><item><title>1537. 获取最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1537-get-the-maximum-score/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1537-get-the-maximum-score/</guid><description>Hard | Array, Two Pointers, Dynamic Programming, Greedy</description></item><item><title>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>1546. 和为目标值且不重叠的非空子数组的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/</guid><description>Medium | Array, Hash Table, Greedy, Prefix Sum</description></item><item><title>1547. 切棍子的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1547-minimum-cost-to-cut-a-stick/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1547-minimum-cost-to-cut-a-stick/</guid><description>Hard | Array, Dynamic Programming, Sorting</description></item><item><title>1550. 三个连续的奇数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1550-three-consecutive-odds/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1550-three-consecutive-odds/</guid><description>Easy | Array</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>1558. 使数组变为目标数组的最小函数调用次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1558-minimum-numbers-of-function-calls-to-make-target-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1558-minimum-numbers-of-function-calls-to-make-target-array/</guid><description>Medium | Array, Greedy, Bit Manipulation</description></item><item><title>1560. 环形赛道中访问次数最多的扇区</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1560-most-visited-sector-in-a-circular-track/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1560-most-visited-sector-in-a-circular-track/</guid><description>Easy | Array, Simulation</description></item><item><title>1561. 你能获得的最大硬币数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1561-maximum-number-of-coins-you-can-get/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1561-maximum-number-of-coins-you-can-get/</guid><description>Medium | Array, Math, Greedy, Sorting, Game Theory</description></item><item><title>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>1563. 石子游戏 V</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1563-stone-game-v/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1563-stone-game-v/</guid><description>Hard | Array, Math, Dynamic Programming, Game Theory</description></item><item><title>1566. 检测长度为 M 的模式重复 K 次或更多次</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1566-detect-pattern-of-length-m-repeated-k-or-more-times/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1566-detect-pattern-of-length-m-repeated-k-or-more-times/</guid><description>Easy | Array, Enumeration</description></item><item><title>1567. 乘积为正数的最长子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1567-maximum-length-of-subarray-with-positive-product/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1567-maximum-length-of-subarray-with-positive-product/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>1569. 重新排列数组得到相同二叉搜索树的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1569-number-of-ways-to-reorder-array-to-get-same-bst/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1569-number-of-ways-to-reorder-array-to-get-same-bst/</guid><description>Hard | Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Tree</description></item><item><title>1572. 矩阵对角线元素的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1572-matrix-diagonal-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1572-matrix-diagonal-sum/</guid><description>Easy | Array, Matrix</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>1575. 计算所有可能的路径数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1575-count-all-possible-routes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1575-count-all-possible-routes/</guid><description>Hard | Array, Dynamic Programming, Memoization</description></item><item><title>1578. 使绳子变彩色的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1578-minimum-time-to-make-rope-colorful/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1578-minimum-time-to-make-rope-colorful/</guid><description>Medium | Array, String, Dynamic Programming, Greedy</description></item><item><title>1583. 统计不开心的朋友</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1583-count-unhappy-friends/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1583-count-unhappy-friends/</guid><description>Medium | Array, Simulation</description></item><item><title>1584. 连接所有点的最小费用</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1584-min-cost-to-connect-all-points/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1584-min-cost-to-connect-all-points/</guid><description>Medium | Array, Union-Find, Graph Theory, Minimum Spanning Tree</description></item><item><title>1588. 所有奇数长度子数组的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1588-sum-of-all-odd-length-subarrays/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1588-sum-of-all-odd-length-subarrays/</guid><description>Easy | Array, Math, Prefix Sum</description></item><item><title>1589. 任意排列的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1589-maximum-sum-obtained-of-any-permutation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1589-maximum-sum-obtained-of-any-permutation/</guid><description>Medium | Array, Greedy, Sorting, Prefix Sum</description></item><item><title>1590. 使数组和能被 P 整除</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1590-make-sum-divisible-by-p/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1590-make-sum-divisible-by-p/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>1591. 奇怪的打印机 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1591-strange-printer-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1591-strange-printer-ii/</guid><description>Hard | Array, Graph Theory, Topological Sort, Matrix</description></item><item><title>1594. 矩阵中的最大非负积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1594-maximum-non-negative-product-in-a-matrix/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1594-maximum-non-negative-product-in-a-matrix/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1598. 爬虫日志文件夹</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1598-crawler-log-folder/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1598-crawler-log-folder/</guid><description>Easy | Array, String, Stack</description></item><item><title>1599. 百年摩天轮的最大利润</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1599-maximum-profit-of-operating-a-centennial-wheel/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1599-maximum-profit-of-operating-a-centennial-wheel/</guid><description>Medium | Array, Simulation</description></item><item><title>1601. 可达成的最大换楼请求数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1601-maximum-number-of-achievable-transfer-requests/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1601-maximum-number-of-achievable-transfer-requests/</guid><description>Hard | Array, Backtracking, Bit Manipulation, Enumeration</description></item><item><title>1604. 一小时内使用钥匙卡三次或以上的告警</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/</guid><description>Medium | Array, Hash Table, String, Sorting</description></item><item><title>1605. 根据行和列的和找到有效矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1605-find-valid-matrix-given-row-and-column-sums/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1605-find-valid-matrix-given-row-and-column-sums/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1606. 找到处理最多请求数的服务器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1606-find-servers-that-handled-most-number-of-requests/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1606-find-servers-that-handled-most-number-of-requests/</guid><description>Hard | Array, Heap (Priority Queue), Simulation, Ordered Set</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>1610. 可见点的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1610-maximum-number-of-visible-points/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1610-maximum-number-of-visible-points/</guid><description>Hard | Array, Math, Geometry, Sliding Window, Sorting</description></item><item><title>1619. 删除某些元素后的数组均值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1619-mean-of-array-after-removing-some-elements/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1619-mean-of-array-after-removing-some-elements/</guid><description>Easy | Array, Sorting</description></item><item><title>1626. 无冲突的最佳球队</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1626-best-team-with-no-conflicts/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1626-best-team-with-no-conflicts/</guid><description>Medium | Array, Dynamic Programming, Sorting</description></item><item><title>1627. 图的连通性与阈值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1627-graph-connectivity-with-threshold/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1627-graph-connectivity-with-threshold/</guid><description>Hard | Array, Math, Union-Find, Number Theory</description></item><item><title>1630. 等差子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1630-arithmetic-subarrays/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1630-arithmetic-subarrays/</guid><description>Medium | Array, Hash Table, Sorting</description></item><item><title>1632. 矩阵的秩变换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1632-rank-transform-of-a-matrix/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1632-rank-transform-of-a-matrix/</guid><description>Hard | Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix</description></item><item><title>1636. 根据数字频率将数组升序排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1636-sort-array-by-increasing-frequency/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1636-sort-array-by-increasing-frequency/</guid><description>Easy | Array, Hash Table, Sorting</description></item><item><title>1637. 两点间不包含任何点的最宽垂直区域</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1637-widest-vertical-area-between-two-points-containing-no-points/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1637-widest-vertical-area-between-two-points-containing-no-points/</guid><description>Easy | Array, Sorting</description></item><item><title>1639. 组成目标字符串的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1639-number-of-ways-to-form-a-target-string-given-a-dictionary/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1639-number-of-ways-to-form-a-target-string-given-a-dictionary/</guid><description>Hard | Array, String, Dynamic Programming</description></item><item><title>1640. 通过连接另一个数组的子数组得到一个数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1640-check-array-formation-through-concatenation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1640-check-array-formation-through-concatenation/</guid><description>Easy | Array, Hash Table</description></item><item><title>1642. 你能到达的最远建筑</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1642-furthest-building-you-can-reach/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1642-furthest-building-you-can-reach/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1643. 第 K 小的字典序指令</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1643-kth-smallest-instructions/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1643-kth-smallest-instructions/</guid><description>Hard | Array, Math, Dynamic Programming, Combinatorics</description></item><item><title>1646. 获取生成数组中的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1646-get-maximum-in-generated-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1646-get-maximum-in-generated-array/</guid><description>Easy | Array, Simulation</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>1652. 拆炸弹</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1652-defuse-the-bomb/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1652-defuse-the-bomb/</guid><description>Easy | Array, Sliding Window</description></item><item><title>1654. 到达家的最少跳跃次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1654-minimum-jumps-to-reach-home/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1654-minimum-jumps-to-reach-home/</guid><description>Medium | Array, Hash Table, Breadth-First Search</description></item><item><title>1655. 分配重复整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1655-distribute-repeating-integers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1655-distribute-repeating-integers/</guid><description>Hard | Array, Hash Table, Dynamic Programming, Backtracking, Bit Manipulation, Counting, Bitmask</description></item><item><title>1656. 设计有序流</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1656-design-an-ordered-stream/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1656-design-an-ordered-stream/</guid><description>Easy | Array, Hash Table, Design, Data Stream</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>1662. 检查两个字符串数组是否相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1662-check-if-two-string-arrays-are-equivalent/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1662-check-if-two-string-arrays-are-equivalent/</guid><description>Easy | Array, String</description></item><item><title>1664. 使数组公平的方法数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1664-ways-to-make-a-fair-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1664-ways-to-make-a-fair-array/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1665. 完成任务的最少初始能量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1665-minimum-initial-energy-to-finish-tasks/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1665-minimum-initial-energy-to-finish-tasks/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>1670. 设计前中后队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1670-design-front-middle-back-queue/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1670-design-front-middle-back-queue/</guid><description>Medium | Array, Linked List, Design, Queue, Doubly-Linked List, Data Stream</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>1672. 最富有客户的资产总量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1672-richest-customer-wealth/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1672-richest-customer-wealth/</guid><description>Easy | Array, Matrix</description></item><item><title>1673. 找到最具竞争力的子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1673-find-the-most-competitive-subsequence/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1673-find-the-most-competitive-subsequence/</guid><description>Medium | Array, Stack, Greedy, Monotonic Stack</description></item><item><title>1674. 使数组互补的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1674-minimum-moves-to-make-array-complementary/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1674-minimum-moves-to-make-array-complementary/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>1679. K 和数对的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1679-max-number-of-k-sum-pairs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1679-max-number-of-k-sum-pairs/</guid><description>Medium | Array, Hash Table, Two Pointers, Sorting</description></item><item><title>1681. 最小不兼容性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1681-minimum-incompatibility/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1681-minimum-incompatibility/</guid><description>Hard | Array, Hash Table, Dynamic Programming, Bit Manipulation, Bitmask</description></item><item><title>1685. 有序数组中数字绝对差的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1685-sum-of-absolute-differences-in-a-sorted-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1685-sum-of-absolute-differences-in-a-sorted-array/</guid><description>Medium | Array, Math, Prefix Sum</description></item><item><title>1686. 石子游戏VI</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1686-stone-game-vi/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1686-stone-game-vi/</guid><description>Medium | Array, Math, Greedy, Sorting, Heap (Priority Queue), Game Theory</description></item><item><title>1690. 石子游戏 VII</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1690-stone-game-vii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1690-stone-game-vii/</guid><description>Medium | Array, Math, Dynamic Programming, Game Theory</description></item><item><title>1691. 通过堆叠长方体的最大高度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1691-maximum-height-by-stacking-cuboids/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1691-maximum-height-by-stacking-cuboids/</guid><description>Hard | Array, Dynamic Programming, Sorting</description></item><item><title>1695. 最大删除值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1695-maximum-erasure-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1695-maximum-erasure-value/</guid><description>Medium | Array, Hash Table, Sliding Window</description></item><item><title>1696. 跳跃游戏 VI</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1696-jump-game-vi/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1696-jump-game-vi/</guid><description>Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue</description></item><item><title>1697. 检查边长度限制的路径存在性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1697-checking-existence-of-edge-length-limited-paths/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1697-checking-existence-of-edge-length-limited-paths/</guid><description>Hard | Array, Two Pointers, Union-Find, Graph Theory, Sorting</description></item><item><title>1700. 无法吃午餐的学生数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1700-number-of-students-unable-to-eat-lunch/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1700-number-of-students-unable-to-eat-lunch/</guid><description>Easy | Array, Stack, Queue, Simulation</description></item><item><title>1701. 平均等待时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1701-average-waiting-time/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1701-average-waiting-time/</guid><description>Medium | Array, Simulation</description></item><item><title>1703. 使K个连续1的最少相邻交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1703-minimum-adjacent-swaps-for-k-consecutive-ones/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1703-minimum-adjacent-swaps-for-k-consecutive-ones/</guid><description>Hard | Array, Greedy, Sliding Window, Prefix Sum</description></item><item><title>1706. 球会落到何处</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1706-where-will-the-ball-fall/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1706-where-will-the-ball-fall/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>1707. 与数组中元素的最大异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1707-maximum-xor-with-an-element-from-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1707-maximum-xor-with-an-element-from-array/</guid><description>Hard | Array, Bit Manipulation, Trie</description></item><item><title>1710. 卡车上的最大单元数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1710-maximum-units-on-a-truck/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1710-maximum-units-on-a-truck/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>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>1718. 构造字典序最大的有效序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1718-construct-the-lexicographically-largest-valid-sequence/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1718-construct-the-lexicographically-largest-valid-sequence/</guid><description>Medium | Array, Backtracking</description></item><item><title>1720. 解码异或后的数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1720-decode-xored-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1720-decode-xored-array/</guid><description>Easy | Array, Bit Manipulation</description></item><item><title>1722. 交换操作后的最小汉明距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1722-minimize-hamming-distance-after-swap-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1722-minimize-hamming-distance-after-swap-operations/</guid><description>Medium | Array, Depth-First Search, Union-Find</description></item><item><title>1723. 完成所有工作的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1723-find-minimum-time-to-finish-all-jobs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1723-find-minimum-time-to-finish-all-jobs/</guid><description>Hard | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask</description></item><item><title>1725. 能形成最大正方形的矩形数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1725-number-of-rectangles-that-can-form-the-largest-square/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1725-number-of-rectangles-that-can-form-the-largest-square/</guid><description>Easy | Array</description></item><item><title>1726. 相同乘积的元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1726-tuple-with-same-product/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1726-tuple-with-same-product/</guid><description>Medium | Array, Hash Table, Counting</description></item><item><title>1732. 寻找最高海拔</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1732-find-the-highest-altitude/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1732-find-the-highest-altitude/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>1733. 教授语言的最少人数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1733-minimum-number-of-people-to-teach/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1733-minimum-number-of-people-to-teach/</guid><description>Medium | Array, Hash Table, Greedy</description></item><item><title>1734. 解码异或后的排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1734-decode-xored-permutation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1734-decode-xored-permutation/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>1735. 构造乘积数组的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1735-count-ways-to-make-array-with-product/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1735-count-ways-to-make-array-with-product/</guid><description>Hard | Array, Math, Dynamic Programming, Combinatorics, Number Theory</description></item><item><title>1738. 找到第 K 大的异或坐标值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</guid><description>Medium | Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselect</description></item><item><title>1743. 从相邻元素对还原数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1743-restore-the-array-from-adjacent-pairs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1743-restore-the-array-from-adjacent-pairs/</guid><description>Medium | Array, Hash Table, Depth-First Search</description></item><item><title>1744. 你能在你最喜欢的日子吃到你最喜欢的糖果吗？</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1744-can-you-eat-your-favorite-candy-on-your-favorite-day/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1744-can-you-eat-your-favorite-candy-on-your-favorite-day/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1748. 唯一元素的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1748-sum-of-unique-elements/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1748-sum-of-unique-elements/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>1749. 任意子数组的最大绝对和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1749-maximum-absolute-sum-of-any-subarray/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1749-maximum-absolute-sum-of-any-subarray/</guid><description>Medium | Array, Dynamic Programming</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>1752. 检查数组是否经过排序和旋转</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1752-check-if-array-is-sorted-and-rotated/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1752-check-if-array-is-sorted-and-rotated/</guid><description>Easy | Array</description></item><item><title>1755. 最接近的子序列和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1755-closest-subsequence-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1755-closest-subsequence-sum/</guid><description>Hard | Array, Two Pointers, Dynamic Programming, Bit Manipulation, Sorting, Bitmask</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>1764. 通过连接另一个数组的子数组来形成数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1764-form-array-by-concatenating-subarrays-of-another-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1764-form-array-by-concatenating-subarrays-of-another-array/</guid><description>Medium | Array, Two Pointers, Greedy, String Matching</description></item><item><title>1766. 互质树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1766-tree-of-coprimes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1766-tree-of-coprimes/</guid><description>Hard | Array, Math, Tree, Depth-First Search, Number Theory</description></item><item><title>1769. 移动所有球到每个盒子所需的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1769-minimum-number-of-operations-to-move-all-balls-to-each-box/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1769-minimum-number-of-operations-to-move-all-balls-to-each-box/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>1773. 统计匹配规则的物品数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1773-count-items-matching-a-rule/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1773-count-items-matching-a-rule/</guid><description>Easy | Array, String</description></item><item><title>1775. 用最少操作次数使两个数组的和相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1775-equal-sum-arrays-with-minimum-number-of-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1775-equal-sum-arrays-with-minimum-number-of-operations/</guid><description>Medium | Array, Hash Table, Greedy, Counting</description></item><item><title>1779. 寻找坐标相同的最近点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate/</guid><description>Easy | Array</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>1785. 添加最少元素使数组和等于目标值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1785-minimum-elements-to-add-to-form-a-given-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1785-minimum-elements-to-add-to-form-a-given-sum/</guid><description>Medium | Array, Greedy</description></item><item><title>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>1798. 能够连续制造的最大值数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1798-maximum-number-of-consecutive-values-you-can-make/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1798-maximum-number-of-consecutive-values-you-can-make/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1799. N 次操作后的最大分数和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1799-maximize-score-after-n-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1799-maximize-score-after-n-operations/</guid><description>Hard | Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmask</description></item><item><title>1800. 最大升序子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1800-maximum-ascending-subarray-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1800-maximum-ascending-subarray-sum/</guid><description>Easy | Array</description></item><item><title>1801. 积压订单中的订单总数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1801-number-of-orders-in-the-backlog/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1801-number-of-orders-in-the-backlog/</guid><description>Medium | Array, Heap (Priority Queue), Simulation</description></item><item><title>1807. 计算字符串中括号对的值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1807-evaluate-the-bracket-pairs-of-a-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1807-evaluate-the-bracket-pairs-of-a-string/</guid><description>Medium | Array, Hash Table, String</description></item><item><title>1813. 句子相似性 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1813-sentence-similarity-iii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1813-sentence-similarity-iii/</guid><description>Medium | Array, Two Pointers, String</description></item><item><title>1814. 数组中的好数对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1814-count-nice-pairs-in-an-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1814-count-nice-pairs-in-an-array/</guid><description>Medium | Array, Hash Table, Math, Counting</description></item><item><title>1815. 获得新鲜甜甜圈的最多组数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1815-maximum-number-of-groups-getting-fresh-donuts/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1815-maximum-number-of-groups-getting-fresh-donuts/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Memoization, Bitmask</description></item><item><title>1816. 截断句子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1816-truncate-sentence/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1816-truncate-sentence/</guid><description>Easy | Array, String</description></item><item><title>1817. 找到用户的活跃分钟数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1817-finding-the-users-active-minutes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1817-finding-the-users-active-minutes/</guid><description>Medium | Array, Hash Table</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>1822. 数组元素积的符号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1822-sign-of-the-product-of-an-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1822-sign-of-the-product-of-an-array/</guid><description>Easy | Array, Math</description></item><item><title>1823. 找到圆形游戏的获胜者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1823-find-the-winner-of-the-circular-game/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1823-find-the-winner-of-the-circular-game/</guid><description>Medium | Array, Math, Recursion, Queue, Simulation</description></item><item><title>1824. 最少侧跳次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1824-minimum-sideway-jumps/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1824-minimum-sideway-jumps/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>1827. 使数组严格递增的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1827-minimum-operations-to-make-the-array-increasing/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1827-minimum-operations-to-make-the-array-increasing/</guid><description>Easy | Array, Greedy</description></item><item><title>1828. 查询圆内点的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1828-queries-on-number-of-points-inside-a-circle/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1828-queries-on-number-of-points-inside-a-circle/</guid><description>Medium | Array, Math, Geometry</description></item><item><title>1829. 每个查询的最大异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1829-maximum-xor-for-each-query/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1829-maximum-xor-for-each-query/</guid><description>Medium | Array, Bit Manipulation, Prefix Sum</description></item><item><title>1833. 最大冰淇淋数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1833-maximum-ice-cream-bars/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1833-maximum-ice-cream-bars/</guid><description>Medium | Array, Greedy, Sorting, Counting Sort</description></item><item><title>1835. 所有数对按位与的异或和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1835-find-xor-sum-of-all-pairs-bitwise-and/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1835-find-xor-sum-of-all-pairs-bitwise-and/</guid><description>Hard | Array, Math, Bit Manipulation</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>1840. 最高建筑高度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1840-maximum-building-height/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1840-maximum-building-height/</guid><description>Hard | Array, Math, Sorting</description></item><item><title>1846. 递减重排后的最大元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1846-maximum-element-after-decreasing-and-rearranging/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1846-maximum-element-after-decreasing-and-rearranging/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>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>1848. 到目标元素的最小距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1848-minimum-distance-to-the-target-element/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1848-minimum-distance-to-the-target-element/</guid><description>Easy | Array</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>1854. 人口最多的年份</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1854-maximum-population-year/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1854-maximum-population-year/</guid><description>Easy | Array, Counting, Prefix Sum</description></item><item><title>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>1856. 子数组最小乘积的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1856-maximum-subarray-min-product/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1856-maximum-subarray-min-product/</guid><description>Medium | Array, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>1862. 向下取整数对和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1862-sum-of-floored-pairs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1862-sum-of-floored-pairs/</guid><description>Hard | Array, Math, Binary Search, Counting, Enumeration, Prefix Sum</description></item><item><title>1863. 子集异或总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1863-sum-of-all-subset-xor-totals/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1863-sum-of-all-subset-xor-totals/</guid><description>Easy | Array, Math, Backtracking, Bit Manipulation, Combinatorics, Enumeration</description></item><item><title>1865. 寻找特定和的数对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1865-finding-pairs-with-a-certain-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1865-finding-pairs-with-a-certain-sum/</guid><description>Medium | Array, Hash Table, Design</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>1872. 石子游戏 VIII</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1872-stone-game-viii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1872-stone-game-viii/</guid><description>Hard | Array, Math, Dynamic Programming, Prefix Sum, Game Theory</description></item><item><title>1877. 最小化数组中的最大对和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1877-minimize-maximum-pair-sum-in-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1877-minimize-maximum-pair-sum-in-array/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>1878. 获取网格中最大的三个菱形和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1878-get-biggest-three-rhombus-sums-in-a-grid/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1878-get-biggest-three-rhombus-sums-in-a-grid/</guid><description>Medium | Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sum</description></item><item><title>1879. 两个数组的最小异或和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1879-minimum-xor-sum-of-two-arrays/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1879-minimum-xor-sum-of-two-arrays/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Bitmask</description></item><item><title>1886. 通过旋转矩阵判断是否可达</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1886-determine-whether-matrix-can-be-obtained-by-rotation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1886-determine-whether-matrix-can-be-obtained-by-rotation/</guid><description>Easy | Array, Matrix</description></item><item><title>1887. 使数组元素相等的减少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1887-reduction-operations-to-make-the-array-elements-equal/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1887-reduction-operations-to-make-the-array-elements-equal/</guid><description>Medium | Array, Sorting</description></item><item><title>1889. 包装过程中的最小浪费空间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1889-minimum-space-wasted-from-packaging/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1889-minimum-space-wasted-from-packaging/</guid><description>Hard | Array, Binary Search, Sorting, Prefix Sum</description></item><item><title>1893. 检查是否所有整数都被数组覆盖</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1893-check-if-all-the-integers-in-a-range-are-covered/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1893-check-if-all-the-integers-in-a-range-are-covered/</guid><description>Easy | Array, Hash Table, Prefix Sum</description></item><item><title>1894. 找到需要补充粉笔的学生</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1894-find-the-student-that-will-replace-the-chalk/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1894-find-the-student-that-will-replace-the-chalk/</guid><description>Medium | Array, Binary Search, Simulation, Prefix Sum</description></item><item><title>1895. 最大魔方阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1895-largest-magic-square/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1895-largest-magic-square/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>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>1905. 统计子岛屿</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1905-count-sub-islands/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1905-count-sub-islands/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1906. 最小绝对差值查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1906-minimum-absolute-difference-queries/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1906-minimum-absolute-difference-queries/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1911. 最大交替子序列和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1911-maximum-alternating-subsequence-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1911-maximum-alternating-subsequence-sum/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1912. 设计电影租赁系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1912-design-movie-rental-system/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1912-design-movie-rental-system/</guid><description>Hard | Array, Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>1913. 两对数字间的最大乘积差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1913-maximum-product-difference-between-two-pairs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1913-maximum-product-difference-between-two-pairs/</guid><description>Easy | Array, Sorting</description></item><item><title>1921. 消灭怪物的最大数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1921-eliminate-maximum-number-of-monsters/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1921-eliminate-maximum-number-of-monsters/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>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>1928. 在规定时间内到达目的地的最小花费</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1928-minimum-cost-to-reach-destination-in-time/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1928-minimum-cost-to-reach-destination-in-time/</guid><description>Hard | Array, Dynamic Programming, Graph Theory</description></item><item><title>1929. 数组串联</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1929-concatenation-of-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1929-concatenation-of-array/</guid><description>Easy | Array, Simulation</description></item><item><title>1932. 合并多个二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1932-merge-bsts-to-create-single-bst/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1932-merge-bsts-to-create-single-bst/</guid><description>Hard | Array, Hash Table, Tree, Depth-First Search, Binary Search Tree, Binary Tree</description></item><item><title>1936. 添加最少的梯子横档</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1936-add-minimum-number-of-rungs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1936-add-minimum-number-of-rungs/</guid><description>Medium | Array, Greedy</description></item><item><title>1937. 最大点数获取</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1937-maximum-number-of-points-with-cost/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1937-maximum-number-of-points-with-cost/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1938. 最大基因差查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1938-maximum-genetic-difference-query/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1938-maximum-genetic-difference-query/</guid><description>Hard | Array, Hash Table, Bit Manipulation, Depth-First Search, Trie</description></item><item><title>1942. 最小未被占据的椅子编号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1942-the-number-of-the-smallest-unoccupied-chair/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1942-the-number-of-the-smallest-unoccupied-chair/</guid><description>Medium | Array, Hash Table, Heap (Priority Queue)</description></item><item><title>1943. 描述绘画</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1943-describe-the-painting/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1943-describe-the-painting/</guid><description>Medium | Array, Hash Table, Sorting, Prefix Sum</description></item><item><title>1944. 队列中看到的人数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1944-number-of-visible-people-in-a-queue/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1944-number-of-visible-people-in-a-queue/</guid><description>Hard | Array, Stack, Monotonic Stack</description></item><item><title>1946. 变更一个子字符串后的最大数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1946-largest-number-after-mutating-substring/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1946-largest-number-after-mutating-substring/</guid><description>Medium | Array, String, Greedy</description></item><item><title>1948. 删除系统中的重复文件夹</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1948-delete-duplicate-folders-in-system/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1948-delete-duplicate-folders-in-system/</guid><description>Hard | Array, Hash Table, String, Trie, Hash Function</description></item><item><title>1953. 可以工作的最大周数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1953-maximum-number-of-weeks-for-which-you-can-work/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1953-maximum-number-of-weeks-for-which-you-can-work/</guid><description>Medium | Array, Greedy</description></item><item><title>1955. 计算特殊子序列的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1955-count-number-of-special-subsequences/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1955-count-number-of-special-subsequences/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>1958. 检查移动合法性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1958-check-if-move-is-legal/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1958-check-if-move-is-legal/</guid><description>Medium | Array, Matrix, Enumeration</description></item><item><title>1959. 最多 K 次调整数组大小后的最小总浪费空间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1959-minimum-total-space-wasted-with-k-resizing-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1959-minimum-total-space-wasted-with-k-resizing-operations/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>1961. 检查字符串是否为数组前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1961-check-if-string-is-a-prefix-of-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1961-check-if-string-is-a-prefix-of-array/</guid><description>Easy | Array, Two Pointers, String</description></item><item><title>1962. 移除石子使总数最小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1962-remove-stones-to-minimize-the-total/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1962-remove-stones-to-minimize-the-total/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>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>1967. 作为子字符串出现在单词中的字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1967-number-of-strings-that-appear-as-substrings-in-word/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1967-number-of-strings-that-appear-as-substrings-in-word/</guid><description>Easy | Array, String</description></item><item><title>1968. 数组中不等于相邻元素平均值的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1968-array-with-elements-not-equal-to-average-of-neighbors/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1968-array-with-elements-not-equal-to-average-of-neighbors/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>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>1975. 最大矩阵和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1975-maximum-matrix-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1975-maximum-matrix-sum/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1979. 找数组的最大公约数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1979-find-greatest-common-divisor-of-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1979-find-greatest-common-divisor-of-array/</guid><description>Easy | Array, Math, Number Theory</description></item><item><title>1980. 寻找不同的二进制字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1980-find-unique-binary-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1980-find-unique-binary-string/</guid><description>Medium | Array, Hash Table, String, Backtracking</description></item><item><title>1981. 最小化目标值与所选元素和的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1981-minimize-the-difference-between-target-and-chosen-elements/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1981-minimize-the-difference-between-target-and-chosen-elements/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1982. 根据子集和恢复数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1982-find-array-given-subset-sums/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1982-find-array-given-subset-sums/</guid><description>Hard | Array, Hash Table, Sorting, Counting</description></item><item><title>1984. K 名学生分数的最小差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1984-minimum-difference-between-highest-and-lowest-of-k-scores/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1984-minimum-difference-between-highest-and-lowest-of-k-scores/</guid><description>Easy | Array, Sliding Window, Sorting</description></item><item><title>1985. 找到数组中第 K 大的整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1985-find-the-kth-largest-integer-in-the-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1985-find-the-kth-largest-integer-in-the-array/</guid><description>Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect</description></item><item><title>1986. 完成所有任务的最少工作时间段</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1986-minimum-number-of-work-sessions-to-finish-the-tasks/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1986-minimum-number-of-work-sessions-to-finish-the-tasks/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask</description></item><item><title>1991. 在数组中找到中间索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1991-find-the-middle-index-in-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1991-find-the-middle-index-in-array/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>1993. 树上的操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1993-operations-on-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1993-operations-on-tree/</guid><description>Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Design</description></item><item><title>1996. 游戏中弱角色的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1996-the-number-of-weak-characters-in-the-game/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1996-the-number-of-weak-characters-in-the-game/</guid><description>Medium | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>1997. 第一天访问所有房间的日期</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1997-first-day-where-you-have-been-in-all-the-rooms/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1997-first-day-where-you-have-been-in-all-the-rooms/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1998. 数组的 GCD 排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1998-gcd-sort-of-an-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1998-gcd-sort-of-an-array/</guid><description>Hard | Array, Math, Union-Find, Sorting, Number Theory</description></item><item><title>1000. 合并石头的最低成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1000-minimum-cost-to-merge-stones/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1000-minimum-cost-to-merge-stones/</guid><description>Hard | Array, Dynamic Programming, Prefix Sum</description></item><item><title>1001. 网格照明</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1001-grid-illumination/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1001-grid-illumination/</guid><description>Hard | Array, Hash Table</description></item><item><title>1002. 查找共用字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1002-find-common-characters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1002-find-common-characters/</guid><description>Easy | Array, Hash Table, String</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>1005. K 次取反后最大化的数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1005-maximize-sum-of-array-after-k-negations/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1005-maximize-sum-of-array-after-k-negations/</guid><description>Easy | Array, Greedy, Sorting</description></item><item><title>1007. 行中相等值的最少多米诺旋转</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1007-minimum-domino-rotations-for-equal-row/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1007-minimum-domino-rotations-for-equal-row/</guid><description>Medium | Array, Greedy</description></item><item><title>1008. 先序遍历构造二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1008-construct-binary-search-tree-from-preorder-traversal/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1008-construct-binary-search-tree-from-preorder-traversal/</guid><description>Medium | Array, Stack, Tree, Binary Search Tree, Monotonic Stack, Binary Tree</description></item><item><title>1010. 总持续时间可被 60 整除的歌曲对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1010-pairs-of-songs-with-total-durations-divisible-by-60/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1010-pairs-of-songs-with-total-durations-divisible-by-60/</guid><description>Medium | Array, Hash Table, Counting</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>1013. 将数组分成三个相等和的部分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1013-partition-array-into-three-parts-with-equal-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1013-partition-array-into-three-parts-with-equal-sum/</guid><description>Easy | Array, Greedy</description></item><item><title>1014. 最佳观光组合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1014-best-sightseeing-pair/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1014-best-sightseeing-pair/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1018. 可被 5 整除的二进制前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1018-binary-prefix-divisible-by-5/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1018-binary-prefix-divisible-by-5/</guid><description>Easy | Array, Bit Manipulation</description></item><item><title>1019. 链表中的下一个更大节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1019-next-greater-node-in-linked-list/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1019-next-greater-node-in-linked-list/</guid><description>Medium | Array, Linked List, Stack, Monotonic Stack</description></item><item><title>1020. 飞地的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1020-number-of-enclaves/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1020-number-of-enclaves/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1024. 视频拼接</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1024-video-stitching/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1024-video-stitching/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>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>1029. 两地调度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1029-two-city-scheduling/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1029-two-city-scheduling/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1030. 距离顺序排列矩阵单元格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1030-matrix-cells-in-distance-order/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1030-matrix-cells-in-distance-order/</guid><description>Easy | Array, Math, Geometry, Sorting, Matrix</description></item><item><title>1031. 两个非重叠子数组的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1031-maximum-sum-of-two-non-overlapping-subarrays/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1031-maximum-sum-of-two-non-overlapping-subarrays/</guid><description>Medium | Array, Dynamic Programming, Sliding Window</description></item><item><title>1032. 字符流</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1032-stream-of-characters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1032-stream-of-characters/</guid><description>Hard | Array, String, Design, Trie, Data Stream</description></item><item><title>1036. 逃脱大迷宫</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1036-escape-a-large-maze/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1036-escape-a-large-maze/</guid><description>Hard | Array, Hash Table, Depth-First Search, Breadth-First Search</description></item><item><title>1037. 有效的回旋镖</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1037-valid-boomerang/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1037-valid-boomerang/</guid><description>Easy | Array, Math, Geometry</description></item><item><title>1039. 多边形三角剖分的最低得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1039-minimum-score-triangulation-of-polygon/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1039-minimum-score-triangulation-of-polygon/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1040. 移动石子直到连续 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1040-moving-stones-until-consecutive-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1040-moving-stones-until-consecutive-ii/</guid><description>Medium | Array, Math, Sliding Window, Sorting</description></item><item><title>1043. 分割数组以得到最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1043-partition-array-for-maximum-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1043-partition-array-for-maximum-sum/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1046. 最后一块石头的重量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1046-last-stone-weight/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1046-last-stone-weight/</guid><description>Easy | Array, Heap (Priority Queue)</description></item><item><title>1048. 最长字符串链</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1048-longest-string-chain/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1048-longest-string-chain/</guid><description>Medium | Array, Hash Table, Two Pointers, String, Dynamic Programming, Sorting</description></item><item><title>1049. 最后一块石头的重量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1049-last-stone-weight-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1049-last-stone-weight-ii/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1051. 高度检查器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1051-height-checker/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1051-height-checker/</guid><description>Easy | Array, Sorting, Counting Sort</description></item><item><title>1052. 爱生气的书店老板</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1052-grumpy-bookstore-owner/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1052-grumpy-bookstore-owner/</guid><description>Medium | Array, Sliding Window</description></item><item><title>1053. 通过一次交换得到的前一个排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1053-previous-permutation-with-one-swap/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1053-previous-permutation-with-one-swap/</guid><description>Medium | Array, Greedy</description></item><item><title>1054. 遥远的条形码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1054-distant-barcodes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1054-distant-barcodes/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting</description></item><item><title>1072. 翻转列以获得最大相等行数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1072-flip-columns-for-maximum-number-of-equal-rows/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1072-flip-columns-for-maximum-number-of-equal-rows/</guid><description>Medium | Array, Hash Table, Matrix</description></item><item><title>1073. 负二进制数相加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1073-adding-two-negabinary-numbers/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1073-adding-two-negabinary-numbers/</guid><description>Medium | Array, Math</description></item><item><title>1074. 和为目标值的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1074-number-of-submatrices-that-sum-to-target/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1074-number-of-submatrices-that-sum-to-target/</guid><description>Hard | Array, Hash Table, Matrix, Prefix Sum</description></item><item><title>1089. 复写零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1089-duplicate-zeros/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1089-duplicate-zeros/</guid><description>Easy | Array, Two Pointers</description></item><item><title>1090. 从标签中选取最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1090-largest-values-from-labels/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1090-largest-values-from-labels/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Counting</description></item><item><title>1091. 二进制矩阵中的最短路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1091-shortest-path-in-binary-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1091-shortest-path-in-binary-matrix/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>1094. 拼车</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1094-car-pooling/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1094-car-pooling/</guid><description>Medium | Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum</description></item><item><title>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>1105. 填充书架</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1105-filling-bookcase-shelves/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1105-filling-bookcase-shelves/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1109. 航班预订统计</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1109-corporate-flight-bookings/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1109-corporate-flight-bookings/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>1110. 删点成林</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1110-delete-nodes-and-return-forest/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1110-delete-nodes-and-return-forest/</guid><description>Medium | Array, Hash Table, Tree, Depth-First Search, Binary Tree</description></item><item><title>1122. 数组的相对排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1122-relative-sort-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1122-relative-sort-array/</guid><description>Easy | Array, Hash Table, Sorting, Counting Sort</description></item><item><title>1124. 表现良好的最长时间段</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1124-longest-well-performing-interval/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1124-longest-well-performing-interval/</guid><description>Medium | Array, Hash Table, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>1125. 最小足够团队</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1125-smallest-sufficient-team/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1125-smallest-sufficient-team/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Bitmask</description></item><item><title>1128. 等价多米诺骨牌对的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1128-number-of-equivalent-domino-pairs/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1128-number-of-equivalent-domino-pairs/</guid><description>Easy | Array, Hash Table, Counting</description></item><item><title>1130. 叶值的最小代价生成树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1130-minimum-cost-tree-from-leaf-values/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1130-minimum-cost-tree-from-leaf-values/</guid><description>Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>1131. 绝对值表达式的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1131-maximum-of-absolute-value-expression/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1131-maximum-of-absolute-value-expression/</guid><description>Medium | Array, Math</description></item><item><title>1140. 石子游戏 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1140-stone-game-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1140-stone-game-ii/</guid><description>Medium | Array, Math, Dynamic Programming, Prefix Sum, Game Theory</description></item><item><title>1144. 减少元素使数组呈锯齿状</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1144-decrease-elements-to-make-array-zigzag/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1144-decrease-elements-to-make-array-zigzag/</guid><description>Medium | Array, Greedy</description></item><item><title>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>1160. 拼写单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1160-find-words-that-can-be-formed-by-characters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1160-find-words-that-can-be-formed-by-characters/</guid><description>Easy | Array, Hash Table, String, Counting</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>1177. 从子字符串中构造回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1177-can-make-palindrome-from-substring/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1177-can-make-palindrome-from-substring/</guid><description>Medium | Array, Hash Table, String, Bit Manipulation, Prefix Sum</description></item><item><title>1178. 每个谜题的有效单词数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1178-number-of-valid-words-for-each-puzzle/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1178-number-of-valid-words-for-each-puzzle/</guid><description>Hard | Array, Hash Table, String, Bit Manipulation, Trie</description></item><item><title>1184. 公交站间的距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1184-distance-between-bus-stops/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1184-distance-between-bus-stops/</guid><description>Easy | Array</description></item><item><title>1186. 删除一个元素以后的最大子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1186-maximum-subarray-sum-with-one-deletion/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1186-maximum-subarray-sum-with-one-deletion/</guid><description>Medium | Array, Dynamic Programming</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>1191. K 次串联后最大子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1191-k-concatenation-maximum-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1191-k-concatenation-maximum-sum/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>1200. 最小绝对差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1200-minimum-absolute-difference/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1200-minimum-absolute-difference/</guid><description>Easy | Array, Sorting</description></item><item><title>1202. 交换字符串中的字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1202-smallest-string-with-swaps/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1202-smallest-string-with-swaps/</guid><description>Medium | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting</description></item><item><title>1207. 独一无二的出现次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1207-unique-number-of-occurrences/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1207-unique-number-of-occurrences/</guid><description>Easy | Array, Hash Table</description></item><item><title>1210. 穿过迷宫的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1210-minimum-moves-to-reach-target-with-rotations/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1210-minimum-moves-to-reach-target-with-rotations/</guid><description>Hard | Array, Breadth-First Search, Matrix</description></item><item><title>1217. 玩筹码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1217-minimum-cost-to-move-chips-to-the-same-position/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1217-minimum-cost-to-move-chips-to-the-same-position/</guid><description>Easy | Array, Math, Greedy</description></item><item><title>1218. 给定差值的最长等差子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1218-longest-arithmetic-subsequence-of-given-difference/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1218-longest-arithmetic-subsequence-of-given-difference/</guid><description>Medium | Array, Hash Table, Dynamic Programming</description></item><item><title>1219. 黄金矿工</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1219-path-with-maximum-gold/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1219-path-with-maximum-gold/</guid><description>Medium | Array, Backtracking, Matrix</description></item><item><title>1222. 能够攻击国王的皇后</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1222-queens-that-can-attack-the-king/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1222-queens-that-can-attack-the-king/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>1232. 检查是否为直线</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1232-check-if-it-is-a-straight-line/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1232-check-if-it-is-a-straight-line/</guid><description>Easy | Array, Math, Geometry</description></item><item><title>1233. 从文件系统中删除子文件夹</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1233-remove-sub-folders-from-the-filesystem/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1233-remove-sub-folders-from-the-filesystem/</guid><description>Medium | Array, String, Depth-First Search, Trie</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>1248. 统计「优美子数组」</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1248-count-number-of-nice-subarrays/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1248-count-number-of-nice-subarrays/</guid><description>Medium | Array, Hash Table, Math, Sliding Window, Prefix Sum</description></item><item><title>1250. 检查是否为好数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1250-check-if-it-is-a-good-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1250-check-if-it-is-a-good-array/</guid><description>Hard | Array, Math, Number Theory</description></item><item><title>1252. 矩阵中的奇数值单元格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1252-cells-with-odd-values-in-a-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1252-cells-with-odd-values-in-a-matrix/</guid><description>Easy | Array, Math, Simulation</description></item><item><title>1253. 重构 2 行二进制矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1253-reconstruct-a-2-row-binary-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1253-reconstruct-a-2-row-binary-matrix/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1254. 封闭岛屿的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1254-number-of-closed-islands/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1254-number-of-closed-islands/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1255. 由字母组成单词的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1255-maximum-score-words-formed-by-letters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1255-maximum-score-words-formed-by-letters/</guid><description>Hard | Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Counting, Bitmask</description></item><item><title>1260. 二维网格迁移</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1260-shift-2d-grid/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1260-shift-2d-grid/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>1262. 可被三整除的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1262-greatest-sum-divisible-by-three/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1262-greatest-sum-divisible-by-three/</guid><description>Medium | Array, Dynamic Programming, Greedy, Sorting</description></item><item><title>1266. 访问所有点的最小时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1266-minimum-time-visiting-all-points/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1266-minimum-time-visiting-all-points/</guid><description>Easy | Array, Math, Geometry</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>1275. 找出井字棋的获胜者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1275-find-winner-on-a-tic-tac-toe-game/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1275-find-winner-on-a-tic-tac-toe-game/</guid><description>Easy | Array, Hash Table, Matrix, Simulation</description></item><item><title>721. 账户合并</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0721-accounts-merge/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0721-accounts-merge/</guid><description>Medium | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting</description></item><item><title>724. 寻找数组的中心下标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0724-find-pivot-index/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0724-find-pivot-index/</guid><description>Easy | Array, Prefix Sum</description></item><item><title>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>733. 图像渲染</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0733-flood-fill/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0733-flood-fill/</guid><description>Easy | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>739. 每日温度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0739-daily-temperatures/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0739-daily-temperatures/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>740. 删除并获得点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0740-delete-and-earn/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0740-delete-and-earn/</guid><description>Medium | Array, Hash Table, Dynamic Programming</description></item><item><title>741. 摘樱桃</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0741-cherry-pickup/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0741-cherry-pickup/</guid><description>Hard | Array, Dynamic Programming, Matrix</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>746. 使爬楼梯的最小花费</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0746-min-cost-climbing-stairs/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0746-min-cost-climbing-stairs/</guid><description>Easy | Array, Dynamic Programming</description></item><item><title>747. 至少是其他数字两倍的最大数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0747-largest-number-at-least-twice-of-others/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0747-largest-number-at-least-twice-of-others/</guid><description>Easy | Array, Sorting</description></item><item><title>748. 最短补全词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0748-shortest-completing-word/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0748-shortest-completing-word/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>752. 打开转盘锁</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0752-open-the-lock/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0752-open-the-lock/</guid><description>Medium | Array, Hash Table, String, Breadth-First Search</description></item><item><title>757. 设置交集大小至少为二</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0757-set-intersection-size-at-least-two/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0757-set-intersection-size-at-least-two/</guid><description>Hard | Array, Greedy, Sorting</description></item><item><title>764. 最大加号标志</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0764-largest-plus-sign/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0764-largest-plus-sign/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>766. 托普利茨矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0766-toeplitz-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0766-toeplitz-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>768. 最多能完成排序的块 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0768-max-chunks-to-make-sorted-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0768-max-chunks-to-make-sorted-ii/</guid><description>Hard | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>769. 最大数量的数据块来排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0769-max-chunks-to-make-sorted/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0769-max-chunks-to-make-sorted/</guid><description>Medium | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>773. 滑动谜题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0773-sliding-puzzle/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0773-sliding-puzzle/</guid><description>Hard | Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix</description></item><item><title>775. 全局倒置与局部倒置</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0775-global-and-local-inversions/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0775-global-and-local-inversions/</guid><description>Medium | Array, Math</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>781. 森林中的兔子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0781-rabbits-in-forest/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0781-rabbits-in-forest/</guid><description>Medium | Array, Hash Table, Math, Greedy</description></item><item><title>782. 变换为棋盘</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0782-transform-to-chessboard/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0782-transform-to-chessboard/</guid><description>Hard | Array, Math, Bit Manipulation, 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>789. 逃脱阻碍者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0789-escape-the-ghosts/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0789-escape-the-ghosts/</guid><description>Medium | Array, Math</description></item><item><title>795. 区间子数组个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0795-number-of-subarrays-with-bounded-maximum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0795-number-of-subarrays-with-bounded-maximum/</guid><description>Medium | Array, Two Pointers</description></item><item><title>798. 最小旋转得到最高分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0798-smallest-rotation-with-highest-score/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0798-smallest-rotation-with-highest-score/</guid><description>Hard | Array, Prefix Sum</description></item><item><title>801. 使数组严格递增的最小交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0801-minimum-swaps-to-make-sequences-increasing/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0801-minimum-swaps-to-make-sequences-increasing/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>803. 打砖块</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0803-bricks-falling-when-hit/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0803-bricks-falling-when-hit/</guid><description>Hard | Array, Union-Find, Matrix</description></item><item><title>804. 唯一摩尔斯密码词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0804-unique-morse-code-words/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0804-unique-morse-code-words/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>805. 相同平均值的数组分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0805-split-array-with-same-average/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0805-split-array-with-same-average/</guid><description>Hard | Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Bitmask</description></item><item><title>806. 写字符串需要的行数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0806-number-of-lines-to-write-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0806-number-of-lines-to-write-string/</guid><description>Easy | Array, String</description></item><item><title>807. 保持城市天际线的最大高度增加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0807-max-increase-to-keep-city-skyline/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0807-max-increase-to-keep-city-skyline/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>810. 黑板异或游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0810-chalkboard-xor-game/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0810-chalkboard-xor-game/</guid><description>Hard | Array, Math, Bit Manipulation, Brainteaser, Game Theory</description></item><item><title>812. 最大三角形面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0812-largest-triangle-area/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0812-largest-triangle-area/</guid><description>Easy | Array, Math, Geometry</description></item><item><title>813. 最大平均值和的分组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0813-largest-sum-of-averages/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0813-largest-sum-of-averages/</guid><description>Medium | Array, Dynamic Programming, Prefix Sum</description></item><item><title>815. 公交路线</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0815-bus-routes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0815-bus-routes/</guid><description>Hard | Array, Hash Table, Breadth-First Search</description></item><item><title>817. 链表组件</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0817-linked-list-components/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0817-linked-list-components/</guid><description>Medium | Array, Hash Table, Linked List</description></item><item><title>819. 最常见的单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0819-most-common-word/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0819-most-common-word/</guid><description>Easy | Array, Hash Table, String, Counting</description></item><item><title>820. 单词的压缩编码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0820-short-encoding-of-words/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0820-short-encoding-of-words/</guid><description>Medium | Array, Hash Table, String, Trie</description></item><item><title>821. 字符的最短距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0821-shortest-distance-to-a-character/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0821-shortest-distance-to-a-character/</guid><description>Easy | Array, Two Pointers, String</description></item><item><title>822. 翻卡片游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0822-card-flipping-game/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0822-card-flipping-game/</guid><description>Medium | Array, Hash Table</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>833. 字符串中的查找与替换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0833-find-and-replace-in-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0833-find-and-replace-in-string/</guid><description>Medium | Array, Hash Table, String, Sorting</description></item><item><title>840. 网格中的幻方</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0840-magic-squares-in-grid/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0840-magic-squares-in-grid/</guid><description>Medium | Array, Hash Table, Math, Matrix</description></item><item><title>845. 数组中的最长山脉</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0845-longest-mountain-in-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0845-longest-mountain-in-array/</guid><description>Medium | Array, Two Pointers, Dynamic Programming, Enumeration</description></item><item><title>846. 同花顺</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0846-hand-of-straights/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0846-hand-of-straights/</guid><description>Medium | Array, Hash Table, Greedy, Sorting</description></item><item><title>848. 字母移位</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0848-shifting-letters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0848-shifting-letters/</guid><description>Medium | Array, String, Prefix Sum</description></item><item><title>849. 到最近的人的最大距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0849-maximize-distance-to-closest-person/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0849-maximize-distance-to-closest-person/</guid><description>Medium | Array</description></item><item><title>850. 矩形面积 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/</guid><description>Hard | Array, Segment Tree, Sweep Line, Ordered Set</description></item><item><title>851. 喧闹和富有</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0851-loud-and-rich/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0851-loud-and-rich/</guid><description>Medium | Array, Depth-First Search, Graph Theory, Topological Sort</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>853. 车队</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0853-car-fleet/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0853-car-fleet/</guid><description>Medium | Array, Stack, Sorting, Monotonic Stack</description></item><item><title>857. 雇佣 K 名工人的最低成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0857-minimum-cost-to-hire-k-workers/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0857-minimum-cost-to-hire-k-workers/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>860. 柠檬水找零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0860-lemonade-change/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0860-lemonade-change/</guid><description>Easy | Array, Greedy</description></item><item><title>861. 翻转矩阵后的得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0861-score-after-flipping-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0861-score-after-flipping-matrix/</guid><description>Medium | Array, Greedy, Bit Manipulation, Matrix</description></item><item><title>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>867. 转置矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0867-transpose-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0867-transpose-matrix/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>870. 优势洗牌</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0870-advantage-shuffle/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0870-advantage-shuffle/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>871. 最少加油次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0871-minimum-number-of-refueling-stops/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0871-minimum-number-of-refueling-stops/</guid><description>Hard | Array, Dynamic Programming, Greedy, Heap (Priority Queue)</description></item><item><title>873. 最长斐波那契数列的长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0873-length-of-longest-fibonacci-subsequence/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0873-length-of-longest-fibonacci-subsequence/</guid><description>Medium | Array, Hash Table, Dynamic Programming</description></item><item><title>874. 模拟行走机器人</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0874-walking-robot-simulation/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0874-walking-robot-simulation/</guid><description>Medium | Array, Hash Table, Simulation</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>877. 石子游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0877-stone-game/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0877-stone-game/</guid><description>Medium | Array, Math, Dynamic Programming, Game Theory</description></item><item><title>879. 盈利计划</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0879-profitable-schemes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0879-profitable-schemes/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>881. 救生艇</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0881-boats-to-save-people/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0881-boats-to-save-people/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>883. 3D 形体投影面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0883-projection-area-of-3d-shapes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0883-projection-area-of-3d-shapes/</guid><description>Easy | Array, Math, Geometry, Matrix</description></item><item><title>885. 螺旋矩阵 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0885-spiral-matrix-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0885-spiral-matrix-iii/</guid><description>Medium | Array, Matrix, Simulation</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>889. 根据前序和后序遍历构造二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0889-construct-binary-tree-from-preorder-and-postorder-traversal/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0889-construct-binary-tree-from-preorder-and-postorder-traversal/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Tree</description></item><item><title>890. 查找和替换模式</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0890-find-and-replace-pattern/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0890-find-and-replace-pattern/</guid><description>Medium | Array, Hash Table, String</description></item><item><title>891. 子序列宽度之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0891-sum-of-subsequence-widths/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0891-sum-of-subsequence-widths/</guid><description>Hard | Array, Math, Sorting</description></item><item><title>892. 三维形体的表面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0892-surface-area-of-3d-shapes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0892-surface-area-of-3d-shapes/</guid><description>Easy | Array, Math, Geometry, Matrix</description></item><item><title>896. 单调数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0896-monotonic-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0896-monotonic-array/</guid><description>Easy | Array</description></item><item><title>898. 子数组按位或操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0898-bitwise-ors-of-subarrays/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0898-bitwise-ors-of-subarrays/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation</description></item><item><title>900. 游程长度编码迭代器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0900-rle-iterator/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0900-rle-iterator/</guid><description>Medium | Array, Design, Counting, Iterator</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>905. 按奇偶排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0905-sort-array-by-parity/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0905-sort-array-by-parity/</guid><description>Easy | Array, Two Pointers, Sorting</description></item><item><title>907. 子数组最小值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0907-sum-of-subarray-minimums/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0907-sum-of-subarray-minimums/</guid><description>Medium | Array, Dynamic Programming, Stack, Monotonic Stack</description></item><item><title>908. 最小差值 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0908-smallest-range-i/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0908-smallest-range-i/</guid><description>Easy | Array, Math</description></item><item><title>909. 蛇梯棋</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0909-snakes-and-ladders/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0909-snakes-and-ladders/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>910. 最小差值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0910-smallest-range-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0910-smallest-range-ii/</guid><description>Medium | Array, Math, Greedy, Sorting</description></item><item><title>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>912. 排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0912-sort-an-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0912-sort-an-array/</guid><description>Medium | Array, Divide and Conquer, Sorting, Heap (Priority Queue), Merge Sort, Bucket Sort, Radix Sort, Counting Sort</description></item><item><title>914. 卡牌分组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0914-x-of-a-kind-in-a-deck-of-cards/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0914-x-of-a-kind-in-a-deck-of-cards/</guid><description>Easy | Array, Hash Table, Math, Counting, Number Theory</description></item><item><title>915. 将数组分割成不相交的区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0915-partition-array-into-disjoint-intervals/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0915-partition-array-into-disjoint-intervals/</guid><description>Medium | Array</description></item><item><title>916. 单词子集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0916-word-subsets/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0916-word-subsets/</guid><description>Medium | Array, Hash Table, String</description></item><item><title>918. 环形子数组的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0918-maximum-sum-circular-subarray/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0918-maximum-sum-circular-subarray/</guid><description>Medium | Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queue</description></item><item><title>922. 按奇偶排序数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0922-sort-array-by-parity-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0922-sort-array-by-parity-ii/</guid><description>Easy | Array, Two Pointers, Sorting</description></item><item><title>924. 最小化恶意软件传播</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0924-minimize-malware-spread/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0924-minimize-malware-spread/</guid><description>Hard | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</description></item><item><title>927. 三等分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0927-three-equal-parts/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0927-three-equal-parts/</guid><description>Hard | Array, Math</description></item><item><title>928. 最小化恶意软件的传播 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0928-minimize-malware-spread-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0928-minimize-malware-spread-ii/</guid><description>Hard | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</description></item><item><title>930. 和为目标值的二进制子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0930-binary-subarrays-with-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0930-binary-subarrays-with-sum/</guid><description>Medium | Array, Hash Table, Sliding Window, Prefix Sum</description></item><item><title>931. 下降路径最小和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0931-minimum-falling-path-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0931-minimum-falling-path-sum/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>932. 美丽数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0932-beautiful-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0932-beautiful-array/</guid><description>Medium | Array, Math, Divide and Conquer</description></item><item><title>941. 有效的山脉数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0941-valid-mountain-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0941-valid-mountain-array/</guid><description>Easy | Array</description></item><item><title>942. DI 字符串匹配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0942-di-string-match/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0942-di-string-match/</guid><description>Easy | Array, Two Pointers, String, Greedy</description></item><item><title>944. 删列造序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0944-delete-columns-to-make-sorted/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0944-delete-columns-to-make-sorted/</guid><description>Easy | Array, String</description></item><item><title>945. 使数组唯一的最小增量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0945-minimum-increment-to-make-array-unique/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0945-minimum-increment-to-make-array-unique/</guid><description>Medium | Array, Greedy, Sorting, Counting</description></item><item><title>946. 验证栈序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0946-validate-stack-sequences/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0946-validate-stack-sequences/</guid><description>Medium | Array, Stack, Simulation</description></item><item><title>948. 令牌放置</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0948-bag-of-tokens/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0948-bag-of-tokens/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>949. 给定数字组成最大时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0949-largest-time-for-given-digits/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0949-largest-time-for-given-digits/</guid><description>Medium | Array, String, Backtracking, Enumeration</description></item><item><title>950. 按递增顺序显示卡牌</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0950-reveal-cards-in-increasing-order/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0950-reveal-cards-in-increasing-order/</guid><description>Medium | Array, Queue, Sorting, Simulation</description></item><item><title>952. 按公因数计算最大组件大小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0952-largest-component-size-by-common-factor/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0952-largest-component-size-by-common-factor/</guid><description>Hard | Array, Hash Table, Math, Union-Find, Number Theory</description></item><item><title>953. 验证外星语词典</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0953-verifying-an-alien-dictionary/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0953-verifying-an-alien-dictionary/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>954. 二倍数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0954-array-of-doubled-pairs/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0954-array-of-doubled-pairs/</guid><description>Medium | Array, Hash Table, Greedy, Sorting</description></item><item><title>955. 删列造序 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0955-delete-columns-to-make-sorted-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0955-delete-columns-to-make-sorted-ii/</guid><description>Medium | Array, String, Greedy</description></item><item><title>956. 最高广告牌</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0956-tallest-billboard/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0956-tallest-billboard/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>957. N 天后的牢房</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0957-prison-cells-after-n-days/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0957-prison-cells-after-n-days/</guid><description>Medium | Array, Hash Table, Math, Bit Manipulation</description></item><item><title>960. 删除列以使表格有序 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0960-delete-columns-to-make-sorted-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0960-delete-columns-to-make-sorted-iii/</guid><description>Hard | Array, String, Dynamic Programming</description></item><item><title>961. 在长度为 2N 的数组中找出重复 N 次的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0961-n-repeated-element-in-size-2n-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0961-n-repeated-element-in-size-2n-array/</guid><description>Easy | Array, Hash Table</description></item><item><title>962. 最大宽度坡</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0962-maximum-width-ramp/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0962-maximum-width-ramp/</guid><description>Medium | Array, Two Pointers, Stack, Monotonic Stack</description></item><item><title>966. 元音拼写检查器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0966-vowel-spellchecker/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0966-vowel-spellchecker/</guid><description>Medium | Array, Hash Table, String</description></item><item><title>974. 和可被 K 整除的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0974-subarray-sums-divisible-by-k/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0974-subarray-sums-divisible-by-k/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>975. 奇偶跳</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0975-odd-even-jump/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0975-odd-even-jump/</guid><description>Hard | Array, Dynamic Programming, Stack, Sorting, Monotonic Stack, Ordered Set</description></item><item><title>976. 三角形的最大周长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0976-largest-perimeter-triangle/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0976-largest-perimeter-triangle/</guid><description>Easy | Array, Math, Greedy, Sorting</description></item><item><title>977. 有序数组的平方</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0977-squares-of-a-sorted-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0977-squares-of-a-sorted-array/</guid><description>Easy | Array, Two Pointers, Sorting</description></item><item><title>978. 最长湍流子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0978-longest-turbulent-subarray/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0978-longest-turbulent-subarray/</guid><description>Medium | Array, Dynamic Programming, Sliding Window</description></item><item><title>983. 火车票的最低消费</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0983-minimum-cost-for-tickets/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0983-minimum-cost-for-tickets/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>985. 查询后偶数和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0985-sum-of-even-numbers-after-queries/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0985-sum-of-even-numbers-after-queries/</guid><description>Medium | Array, Simulation</description></item><item><title>986. 区间列表的交集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0986-interval-list-intersections/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0986-interval-list-intersections/</guid><description>Medium | Array, Two Pointers, Sweep Line</description></item><item><title>989. 数组形式的整数加法</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0989-add-to-array-form-of-integer/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0989-add-to-array-form-of-integer/</guid><description>Easy | Array, Math</description></item><item><title>990. 等式方程的可满足性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0990-satisfiability-of-equality-equations/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0990-satisfiability-of-equality-equations/</guid><description>Medium | Array, String, Union-Find, Graph Theory</description></item><item><title>992. 恰好K个不同整数的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0992-subarrays-with-k-different-integers/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0992-subarrays-with-k-different-integers/</guid><description>Hard | Array, Hash Table, Sliding Window, Counting</description></item><item><title>995. K 连续位的最小翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/</guid><description>Hard | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum</description></item><item><title>997. 找到小镇的法官</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0997-find-the-town-judge/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0997-find-the-town-judge/</guid><description>Easy | Array, Hash Table, Graph Theory</description></item><item><title>485. 最大连续1的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0485-max-consecutive-ones/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0485-max-consecutive-ones/</guid><description>Easy | Array</description></item><item><title>486. 预测赢家</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0486-predict-the-winner/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0486-predict-the-winner/</guid><description>Medium | Array, Math, Dynamic Programming, Recursion, Game Theory</description></item><item><title>491. 非递减子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0491-non-decreasing-subsequences/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0491-non-decreasing-subsequences/</guid><description>Medium | Array, Hash Table, Backtracking, Bit Manipulation</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>494. 目标和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0494-target-sum/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0494-target-sum/</guid><description>Medium | Array, Dynamic Programming, Backtracking</description></item><item><title>495. 提莫攻击</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0495-teemo-attacking/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0495-teemo-attacking/</guid><description>Easy | Array, Simulation</description></item><item><title>496. 下一个更大元素 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0496-next-greater-element-i/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0496-next-greater-element-i/</guid><description>Easy | Array, Hash Table, Stack, Monotonic Stack</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>498. 对角线遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0498-diagonal-traverse/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0498-diagonal-traverse/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>500. 键盘行</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0500-keyboard-row/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0500-keyboard-row/</guid><description>Easy | Array, Hash Table, String</description></item><item><title>502. IPO</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0502-ipo/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0502-ipo/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>503. 下一个更大元素 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0503-next-greater-element-ii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0503-next-greater-element-ii/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>506. 相对名次</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0506-relative-ranks/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0506-relative-ranks/</guid><description>Easy | Array, Sorting, Heap (Priority Queue)</description></item><item><title>517. 超级洗衣机</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0517-super-washing-machines/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0517-super-washing-machines/</guid><description>Hard | Array, Greedy</description></item><item><title>518. 零钱兑换 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0518-coin-change-ii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0518-coin-change-ii/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>523. 连续的子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0523-continuous-subarray-sum/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0523-continuous-subarray-sum/</guid><description>Medium | Array, Hash Table, Math, Prefix Sum</description></item><item><title>525. 连续数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0525-contiguous-array/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0525-contiguous-array/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>528. 按权重随机选择</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0528-random-pick-with-weight/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0528-random-pick-with-weight/</guid><description>Medium | Array, Math, Binary Search, Prefix Sum, Randomized</description></item><item><title>529. 扫雷游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0529-minesweeper/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0529-minesweeper/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</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>539. 最小时间差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0539-minimum-time-difference/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0539-minimum-time-difference/</guid><description>Medium | Array, Math, String, 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>546. 移除盒子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0546-remove-boxes/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0546-remove-boxes/</guid><description>Hard | Array, Dynamic Programming, Memoization</description></item><item><title>553. 最优除法</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0553-optimal-division/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0553-optimal-division/</guid><description>Medium | Array, Math, Dynamic Programming</description></item><item><title>554. 砖墙</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0554-brick-wall/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0554-brick-wall/</guid><description>Medium | Array, Hash Table</description></item><item><title>561. 数组拆分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0561-array-partition/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0561-array-partition/</guid><description>Easy | Array, Greedy, Sorting, Counting Sort</description></item><item><title>565. 数组嵌套</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0565-array-nesting/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0565-array-nesting/</guid><description>Medium | Array, Depth-First Search</description></item><item><title>566. 重塑矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0566-reshape-the-matrix/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0566-reshape-the-matrix/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>575. 分糖果</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0575-distribute-candies/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0575-distribute-candies/</guid><description>Easy | Array, Hash Table</description></item><item><title>581. 最短无序连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0581-shortest-unsorted-continuous-subarray/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0581-shortest-unsorted-continuous-subarray/</guid><description>Medium | Array, Two Pointers, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>594. 最长和谐子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0594-longest-harmonious-subsequence/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0594-longest-harmonious-subsequence/</guid><description>Easy | Array, Hash Table, Sliding Window, Sorting, Counting</description></item><item><title>598. 范围求和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0598-range-addition-ii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0598-range-addition-ii/</guid><description>Easy | Array, Math</description></item><item><title>605. 种花问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0605-can-place-flowers/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0605-can-place-flowers/</guid><description>Easy | Array, Greedy</description></item><item><title>609. 在系统中查找重复文件</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0609-find-duplicate-file-in-system/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0609-find-duplicate-file-in-system/</guid><description>Medium | Array, Hash Table, String</description></item><item><title>611. 有效三角形的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0611-valid-triangle-number/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0611-valid-triangle-number/</guid><description>Medium | Array, Two Pointers, Binary Search, Greedy, Sorting</description></item><item><title>621. 任务调度器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0621-task-scheduler/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0621-task-scheduler/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting</description></item><item><title>622. 设计循环队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0622-design-circular-queue/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0622-design-circular-queue/</guid><description>Medium | Array, Linked List, Design, Queue</description></item><item><title>624. 数组中的最大距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0624-maximum-distance-in-arrays/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0624-maximum-distance-in-arrays/</guid><description>Medium | Array, Greedy</description></item><item><title>628. 三个数的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0628-maximum-product-of-three-numbers/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0628-maximum-product-of-three-numbers/</guid><description>Easy | Array, Math, Sorting</description></item><item><title>630. 课程表 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0630-course-schedule-iii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0630-course-schedule-iii/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>636. 函数的独占时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0636-exclusive-time-of-functions/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0636-exclusive-time-of-functions/</guid><description>Medium | Array, Stack</description></item><item><title>638. 大礼包</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0638-shopping-offers/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0638-shopping-offers/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask</description></item><item><title>641. 设计循环双端队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0641-design-circular-deque/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0641-design-circular-deque/</guid><description>Medium | Array, Linked List, Design, Queue</description></item><item><title>643. 子数组最大平均数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0643-maximum-average-subarray-i/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0643-maximum-average-subarray-i/</guid><description>Easy | Array, Sliding Window</description></item><item><title>645. 错误的集合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0645-set-mismatch/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0645-set-mismatch/</guid><description>Easy | Array, Hash Table, Bit Manipulation, Sorting</description></item><item><title>646. 最长数对链</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0646-maximum-length-of-pair-chain/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0646-maximum-length-of-pair-chain/</guid><description>Medium | Array, Dynamic Programming, Greedy, Sorting</description></item><item><title>648. 单词替换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0648-replace-words/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0648-replace-words/</guid><description>Medium | Array, Hash Table, String, Trie</description></item><item><title>654. 最大二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0654-maximum-binary-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0654-maximum-binary-tree/</guid><description>Medium | Array, Divide and Conquer, Stack, Tree, Monotonic Stack, Binary Tree</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>659. 分割数组为连续子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0659-split-array-into-consecutive-subsequences/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0659-split-array-into-consecutive-subsequences/</guid><description>Medium | Array, Hash Table, Greedy, Heap (Priority Queue)</description></item><item><title>661. 图像平滑器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0661-image-smoother/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0661-image-smoother/</guid><description>Easy | Array, Matrix</description></item><item><title>667. 美丽排列 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0667-beautiful-arrangement-ii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0667-beautiful-arrangement-ii/</guid><description>Medium | Array, Math</description></item><item><title>673. 最长递增子序列的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0673-number-of-longest-increasing-subsequence/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0673-number-of-longest-increasing-subsequence/</guid><description>Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree</description></item><item><title>674. 最长连续递增序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0674-longest-continuous-increasing-subsequence/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0674-longest-continuous-increasing-subsequence/</guid><description>Easy | Array</description></item><item><title>675. 砍树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0675-cut-off-trees-for-golf-event/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0675-cut-off-trees-for-golf-event/</guid><description>Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix</description></item><item><title>679. 24点游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0679-24-game/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0679-24-game/</guid><description>Hard | Array, Math, Backtracking</description></item><item><title>682. 棒球比赛</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0682-baseball-game/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0682-baseball-game/</guid><description>Easy | Array, Stack, Simulation</description></item><item><title>689. 三个非重叠子数组的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0689-maximum-sum-of-3-non-overlapping-subarrays/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0689-maximum-sum-of-3-non-overlapping-subarrays/</guid><description>Hard | Array, Dynamic Programming, Sliding Window, Prefix Sum</description></item><item><title>690. 员工的重要性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0690-employee-importance/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0690-employee-importance/</guid><description>Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search</description></item><item><title>691. 贴纸拼词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0691-stickers-to-spell-word/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0691-stickers-to-spell-word/</guid><description>Hard | Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask</description></item><item><title>697. 数组的度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0697-degree-of-an-array/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0697-degree-of-an-array/</guid><description>Easy | Array, Hash Table</description></item><item><title>698. 划分为k个相等的子集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0698-partition-to-k-equal-sum-subsets/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0698-partition-to-k-equal-sum-subsets/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask</description></item><item><title>699. 下降方块</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0699-falling-squares/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0699-falling-squares/</guid><description>Hard | Array, Segment Tree, Ordered Set</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>705. 设计哈希集合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0705-design-hashset/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0705-design-hashset/</guid><description>Easy | Array, Hash Table, Linked List, Design, Hash Function</description></item><item><title>706. 设计哈希映射</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0706-design-hashmap/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0706-design-hashmap/</guid><description>Easy | Array, Hash Table, Linked List, Design, Hash Function</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>714. 买卖股票的最佳时机含手续费</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0714-best-time-to-buy-and-sell-stock-with-transaction-fee/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0714-best-time-to-buy-and-sell-stock-with-transaction-fee/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>717. 1比特与2比特字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0717-1-bit-and-2-bit-characters/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0717-1-bit-and-2-bit-characters/</guid><description>Easy | Array</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>720. 字典中最长的单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0720-longest-word-in-dictionary/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0720-longest-word-in-dictionary/</guid><description>Medium | Array, Hash Table, String, Trie, Sorting</description></item><item><title>321. 创建最大数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0321-create-maximum-number/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0321-create-maximum-number/</guid><description>Hard | Array, Two Pointers, Stack, Greedy, Monotonic Stack</description></item><item><title>322. 零钱兑换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0322-coin-change/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0322-coin-change/</guid><description>Medium | Array, Dynamic Programming, Breadth-First Search</description></item><item><title>324. 摆动排序 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0324-wiggle-sort-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0324-wiggle-sort-ii/</guid><description>Medium | Array, Divide and Conquer, Greedy, Sorting, Quickselect</description></item><item><title>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>329. 矩阵中的最长递增路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0329-longest-increasing-path-in-a-matrix/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0329-longest-increasing-path-in-a-matrix/</guid><description>Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix</description></item><item><title>330. 修补数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0330-patching-array/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0330-patching-array/</guid><description>Hard | Array, Greedy</description></item><item><title>332. 重新安排行程</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0332-reconstruct-itinerary/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0332-reconstruct-itinerary/</guid><description>Hard | Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit</description></item><item><title>334. 递增的三元子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0334-increasing-triplet-subsequence/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0334-increasing-triplet-subsequence/</guid><description>Medium | Array, Greedy</description></item><item><title>336. 回文对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0336-palindrome-pairs/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0336-palindrome-pairs/</guid><description>Hard | Array, Hash Table, String, Trie, Hash Function</description></item><item><title>347. 前 K 个高频元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0347-top-k-frequent-elements/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0347-top-k-frequent-elements/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect</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>373. 查找和最小的 K 对数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0373-find-k-pairs-with-smallest-sums/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0373-find-k-pairs-with-smallest-sums/</guid><description>Medium | Array, Heap (Priority Queue)</description></item><item><title>376. 摆动序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0376-wiggle-subsequence/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0376-wiggle-subsequence/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>377. 组合总和 Ⅳ</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0377-combination-sum-iv/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0377-combination-sum-iv/</guid><description>Medium | Array, Dynamic Programming</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>380. 常数时间插入、删除和获取随机元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0380-insert-delete-getrandom-o1/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0380-insert-delete-getrandom-o1/</guid><description>Medium | Array, Hash Table, Math, Design, Randomized</description></item><item><title>381. O(1) 时间插入、删除和获取随机元素 - 允许重复</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0381-insert-delete-getrandom-o1-duplicates-allowed/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0381-insert-delete-getrandom-o1-duplicates-allowed/</guid><description>Hard | Array, Hash Table, Math, Design, Randomized</description></item><item><title>384. 打乱数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0384-shuffle-an-array/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0384-shuffle-an-array/</guid><description>Medium | Array, Math, Design, Randomized</description></item><item><title>391. 完美矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0391-perfect-rectangle/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0391-perfect-rectangle/</guid><description>Hard | Array, Hash Table, Math, Geometry, Sweep Line</description></item><item><title>393. UTF-8 编码验证</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0393-utf-8-validation/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0393-utf-8-validation/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>396. 旋转函数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0396-rotate-function/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0396-rotate-function/</guid><description>Medium | Array, Math, Dynamic Programming</description></item><item><title>399. 除法求值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0399-evaluate-division/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0399-evaluate-division/</guid><description>Medium | Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Path</description></item><item><title>403. 青蛙过河</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0403-frog-jump/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0403-frog-jump/</guid><description>Hard | Array, Dynamic Programming</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>413. 等差数列划分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0413-arithmetic-slices/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0413-arithmetic-slices/</guid><description>Medium | Array, Dynamic Programming, Sliding Window</description></item><item><title>414. 第三大的数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0414-third-maximum-number/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0414-third-maximum-number/</guid><description>Easy | Array, Sorting</description></item><item><title>416. 分割等和子集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0416-partition-equal-subset-sum/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0416-partition-equal-subset-sum/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>417. 太平洋大西洋水流问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0417-pacific-atlantic-water-flow/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0417-pacific-atlantic-water-flow/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>421. 数组中两个数的最大异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0421-maximum-xor-of-two-numbers-in-an-array/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0421-maximum-xor-of-two-numbers-in-an-array/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Trie</description></item><item><title>435. 无重叠区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0435-non-overlapping-intervals/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0435-non-overlapping-intervals/</guid><description>Medium | Array, Dynamic Programming, Greedy, Sorting</description></item><item><title>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>442. 数组中重复的数据</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0442-find-all-duplicates-in-an-array/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0442-find-all-duplicates-in-an-array/</guid><description>Medium | Array, Hash Table, Sorting</description></item><item><title>446. 等差数列划分 II - 子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0446-arithmetic-slices-ii-subsequence/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0446-arithmetic-slices-ii-subsequence/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>448. 找到所有数组中消失的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0448-find-all-numbers-disappeared-in-an-array/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0448-find-all-numbers-disappeared-in-an-array/</guid><description>Easy | Array, Hash Table</description></item><item><title>452. 用最少数量的箭引爆气球</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0452-minimum-number-of-arrows-to-burst-balloons/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0452-minimum-number-of-arrows-to-burst-balloons/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>453. 使数组元素相等的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0453-minimum-moves-to-equal-array-elements/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0453-minimum-moves-to-equal-array-elements/</guid><description>Medium | Array, Math</description></item><item><title>454. 四数相加 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0454-4sum-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0454-4sum-ii/</guid><description>Medium | Array, Hash Table</description></item><item><title>455. 分发饼干</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0455-assign-cookies/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0455-assign-cookies/</guid><description>Easy | Array, Two Pointers, Greedy, Sorting</description></item><item><title>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>457. 循环数组是否存在循环</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0457-circular-array-loop/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0457-circular-array-loop/</guid><description>Medium | Array, Hash Table, Two Pointers</description></item><item><title>462. 使数组元素相等的最少移动次数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0462-minimum-moves-to-equal-array-elements-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0462-minimum-moves-to-equal-array-elements-ii/</guid><description>Medium | Array, Math, Sorting</description></item><item><title>473. 火柴拼正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0473-matchsticks-to-square/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0473-matchsticks-to-square/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask</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>477. 汉明距离总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0477-total-hamming-distance/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0477-total-hamming-distance/</guid><description>Medium | Array, Math, Bit Manipulation</description></item><item><title>1. 两数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0001-two-sum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0001-two-sum/</guid><description>Easy | Array, Hash Table</description></item><item><title>105. 从前序与中序遍历序列构造二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0105-construct-binary-tree-from-preorder-and-inorder-traversal/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0105-construct-binary-tree-from-preorder-and-inorder-traversal/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Tree</description></item><item><title>106. 从中序与后序遍历序列构造二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0106-construct-binary-tree-from-inorder-and-postorder-traversal/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0106-construct-binary-tree-from-inorder-and-postorder-traversal/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Tree</description></item><item><title>108. 将有序数组转换为二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0108-convert-sorted-array-to-binary-search-tree/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0108-convert-sorted-array-to-binary-search-tree/</guid><description>Easy | Array, Divide and Conquer, Tree, Binary Search Tree, Binary Tree</description></item><item><title>11. 盛最多水的容器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0011-container-with-most-water/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0011-container-with-most-water/</guid><description>Medium | Array, Two Pointers, Greedy</description></item><item><title>118. 杨辉三角</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0118-pascals-triangle/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0118-pascals-triangle/</guid><description>Easy | Array, Dynamic Programming</description></item><item><title>119. 杨辉三角 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0119-pascals-triangle-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0119-pascals-triangle-ii/</guid><description>Easy | Array, Dynamic Programming</description></item><item><title>120. 三角形最小路径和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0120-triangle/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0120-triangle/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>121. 买卖股票的最佳时机</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0121-best-time-to-buy-and-sell-stock/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0121-best-time-to-buy-and-sell-stock/</guid><description>Easy | Array, Dynamic Programming</description></item><item><title>122. 买卖股票的最佳时机 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0122-best-time-to-buy-and-sell-stock-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0122-best-time-to-buy-and-sell-stock-ii/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>123. 买卖股票的最佳时机 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0123-best-time-to-buy-and-sell-stock-iii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0123-best-time-to-buy-and-sell-stock-iii/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>128. 最长连续序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0128-longest-consecutive-sequence/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0128-longest-consecutive-sequence/</guid><description>Medium | Array, Hash Table, Union-Find</description></item><item><title>130. 被围绕的区域</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0130-surrounded-regions/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0130-surrounded-regions/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>134. 加油站</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0134-gas-station/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0134-gas-station/</guid><description>Medium | Array, Greedy</description></item><item><title>135. 分发糖果</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0135-candy/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0135-candy/</guid><description>Hard | Array, Greedy</description></item><item><title>136. 只出现一次的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0136-single-number/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0136-single-number/</guid><description>Easy | Array, Bit Manipulation</description></item><item><title>137. 只出现一次的数字 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0137-single-number-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0137-single-number-ii/</guid><description>Medium | Array, Bit Manipulation</description></item><item><title>139. 单词拆分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0139-word-break/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0139-word-break/</guid><description>Medium | Array, Hash Table, String, Dynamic Programming, Trie, Memoization</description></item><item><title>14. 最长公共前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0014-longest-common-prefix/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0014-longest-common-prefix/</guid><description>Easy | Array, String, Trie</description></item><item><title>140. 单词拆分 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0140-word-break-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0140-word-break-ii/</guid><description>Hard | Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoization</description></item><item><title>149. 直线上最多的点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0149-max-points-on-a-line/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0149-max-points-on-a-line/</guid><description>Hard | Array, Hash Table, Math, Geometry</description></item><item><title>15. 三数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0015-3sum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0015-3sum/</guid><description>Medium | Array, Two Pointers, Sorting</description></item><item><title>150. 逆波兰表达式求值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0150-evaluate-reverse-polish-notation/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0150-evaluate-reverse-polish-notation/</guid><description>Medium | Array, Math, Stack</description></item><item><title>152. 乘积最大子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0152-maximum-product-subarray/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0152-maximum-product-subarray/</guid><description>Medium | Array, Dynamic Programming</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>16. 最接近的三数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0016-3sum-closest/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0016-3sum-closest/</guid><description>Medium | Array, Two Pointers, Sorting</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>164. 最大间距</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0164-maximum-gap/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0164-maximum-gap/</guid><description>Medium | Array, Sorting, Bucket Sort, Radix Sort</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>169. 多数元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0169-majority-element/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0169-majority-element/</guid><description>Easy | Array, Hash Table, Divide and Conquer, Sorting, Counting</description></item><item><title>174. 地下城游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0174-dungeon-game/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0174-dungeon-game/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>179. 最大数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0179-largest-number/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0179-largest-number/</guid><description>Medium | Array, String, Greedy, Sorting</description></item><item><title>18. 四数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0018-4sum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0018-4sum/</guid><description>Medium | Array, Two Pointers, Sorting</description></item><item><title>188. 买卖股票的最佳时机 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0188-best-time-to-buy-and-sell-stock-iv/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0188-best-time-to-buy-and-sell-stock-iv/</guid><description>Hard | Array, Dynamic Programming</description></item><item><title>189. 轮转数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0189-rotate-array/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0189-rotate-array/</guid><description>Medium | Array, Math, Two Pointers</description></item><item><title>198. 打家劫舍</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0198-house-robber/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0198-house-robber/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>200. 岛屿数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0200-number-of-islands/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0200-number-of-islands/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>204. 计数质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0204-count-primes/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0204-count-primes/</guid><description>Medium | Array, Math, Enumeration, Number Theory</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>212. 单词搜索 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0212-word-search-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0212-word-search-ii/</guid><description>Hard | Array, String, Backtracking, Trie, Matrix</description></item><item><title>213. 打家劫舍 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0213-house-robber-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0213-house-robber-ii/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>215. 数组中的第K个最大元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0215-kth-largest-element-in-an-array/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0215-kth-largest-element-in-an-array/</guid><description>Medium | Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect</description></item><item><title>216. 组合总和 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0216-combination-sum-iii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0216-combination-sum-iii/</guid><description>Medium | Array, Backtracking</description></item><item><title>217. 存在重复元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0217-contains-duplicate/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0217-contains-duplicate/</guid><description>Easy | Array, Hash Table, Sorting</description></item><item><title>218. 天际线问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/</guid><description>Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set</description></item><item><title>219. 存在重复元素 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0219-contains-duplicate-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0219-contains-duplicate-ii/</guid><description>Easy | Array, Hash Table, Sliding Window</description></item><item><title>220. 存在重复元素 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0220-contains-duplicate-iii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0220-contains-duplicate-iii/</guid><description>Hard | Array, Sliding Window, Sorting, Bucket Sort, Ordered Set</description></item><item><title>228. 汇总区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0228-summary-ranges/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0228-summary-ranges/</guid><description>Easy | Array</description></item><item><title>229. 多数元素 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0229-majority-element-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0229-majority-element-ii/</guid><description>Medium | Array, Hash Table, Sorting, Counting</description></item><item><title>238. 除自身以外数组的乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0238-product-of-array-except-self/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0238-product-of-array-except-self/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>239. 滑动窗口最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0239-sliding-window-maximum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0239-sliding-window-maximum/</guid><description>Hard | Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue</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>26. 删除有序数组中的重复项</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0026-remove-duplicates-from-sorted-array/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0026-remove-duplicates-from-sorted-array/</guid><description>Easy | Array, Two Pointers</description></item><item><title>260. 只出现一次的数字 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0260-single-number-iii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0260-single-number-iii/</guid><description>Medium | Array, Bit Manipulation</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>27. 移除元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0027-remove-element/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0027-remove-element/</guid><description>Easy | Array, Two Pointers</description></item><item><title>274. H 指数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0274-h-index/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0274-h-index/</guid><description>Medium | Array, Sorting, Counting Sort</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>283. 移动零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0283-move-zeroes/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0283-move-zeroes/</guid><description>Easy | Array, Two Pointers</description></item><item><title>284. 支持预览功能的迭代器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0284-peeking-iterator/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0284-peeking-iterator/</guid><description>Medium | Array, Design, Iterator</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>303. 区间和检索 - 数组不可变</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0303-range-sum-query-immutable/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0303-range-sum-query-immutable/</guid><description>Easy | Array, Design, Prefix Sum</description></item><item><title>304. 二维区域和检索 - 矩阵不可变</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0304-range-sum-query-2d-immutable/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0304-range-sum-query-2d-immutable/</guid><description>Medium | Array, Design, Matrix, Prefix Sum</description></item><item><title>307. 区域和检索 - 数组可修改</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0307-range-sum-query-mutable/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0307-range-sum-query-mutable/</guid><description>Medium | Array, Divide and Conquer, Design, Binary Indexed Tree, Segment Tree</description></item><item><title>309. 买卖股票的最佳时机含冷冻期</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0309-best-time-to-buy-and-sell-stock-with-cooldown/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0309-best-time-to-buy-and-sell-stock-with-cooldown/</guid><description>Medium | Array, Dynamic Programming</description></item><item><title>31. 下一个排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0031-next-permutation/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0031-next-permutation/</guid><description>Medium | Array, Two Pointers</description></item><item><title>312. 戳气球</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0312-burst-balloons/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0312-burst-balloons/</guid><description>Hard | Array, 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>39. 组合总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0039-combination-sum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0039-combination-sum/</guid><description>Medium | Array, Backtracking</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>40. 组合总和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0040-combination-sum-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0040-combination-sum-ii/</guid><description>Medium | Array, Backtracking</description></item><item><title>41. 第一个缺失的正数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0041-first-missing-positive/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0041-first-missing-positive/</guid><description>Hard | Array, Hash Table</description></item><item><title>42. 接雨水</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0042-trapping-rain-water/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0042-trapping-rain-water/</guid><description>Hard | Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack</description></item><item><title>45. 跳跃游戏 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0045-jump-game-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0045-jump-game-ii/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>46. 全排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0046-permutations/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0046-permutations/</guid><description>Medium | Array, Backtracking</description></item><item><title>47. 全排列 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0047-permutations-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0047-permutations-ii/</guid><description>Medium | Array, Backtracking, Sorting</description></item><item><title>48. 旋转图像</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0048-rotate-image/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0048-rotate-image/</guid><description>Medium | Array, Math, Matrix</description></item><item><title>49. 字母异位词分组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0049-group-anagrams/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0049-group-anagrams/</guid><description>Medium | Array, Hash Table, String, Sorting</description></item><item><title>51. N皇后</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0051-n-queens/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0051-n-queens/</guid><description>Hard | Array, Backtracking</description></item><item><title>53. 最大子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0053-maximum-subarray/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0053-maximum-subarray/</guid><description>Medium | Array, Divide and Conquer, Dynamic Programming</description></item><item><title>54. 螺旋矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0054-spiral-matrix/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0054-spiral-matrix/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>55. 跳跃游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0055-jump-game/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0055-jump-game/</guid><description>Medium | Array, Dynamic Programming, Greedy</description></item><item><title>56. 合并区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0056-merge-intervals/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0056-merge-intervals/</guid><description>Medium | Array, Sorting</description></item><item><title>57. 插入区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0057-insert-interval/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0057-insert-interval/</guid><description>Medium | Array</description></item><item><title>59. 螺旋矩阵 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0059-spiral-matrix-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0059-spiral-matrix-ii/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>63. 不同路径 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0063-unique-paths-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0063-unique-paths-ii/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>64. 最小路径和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0064-minimum-path-sum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0064-minimum-path-sum/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>66. 加一</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0066-plus-one/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0066-plus-one/</guid><description>Easy | Array, Math</description></item><item><title>68. 文本左右对齐</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0068-text-justification/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0068-text-justification/</guid><description>Hard | Array, String, Simulation</description></item><item><title>73. 矩阵置零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0073-set-matrix-zeroes/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0073-set-matrix-zeroes/</guid><description>Medium | Array, Hash Table, Matrix</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>75. 颜色分类</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0075-sort-colors/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0075-sort-colors/</guid><description>Medium | Array, Two Pointers, Sorting</description></item><item><title>78. 子集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0078-subsets/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0078-subsets/</guid><description>Medium | Array, Backtracking, Bit Manipulation</description></item><item><title>79. 单词搜索</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0079-word-search/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0079-word-search/</guid><description>Medium | Array, String, Backtracking, Depth-First Search, Matrix</description></item><item><title>80. 删除有序数组中的重复项 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0080-remove-duplicates-from-sorted-array-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0080-remove-duplicates-from-sorted-array-ii/</guid><description>Medium | Array, Two Pointers</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><item><title>84. 柱状图中最大的矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0084-largest-rectangle-in-histogram/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0084-largest-rectangle-in-histogram/</guid><description>Hard | Array, Stack, Monotonic Stack</description></item><item><title>85. 最大矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0085-maximal-rectangle/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0085-maximal-rectangle/</guid><description>Hard | Array, Dynamic Programming, Stack, Matrix, Monotonic Stack</description></item><item><title>88. 合并两个有序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0088-merge-sorted-array/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0088-merge-sorted-array/</guid><description>Easy | Array, Two Pointers, Sorting</description></item></channel></rss>