<?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>Medium on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/difficulties/medium/</link><description>Recent content in Medium 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/difficulties/medium/index.xml" rel="self" type="application/rss+xml"/><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>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>1638. 统计只差一个字符的子字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1638-count-substrings-that-differ-by-one-character/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1638-count-substrings-that-differ-by-one-character/</guid><description>Medium | Hash Table, String, Dynamic Programming, Enumeration</description></item><item><title>1657. 确定两个字符串是否接近</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1657-determine-if-two-strings-are-close/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1657-determine-if-two-strings-are-close/</guid><description>Medium | Hash Table, String, Sorting, Counting</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>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>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>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>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>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>1839. 顺序包含所有元音的最长子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1839-longest-substring-of-all-vowels-in-order/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1839-longest-substring-of-all-vowels-in-order/</guid><description>Medium | String, Sliding Window</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>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>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>1976. 到达目的地的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1976-number-of-ways-to-arrive-at-destination/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1976-number-of-ways-to-arrive-at-destination/</guid><description>Medium | Dynamic Programming, Graph Theory, Topological Sort, Shortest Path</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>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>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>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>2058. 寻找临界点之间的最小和最大距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points/</guid><description>Medium | Linked List</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>2120. 执行后缀指令</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2120-execution-of-all-suffix-instructions-staying-in-a-grid/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2120-execution-of-all-suffix-instructions-staying-in-a-grid/</guid><description>Medium | String, Simulation</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>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>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>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>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>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>2359. 寻找图中两个节点的最近汇合点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2359-find-closest-node-to-given-two-nodes/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2359-find-closest-node-to-given-two-nodes/</guid><description>Medium | Depth-First Search, Graph Theory</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>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>2400. 经过 k 步到达位置的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps/</guid><description>Medium | Math, Dynamic Programming, Combinatorics</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>7. 整数反转</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0007-reverse-integer/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0007-reverse-integer/</guid><description>Medium | Math</description></item><item><title>72. 编辑距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0072-edit-distance/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0072-edit-distance/</guid><description>Medium | String, Dynamic Programming</description></item><item><title>1003. 检查字符串是否有效</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1003-check-if-word-is-valid-after-substitutions/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1003-check-if-word-is-valid-after-substitutions/</guid><description>Medium | String, Stack</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>1129. 颜色交替的最短路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1129-shortest-path-with-alternating-colors/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1129-shortest-path-with-alternating-colors/</guid><description>Medium | Breadth-First Search, Graph Theory</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>1143. 最长公共子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1143-longest-common-subsequence/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1143-longest-common-subsequence/</guid><description>Medium | String, Dynamic Programming</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>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>131. 回文串分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0131-palindrome-partitioning/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0131-palindrome-partitioning/</guid><description>Medium | String, Dynamic Programming, Backtracking</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>1362. 最接近的因数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1362-closest-divisors/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1362-closest-divisors/</guid><description>Medium | Math</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>1405. 最长快乐字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1405-longest-happy-string/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1405-longest-happy-string/</guid><description>Medium | String, Greedy, Heap (Priority Queue)</description></item><item><title>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>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>1443. 收集树中所有苹果的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1443-minimum-time-to-collect-all-apples-in-a-tree/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1443-minimum-time-to-collect-all-apples-in-a-tree/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search</description></item><item><title>1447. 简化分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1447-simplified-fractions/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1447-simplified-fractions/</guid><description>Medium | Math, String, Number Theory</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>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>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>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>1625. 应用操作后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1625-lexicographically-smallest-string-after-applying-operations/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1625-lexicographically-smallest-string-after-applying-operations/</guid><description>Medium | String, Depth-First Search, Breadth-First Search, Enumeration</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>1915. 神奇字符串的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1915-number-of-wonderful-substrings/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1915-number-of-wonderful-substrings/</guid><description>Medium | Hash Table, String, Bit Manipulation, Prefix Sum</description></item><item><title>199. 二叉树的右视图</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0199-binary-tree-right-side-view/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0199-binary-tree-right-side-view/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</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>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>2767. 将字符串分割成最少的美丽子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2767-partition-string-into-minimum-beautiful-substrings/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2767-partition-string-into-minimum-beautiful-substrings/</guid><description>Medium | Hash Table, String, Dynamic Programming, Backtracking</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>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>2785. 字符串中的元音字母排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2785-sort-vowels-in-a-string/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2785-sort-vowels-in-a-string/</guid><description>Medium | String, 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>2787. 将整数表示为幂次之和的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2787-ways-to-express-an-integer-as-sum-of-powers/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2787-ways-to-express-an-integer-as-sum-of-powers/</guid><description>Medium | Dynamic Programming</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>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>2800. 包含三个字符串的最短字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2800-shortest-string-that-contains-three-strings/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2800-shortest-string-that-contains-three-strings/</guid><description>Medium | String, Greedy, Enumeration</description></item><item><title>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>306. 累加数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0306-additive-number/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0306-additive-number/</guid><description>Medium | String, Backtracking</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>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>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>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>38. 外观数列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0038-count-and-say/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0038-count-and-say/</guid><description>Medium | String</description></item><item><title>386. 字典序排数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0386-lexicographical-numbers/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0386-lexicographical-numbers/</guid><description>Medium | Depth-First Search, Trie</description></item><item><title>395. 至少有K个重复字符的最长子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0395-longest-substring-with-at-least-k-repeating-characters/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0395-longest-substring-with-at-least-k-repeating-characters/</guid><description>Medium | Hash Table, String, Divide and Conquer, Sliding Window</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>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>467. 环绕字符串中唯一的子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0467-unique-substrings-in-wraparound-string/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0467-unique-substrings-in-wraparound-string/</guid><description>Medium | String, Dynamic Programming</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>513. 找树左下角的值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0513-find-bottom-left-tree-value/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0513-find-bottom-left-tree-value/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>516. 最长回文子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0516-longest-palindromic-subsequence/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0516-longest-palindromic-subsequence/</guid><description>Medium | String, Dynamic Programming</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>547. 省份数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0547-number-of-provinces/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0547-number-of-provinces/</guid><description>Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</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>583. 两个字符串的删除操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0583-delete-operation-for-two-strings/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0583-delete-operation-for-two-strings/</guid><description>Medium | String, Dynamic Programming</description></item><item><title>640. 求解方程</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0640-solve-the-equation/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0640-solve-the-equation/</guid><description>Medium | Math, String, Simulation</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>677. 前缀和的映射</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0677-map-sum-pairs/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0677-map-sum-pairs/</guid><description>Medium | Hash Table, String, Design, Trie</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>712. 两个字符串的最小ASCII删除和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0712-minimum-ascii-delete-sum-for-two-strings/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0712-minimum-ascii-delete-sum-for-two-strings/</guid><description>Medium | String, Dynamic Programming</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>785. 判断二分图</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0785-is-graph-bipartite/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0785-is-graph-bipartite/</guid><description>Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</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>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>886. 可能的二分图</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0886-possible-bipartition/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0886-possible-bipartition/</guid><description>Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</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>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>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>970. 强整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0970-powerful-integers/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0970-powerful-integers/</guid><description>Medium | Hash Table, Math, Enumeration</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>988. 从叶结点开始的最小字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0988-smallest-string-starting-from-leaf/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0988-smallest-string-starting-from-leaf/</guid><description>Medium | String, Backtracking, Tree, Depth-First Search, Binary Tree</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>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>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>3211. 生成不含相邻零的二进制字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3211-generate-binary-strings-without-adjacent-zeros/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3211-generate-binary-strings-without-adjacent-zeros/</guid><description>Medium | String, Backtracking, Bit Manipulation</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>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>3223. 操作后字符串的最小长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3223-minimum-length-of-string-after-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3223-minimum-length-of-string-after-operations/</guid><description>Medium | Hash Table, String, Counting</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>3227. 字符串中的元音游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3227-vowels-game-in-a-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3227-vowels-game-in-a-string/</guid><description>Medium | Math, String, Brainteaser, Game Theory</description></item><item><title>3228. 将1移动到末尾的最大操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3228-maximum-number-of-operations-to-move-ones-to-the-end/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3228-maximum-number-of-operations-to-move-ones-to-the-end/</guid><description>Medium | String, Greedy, Counting</description></item><item><title>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>3234. 计算具有主导1的子串数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3234-count-the-number-of-substrings-with-dominant-ones/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3234-count-the-number-of-substrings-with-dominant-ones/</guid><description>Medium | String, Enumeration</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>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>3249. 统计好节点的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3249-count-the-number-of-good-nodes/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3249-count-the-number-of-good-nodes/</guid><description>Medium | Tree, Depth-First Search</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>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>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>3271. 哈希分割字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3271-hash-divided-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3271-hash-divided-string/</guid><description>Medium | String, Simulation</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>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>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>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>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>3297. 统计可以重新排列包含字符串的子字符串数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i/</guid><description>Medium | Hash Table, String, Sliding Window</description></item><item><title>3301. 最大化独特塔的总高度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3301-maximize-the-total-height-of-unique-towers/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3301-maximize-the-total-height-of-unique-towers/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3302. 找到字典序最小的有效序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3302-find-the-lexicographically-smallest-valid-sequence/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3302-find-the-lexicographically-smallest-valid-sequence/</guid><description>Medium | Two Pointers, String, Dynamic Programming, Greedy</description></item><item><title>3305. 包含所有元音字母和K个辅音字母的子串数目 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3305-count-of-substrings-containing-every-vowel-and-k-consonants-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3305-count-of-substrings-containing-every-vowel-and-k-consonants-i/</guid><description>Medium | Hash Table, String, Sliding Window</description></item><item><title>3306. 包含每个元音和K个辅音的子字符串数目II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii/</guid><description>Medium | Hash Table, String, Sliding Window</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>3310. 移除项目中的方法</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3310-remove-methods-from-project/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3310-remove-methods-from-project/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory</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>3319. 二叉树中第 K 大的完美子树大小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3319-k-th-largest-perfect-subtree-size-in-binary-tree/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3319-k-th-largest-perfect-subtree-size-in-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Sorting, Binary Tree</description></item><item><title>3324. 找到屏幕上出现的字符串序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3324-find-the-sequence-of-strings-appeared-on-the-screen/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3324-find-the-sequence-of-strings-appeared-on-the-screen/</guid><description>Medium | String, Simulation</description></item><item><title>3325. 至少包含 K 个频次字符的子字符串数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3325-count-substrings-with-k-frequency-characters-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3325-count-substrings-with-k-frequency-characters-i/</guid><description>Medium | Hash Table, String, Sliding Window</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>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>3335. 转换后字符串中的字符总数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3335-total-characters-in-string-after-transformations-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3335-total-characters-in-string-after-transformations-i/</guid><description>Medium | Hash Table, Math, String, Dynamic Programming, Counting</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>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>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>3365. 重新排列 K 个子字符串组成目标字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3365-rearrange-k-substrings-to-form-target-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3365-rearrange-k-substrings-to-form-target-string/</guid><description>Medium | Hash Table, String, Sorting</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>3372. 连接树后最大化目标节点数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search</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>3377. 数字操作使两个整数相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/</guid><description>Medium | Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Path</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>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>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>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>3403. 从盒子中找到字典序最大的字符串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3403-find-the-lexicographically-largest-string-from-the-box-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3403-find-the-lexicographically-largest-string-from-the-box-i/</guid><description>Medium | Two Pointers, String, Enumeration</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>3408. 设计任务管理器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3408-design-task-manager/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3408-design-task-manager/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set</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>3412. 字符串的镜像分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3412-find-mirror-score-of-a-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3412-find-mirror-score-of-a-string/</guid><description>Medium | Hash Table, String, Stack, Simulation</description></item><item><title>3413. 从K个连续袋子中获得最多硬币</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3413-maximum-coins-from-k-consecutive-bags/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3413-maximum-coins-from-k-consecutive-bags/</guid><description>Medium | Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum</description></item><item><title>3419. 最小化图的最大边权重</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3419-minimize-the-maximum-edge-weight-of-graph/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3419-minimize-the-maximum-edge-weight-of-graph/</guid><description>Medium | Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Path</description></item><item><title>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>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>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>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>3443. K次改变后的最大曼哈顿距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3443-maximum-manhattan-distance-after-k-changes/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3443-maximum-manhattan-distance-after-k-changes/</guid><description>Medium | Hash Table, Math, String, Counting</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>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>3457. 吃披萨！</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3457-eat-pizzas/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3457-eat-pizzas/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3458. 选择 K 个不相交的特殊子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3458-select-k-disjoint-special-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3458-select-k-disjoint-special-substrings/</guid><description>Medium | Hash Table, String, Dynamic Programming, Greedy, Sorting</description></item><item><title>3462. 最多 K 个元素的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>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>3472. 最多 K 次操作后的最长回文子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3472-longest-palindromic-subsequence-after-at-most-k-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3472-longest-palindromic-subsequence-after-at-most-k-operations/</guid><description>Medium | String, Dynamic Programming</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>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>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>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>3499. 最大化交易后的活跃段数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3499-maximize-active-section-with-trade-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3499-maximize-active-section-with-trade-i/</guid><description>Medium | String, Enumeration</description></item><item><title>3503. 子串连接后的最长回文串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3503-longest-palindrome-after-substring-concatenation-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3503-longest-palindrome-after-substring-concatenation-i/</guid><description>Medium | Two Pointers, String, Dynamic Programming, Enumeration</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>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>3517. 最小回文重排 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3517-smallest-palindromic-rearrangement-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3517-smallest-palindromic-rearrangement-i/</guid><description>Medium | String, Sorting, Counting Sort</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>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>3528. 单位转换 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3528-unit-conversion-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3528-unit-conversion-i/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory</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>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>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>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>3543. 最大权重的K边路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3543-maximum-weighted-k-edge-path/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3543-maximum-weighted-k-edge-path/</guid><description>Medium | Hash Table, Dynamic Programming, Graph Theory</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>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>3556. 最大质数子串的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3556-sum-of-largest-prime-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3556-sum-of-largest-prime-substrings/</guid><description>Medium | Hash Table, Math, String, Sorting, Number Theory</description></item><item><title>3557. 找到最大数量的不相交子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3557-find-maximum-number-of-non-intersecting-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3557-find-maximum-number-of-non-intersecting-substrings/</guid><description>Medium | Hash Table, String, Dynamic Programming, Greedy</description></item><item><title>3558. 分配边权重的方案数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3558-number-of-ways-to-assign-edge-weights-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3558-number-of-ways-to-assign-edge-weights-i/</guid><description>Medium | Math, Tree, Depth-First Search</description></item><item><title>3561. 相邻删除后的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3561-resulting-string-after-adjacent-removals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3561-resulting-string-after-adjacent-removals/</guid><description>Medium | String, Stack, Simulation</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>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>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>3597. 分割字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3597-partition-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3597-partition-string/</guid><description>Medium | Hash Table, String, Trie, Simulation</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>3604. 有向图中到达目标的最少时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3604-minimum-time-to-reach-destination-in-directed-graph/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3604-minimum-time-to-reach-destination-in-directed-graph/</guid><description>Medium | Graph Theory, Heap (Priority Queue), Shortest Path</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>3608. K个连通分量的最小时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3608-minimum-time-for-k-connected-components/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3608-minimum-time-for-k-connected-components/</guid><description>Medium | Binary Search, Union-Find, Graph Theory, Sorting</description></item><item><title>3612. 使用特殊操作处理字符串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3612-process-string-with-special-operations-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3612-process-string-with-special-operations-i/</guid><description>Medium | String, Simulation</description></item><item><title>3613. 最小化最大组件成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3613-minimize-maximum-component-cost/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3613-minimize-maximum-component-cost/</guid><description>Medium | Binary Search, Union-Find, Graph Theory, Sorting</description></item><item><title>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>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>3627. 长度为3的子序列的最大中位数和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3627-maximum-median-sum-of-subsequences-of-size-3/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3627-maximum-median-sum-of-subsequences-of-size-3/</guid><description>Medium | Array, Math, Greedy, Sorting, Game Theory</description></item><item><title>3628. 插入一个字符后的最大子序列数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3628-maximum-number-of-subsequences-after-one-inserting/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3628-maximum-number-of-subsequences-after-one-inserting/</guid><description>Medium | String, Dynamic Programming, Greedy, Prefix Sum</description></item><item><title>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>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>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>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>3648. 覆盖网格的最少传感器数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3648-minimum-sensors-to-cover-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3648-minimum-sensors-to-cover-grid/</guid><description>Medium | Math</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>3650. 带边反转的最小代价路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3650-minimum-cost-path-with-edge-reversals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3650-minimum-cost-path-with-edge-reversals/</guid><description>Medium | Graph Theory, Heap (Priority Queue), Shortest Path</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>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>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>3669. 平衡 K 因数分解</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3669-balanced-k-factor-decomposition/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3669-balanced-k-factor-decomposition/</guid><description>Medium | Math, Backtracking, Number Theory</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>3675. 最少操作次数使字符串变为全'a'</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3675-minimum-operations-to-transform-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3675-minimum-operations-to-transform-string/</guid><description>Medium | String, Greedy</description></item><item><title>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>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>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>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>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>3694. 删除子串后可达的不同点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3694-distinct-points-reachable-after-substring-removal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3694-distinct-points-reachable-after-substring-removal/</guid><description>Medium | Hash Table, String, Sliding Window, Prefix Sum</description></item><item><title>3698. 最小差值分割数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3698-split-array-with-minimum-difference/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3698-split-array-with-minimum-difference/</guid><description>Medium | Array, Prefix Sum</description></item><item><title>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>3703. 移除K平衡子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3703-remove-k-balanced-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3703-remove-k-balanced-substrings/</guid><description>Medium | String, Stack, Simulation</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>3713. 最长平衡子字符串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3713-longest-balanced-substring-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3713-longest-balanced-substring-i/</guid><description>Medium | Hash Table, String, Counting, Enumeration</description></item><item><title>3714. 最长平衡子串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3714-longest-balanced-substring-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3714-longest-balanced-substring-ii/</guid><description>Medium | Hash Table, String, Prefix Sum</description></item><item><title>3719. 最长平衡子数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3719-longest-balanced-subarray-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3719-longest-balanced-subarray-i/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum</description></item><item><title>3720. 字典序最小的大于目标的排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3720-lexicographically-smallest-permutation-greater-than-target/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3720-lexicographically-smallest-permutation-greater-than-target/</guid><description>Medium | Hash Table, String, Greedy, Counting, Enumeration</description></item><item><title>3722. 翻转后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3722-lexicographically-smallest-string-after-reverse/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3722-lexicographically-smallest-string-after-reverse/</guid><description>Medium | Two Pointers, Binary Search, Enumeration</description></item><item><title>3723. 最大化数字平方和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3723-maximize-sum-of-squares-of-digits/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3723-maximize-sum-of-squares-of-digits/</guid><description>Medium | Math, Greedy</description></item><item><title>3724. 使数组转换的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3724-minimum-operations-to-transform-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3724-minimum-operations-to-transform-array/</guid><description>Medium | Array, Greedy</description></item><item><title>3727. 最大交替平方和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3727-maximum-alternating-sum-of-squares/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3727-maximum-alternating-sum-of-squares/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>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>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>3733. 完成所有配送的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3733-minimum-time-to-complete-all-deliveries/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3733-minimum-time-to-complete-all-deliveries/</guid><description>Medium | Math, Binary Search</description></item><item><title>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>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>3746. 均衡移除后的最小字符串长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3746-minimum-string-length-after-balanced-removals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3746-minimum-string-length-after-balanced-removals/</guid><description>Medium | String, Stack, Counting</description></item><item><title>3747. 移除零后统计不同整数的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3747-count-distinct-integers-after-removing-zeros/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3747-count-distinct-integers-after-removing-zeros/</guid><description>Medium | Math, Dynamic Programming</description></item><item><title>3751. 区间内数字的总波动性 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3751-total-waviness-of-numbers-in-range-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3751-total-waviness-of-numbers-in-range-i/</guid><description>Medium | Math, Dynamic Programming, Enumeration</description></item><item><title>3752. 字典序最小的求和为目标值的带符号排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3752-lexicographically-smallest-negated-permutation-that-sums-to-target/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3752-lexicographically-smallest-negated-permutation-that-sums-to-target/</guid><description>Medium | Array, Math, Two Pointers, Greedy, Sorting</description></item><item><title>3755. 寻找最大平衡异或子数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3755-find-maximum-balanced-xor-subarray-length/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3755-find-maximum-balanced-xor-subarray-length/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Prefix Sum</description></item><item><title>3756. 拼接非零数字并乘以数字和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii/</guid><description>Medium | Math, String, Prefix Sum</description></item><item><title>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>3760. 具有不同起始字符的最大子串数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3760-maximum-substrings-with-distinct-start/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3760-maximum-substrings-with-distinct-start/</guid><description>Medium | Hash Table, String</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>3765. 完全质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3765-complete-prime-number/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3765-complete-prime-number/</guid><description>Medium | Math, Enumeration, Number Theory</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>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>3775. 具有相同元音数量的单词反转</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3775-reverse-words-with-same-vowel-count/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3775-reverse-words-with-same-vowel-count/</guid><description>Medium | Two Pointers, String, Simulation</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>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>3789. 获取所需物品的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3789-minimum-cost-to-acquire-required-items/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3789-minimum-cost-to-acquire-required-items/</guid><description>Medium | Math, Greedy</description></item><item><title>3790. 最小全1倍数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3790-smallest-all-ones-multiple/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3790-smallest-all-ones-multiple/</guid><description>Medium | Hash Table, Math</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>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>3800. 使两个二进制字符串相等的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3800-minimum-cost-to-make-two-binary-strings-equal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3800-minimum-cost-to-make-two-binary-strings-equal/</guid><description>Medium | String, Greedy</description></item><item><title>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>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>3815. 设计竞价系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3815-design-auction-system/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3815-design-auction-system/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set</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>3820. 树中勾股距离节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3820-pythagorean-distance-nodes-in-a-tree/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3820-pythagorean-distance-nodes-in-a-tree/</guid><description>Medium | Tree, Breadth-First Search</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>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>3829. 设计拼车系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3829-design-ride-sharing-system/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3829-design-ride-sharing-system/</guid><description>Medium | Hash Table, Design, Queue, Data Stream</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>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>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>3844. 最长几乎回文子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3844-longest-almost-palindromic-substring/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3844-longest-almost-palindromic-substring/</guid><description>Medium | Two Pointers, String, Dynamic Programming</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>3848. 检查数字阶乘排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3848-check-digitorial-permutation/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3848-check-digitorial-permutation/</guid><description>Medium | Math, Counting</description></item><item><title>3849. 重新排列后的最大按位异或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3849-maximum-bitwise-xor-after-rearrangement/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3849-maximum-bitwise-xor-after-rearrangement/</guid><description>Medium | String, Greedy, Bit Manipulation</description></item><item><title>3853. 合并相近字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3853-merge-close-characters/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3853-merge-close-characters/</guid><description>Medium | Hash Table, String</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>3857. 分解为1的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3857-minimum-cost-to-split-into-ones/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3857-minimum-cost-to-split-into-ones/</guid><description>Medium | Math, Dynamic Programming</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>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>3863. 对字符串进行排序的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3863-minimum-operations-to-sort-a-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3863-minimum-operations-to-sort-a-string/</guid><description>Medium | String</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>3871. 区间内逗号数量统计 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3871-count-commas-in-range-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3871-count-commas-in-range-ii/</guid><description>Medium | Math</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>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>3881. 有确切K个可见人的方向分配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3881-direction-assignments-with-exactly-k-visible-people/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3881-direction-assignments-with-exactly-k-visible-people/</guid><description>Medium | Math, Combinatorics</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>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>3889. 镜像频率距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3889-mirror-frequency-distance/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3889-mirror-frequency-distance/</guid><description>Medium | Hash Table, String, Counting</description></item><item><title>3890. 具有两个立方和的多重表示的整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3890-integers-with-multiple-sum-of-two-cubes/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3890-integers-with-multiple-sum-of-two-cubes/</guid><description>Medium | Hash Table, Sorting, Counting, 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>3895. 计算数字出现次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3895-count-digit-appearances/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3895-count-digit-appearances/</guid><description>Medium |</description></item><item><title>3896. 将数组转换为交替质数的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3896-minimum-operations-to-transform-array-into-alternating-prime/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3896-minimum-operations-to-transform-array-into-alternating-prime/</guid><description>Medium |</description></item><item><title>3899. 三角形的角度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3899-angles-of-a-triangle/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3899-angles-of-a-triangle/</guid><description>Medium |</description></item><item><title>3900. 经过一次交换后的最长平衡子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3900-longest-balanced-substring-after-one-swap/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3900-longest-balanced-substring-after-one-swap/</guid><description>Medium |</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>2966. 将数组按最大差值分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2966-divide-array-into-arrays-with-max-difference/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2966-divide-array-into-arrays-with-max-difference/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2967. 使数组成为等回文数组的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2967-minimum-cost-to-make-array-equalindromic/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2967-minimum-cost-to-make-array-equalindromic/</guid><description>Medium | Array, Math, Binary Search, Greedy, Sorting</description></item><item><title>2971. 寻找周长最大的多边形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2971-find-polygon-with-the-largest-perimeter/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2971-find-polygon-with-the-largest-perimeter/</guid><description>Medium | Array, Greedy, Sorting, Prefix Sum</description></item><item><title>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>2981. 找出至少出现三次的最长特殊子字符串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2981-find-longest-special-substring-that-occurs-thrice-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2981-find-longest-special-substring-that-occurs-thrice-i/</guid><description>Medium | Hash Table, String, Binary Search, Sliding Window, Counting</description></item><item><title>2982. 找出出现至少三次的最长特殊子字符串 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2982-find-longest-special-substring-that-occurs-thrice-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2982-find-longest-special-substring-that-occurs-thrice-ii/</guid><description>Medium | Hash Table, String, Binary Search, Sliding Window, Counting</description></item><item><title>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>2998. 使 X 和 Y 相等的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2998-minimum-number-of-operations-to-make-x-and-y-equal/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2998-minimum-number-of-operations-to-make-x-and-y-equal/</guid><description>Medium | Dynamic Programming, Breadth-First Search, Memoization</description></item><item><title>3001. 捕获棋子的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3001-minimum-moves-to-capture-the-queen/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3001-minimum-moves-to-capture-the-queen/</guid><description>Medium | Math, Enumeration</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>3006. 在给定数组中找到美丽索引 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3006-find-beautiful-indices-in-the-given-array-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3006-find-beautiful-indices-in-the-given-array-i/</guid><description>Medium | Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function</description></item><item><title>3007. 最大数字，其价格总和小于等于 K</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/</guid><description>Medium | Math, Binary Search, Dynamic Programming, Bit Manipulation</description></item><item><title>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>3015. 统计特定距离的房屋数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3015-count-the-number-of-houses-at-a-certain-distance-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3015-count-the-number-of-houses-at-a-certain-distance-i/</guid><description>Medium | Breadth-First Search, Graph Theory, Prefix Sum</description></item><item><title>3016. 输入单词的最少按键次数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3016-minimum-number-of-pushes-to-type-word-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3016-minimum-number-of-pushes-to-type-word-ii/</guid><description>Medium | Hash Table, String, Greedy, Sorting, Counting</description></item><item><title>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>3021. 爱丽丝和鲍勃玩花朵游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3021-alice-and-bob-playing-flower-game/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3021-alice-and-bob-playing-flower-game/</guid><description>Medium | Math</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>3029. 使单词恢复初始状态所需的最短时间 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3029-minimum-time-to-revert-word-to-initial-state-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3029-minimum-time-to-revert-word-to-initial-state-i/</guid><description>Medium | String, Rolling Hash, String Matching, Hash Function</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>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>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>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>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>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>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>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>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>3081. 替换字符串中的问号使其值最小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3081-replace-question-marks-in-string-to-minimize-its-value/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3081-replace-question-marks-in-string-to-minimize-its-value/</guid><description>Medium | Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting</description></item><item><title>3084. 统计以给定字符开头和结尾的子字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3084-count-substrings-starting-and-ending-with-given-character/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3084-count-substrings-starting-and-ending-with-given-character/</guid><description>Medium | Math, String, Counting</description></item><item><title>3085. 使字符串 K-特殊的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3085-minimum-deletions-to-make-string-k-special/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3085-minimum-deletions-to-make-string-k-special/</guid><description>Medium | Hash Table, String, Greedy, Sorting, Counting</description></item><item><title>3091. 使数组和大于等于 k 的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3091-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3091-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/</guid><description>Medium | Math, Greedy, Enumeration</description></item><item><title>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>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>3100. 水瓶 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3100-water-bottles-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3100-water-bottles-ii/</guid><description>Medium | Math, Simulation</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>3106. 约束条件下字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3106-lexicographically-smallest-string-after-operations-with-constraint/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3106-lexicographically-smallest-string-after-operations-with-constraint/</guid><description>Medium | String, Greedy</description></item><item><title>3107. 使数组中位数等于 K 的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3107-minimum-operations-to-make-median-of-array-equal-to-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3107-minimum-operations-to-make-median-of-array-equal-to-k/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>3111. 覆盖点的最小矩形数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3111-minimum-rectangles-to-cover-points/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3111-minimum-rectangles-to-cover-points/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>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>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>3121. 特殊字符计数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3121-count-the-number-of-special-characters-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3121-count-the-number-of-special-characters-ii/</guid><description>Medium | Hash Table, String</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>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>3129. 寻找所有可能的稳定二进制数组 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3129-find-all-possible-stable-binary-arrays-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3129-find-all-possible-stable-binary-arrays-i/</guid><description>Medium | Dynamic Programming, Prefix Sum</description></item><item><title>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>3133. 最小数组末尾值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3133-minimum-array-end/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3133-minimum-array-end/</guid><description>Medium | Bit Manipulation</description></item><item><title>3137. 使单词变为 K 周期字符串的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3137-minimum-number-of-operations-to-make-word-k-periodic/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3137-minimum-number-of-operations-to-make-word-k-periodic/</guid><description>Medium | Hash Table, String, Counting</description></item><item><title>3138. 字母异位词连接的最小长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3138-minimum-length-of-anagram-concatenation/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3138-minimum-length-of-anagram-concatenation/</guid><description>Medium | Hash Table, String, Counting</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>3144. 等频字符子串的最小分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3144-minimum-substring-partition-of-equal-character-frequency/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3144-minimum-substring-partition-of-equal-character-frequency/</guid><description>Medium | Hash Table, String, Dynamic Programming, Counting</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>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>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>3163. 字符串压缩 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3163-string-compression-iii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3163-string-compression-iii/</guid><description>Medium | String</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>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>3170. 移除星号后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3170-lexicographically-minimum-string-after-removing-stars/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3170-lexicographically-minimum-string-after-removing-stars/</guid><description>Medium | Hash Table, String, Stack, Greedy, Heap (Priority Queue)</description></item><item><title>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>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>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>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>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>2641. 二叉树中的表兄弟节点 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2641-cousins-in-binary-tree-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2641-cousins-in-binary-tree-ii/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>2645. 构造有效字符串的最少插入次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2645-minimum-additions-to-make-valid-string/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2645-minimum-additions-to-make-valid-string/</guid><description>Medium | String, Dynamic Programming, Stack, Greedy</description></item><item><title>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>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>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>2671. 频率跟踪器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2671-frequency-tracker/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2671-frequency-tracker/</guid><description>Medium | Hash Table, Design</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>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>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>2685. 统计完全连通分量的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2685-count-the-number-of-complete-components/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2685-count-the-number-of-complete-components/</guid><description>Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</description></item><item><title>2698. 找到整数的惩罚数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2698-find-the-punishment-number-of-an-integer/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2698-find-the-punishment-number-of-an-integer/</guid><description>Medium | Math, Backtracking</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>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>2712. 使所有字符相等的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2712-minimum-cost-to-make-all-characters-equal/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2712-minimum-cost-to-make-all-characters-equal/</guid><description>Medium | String, Dynamic Programming, Greedy</description></item><item><title>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>2730. 寻找最长的半重复子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2730-find-the-longest-semi-repetitive-substring/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2730-find-the-longest-semi-repetitive-substring/</guid><description>Medium | String, Sliding Window</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>2734. 子串操作后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2734-lexicographically-smallest-string-after-substring-operation/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2734-lexicographically-smallest-string-after-substring-operation/</guid><description>Medium | String, Greedy</description></item><item><title>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>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>2745. 构造最长的新字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2745-construct-the-longest-new-string/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2745-construct-the-longest-new-string/</guid><description>Medium | Math, Dynamic Programming, Greedy, Brainteaser</description></item><item><title>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>2749. 使整数变为零的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2749-minimum-operations-to-make-the-integer-zero/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2749-minimum-operations-to-make-the-integer-zero/</guid><description>Medium | Bit Manipulation, Brainteaser, Enumeration</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>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>2807. 在链表中插入最大公约数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2807-insert-greatest-common-divisors-in-linked-list/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2807-insert-greatest-common-divisors-in-linked-list/</guid><description>Medium | Linked List, Math, Number Theory</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>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>2816. 将链表表示的数字翻倍</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2816-double-a-number-represented-as-a-linked-list/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2816-double-a-number-represented-as-a-linked-list/</guid><description>Medium | Linked List, Math, Stack</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>2825. 通过循环递增使字符串成为子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2825-make-string-a-subsequence-using-cyclic-increments/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2825-make-string-a-subsequence-using-cyclic-increments/</guid><description>Medium | Two Pointers, String</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>2829. 确定 k-避免数组的最小和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2829-determine-the-minimum-sum-of-a-k-avoiding-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2829-determine-the-minimum-sum-of-a-k-avoiding-array/</guid><description>Medium | Math, Greedy</description></item><item><title>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>2834. 找到美丽数组的最小可能和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2834-find-the-minimum-possible-sum-of-a-beautiful-array/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2834-find-the-minimum-possible-sum-of-a-beautiful-array/</guid><description>Medium | Math, Greedy</description></item><item><title>2840. 检查字符串是否可以通过操作 II 使相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2840-check-if-strings-can-be-made-equal-with-operations-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2840-check-if-strings-can-be-made-equal-with-operations-ii/</guid><description>Medium | Hash Table, String, Sorting</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>2844. 形成特殊数字的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2844-minimum-operations-to-make-a-special-number/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2844-minimum-operations-to-make-a-special-number/</guid><description>Medium | Math, String, Greedy, Enumeration</description></item><item><title>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>2849. 判断在给定时间内是否能到达某个单元格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2849-determine-if-a-cell-is-reachable-at-a-given-time/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2849-determine-if-a-cell-is-reachable-at-a-given-time/</guid><description>Medium | Math</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>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>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>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>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>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>2896. 应用操作使两个字符串相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2896-apply-operations-to-make-two-strings-equal/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2896-apply-operations-to-make-two-strings-equal/</guid><description>Medium | String, Dynamic Programming</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>2904. 最短且字典序最小的美丽子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2904-shortest-and-lexicographically-smallest-beautiful-string/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2904-shortest-and-lexicographically-smallest-beautiful-string/</guid><description>Medium | String, Sliding Window</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>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>2914. 使二进制字符串变美丽的最小更改次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2914-minimum-number-of-changes-to-make-binary-string-beautiful/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2914-minimum-number-of-changes-to-make-binary-string-beautiful/</guid><description>Medium | String</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>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>2924. 寻找冠军 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2924-find-champion-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2924-find-champion-ii/</guid><description>Medium | Graph Theory</description></item><item><title>2925. 对树进行操作后的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2925-maximum-score-after-applying-operations-on-a-tree/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2925-maximum-score-after-applying-operations-on-a-tree/</guid><description>Medium | Dynamic Programming, Tree, Depth-First Search</description></item><item><title>2929. 在孩子们之间分发糖果 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2929-distribute-candies-among-children-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2929-distribute-candies-among-children-ii/</guid><description>Medium | Math, Combinatorics, Enumeration</description></item><item><title>2930. 可以重新排列得到子字符串的字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2930-number-of-strings-which-can-be-rearranged-to-contain-substring/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2930-number-of-strings-which-can-be-rearranged-to-contain-substring/</guid><description>Medium | Math, Dynamic Programming, Combinatorics</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>2938. 分离黑白球</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2938-separate-black-and-white-balls/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2938-separate-black-and-white-balls/</guid><description>Medium | Two Pointers, String, Greedy</description></item><item><title>2939. 最大异或乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2939-maximum-xor-product/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2939-maximum-xor-product/</guid><description>Medium | Math, Greedy, Bit Manipulation</description></item><item><title>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>2947. 统计美丽子字符串 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2947-count-beautiful-substrings-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2947-count-beautiful-substrings-i/</guid><description>Medium | Hash Table, Math, String, Enumeration, Number Theory, Prefix Sum</description></item><item><title>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>2952. 需要添加的硬币的最小数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2952-minimum-number-of-coins-to-be-added/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2952-minimum-number-of-coins-to-be-added/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>2957. 移除相邻几乎相等字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2957-remove-adjacent-almost-equal-characters/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2957-remove-adjacent-almost-equal-characters/</guid><description>Medium | String, Dynamic Programming, Greedy</description></item><item><title>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>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>2002. 两个回文子序列长度的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2002-maximum-product-of-the-length-of-two-palindromic-subsequences/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2002-maximum-product-of-the-length-of-two-palindromic-subsequences/</guid><description>Medium | String, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask</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>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>2017. 网格游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2017-grid-game/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2017-grid-game/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2024. 最大化考试的困惑度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2024-maximize-the-confusion-of-an-exam/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2024-maximize-the-confusion-of-an-exam/</guid><description>Medium | String, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>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>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>2034. 股票价格波动</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2034-stock-price-fluctuation/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2034-stock-price-fluctuation/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set</description></item><item><title>2038. 移除相同颜色的相邻棋子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color/</guid><description>Medium | Math, String, Greedy, Game Theory</description></item><item><title>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>2048. 下一个数值平衡数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2048-next-greater-numerically-balanced-number/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2048-next-greater-numerically-balanced-number/</guid><description>Medium | Hash Table, Math, Backtracking, Counting, 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>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>2063. 所有子串的元音数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2063-vowels-of-all-substrings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2063-vowels-of-all-substrings/</guid><description>Medium | Math, String, Dynamic Programming, Combinatorics</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>2069. 行走机器人模拟 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2069-walking-robot-simulation-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2069-walking-robot-simulation-ii/</guid><description>Medium | Design, Simulation</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>2074. 反转偶数长度组的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2074-reverse-nodes-in-even-length-groups/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2074-reverse-nodes-in-even-length-groups/</guid><description>Medium | Linked List</description></item><item><title>2075. 解码倾斜密码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2075-decode-the-slanted-ciphertext/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2075-decode-the-slanted-ciphertext/</guid><description>Medium | String, Simulation</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>2086. 喂养仓鼠的最少食物桶数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2086-minimum-number-of-food-buckets-to-feed-the-hamsters/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2086-minimum-number-of-food-buckets-to-feed-the-hamsters/</guid><description>Medium | String, Dynamic Programming, Greedy</description></item><item><title>2087. 网格中机器人的最小代价回家路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2087-minimum-cost-homecoming-of-a-robot-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2087-minimum-cost-homecoming-of-a-robot-in-a-grid/</guid><description>Medium | Array, Greedy</description></item><item><title>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>2095. 删除链表的中间节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2095-delete-the-middle-node-of-a-linked-list/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2095-delete-the-middle-node-of-a-linked-list/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>2096. 二叉树中从一个节点到另一个节点的逐步指令</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2096-step-by-step-directions-from-a-binary-tree-node-to-another/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2096-step-by-step-directions-from-a-binary-tree-node-to-another/</guid><description>Medium | String, Tree, Depth-First Search, Binary Tree</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>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>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>2116. 检查括号字符串是否可以有效</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2116-check-if-a-parentheses-string-can-be-valid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2116-check-if-a-parentheses-string-can-be-valid/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>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>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>2130. 链表的最大孪生和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2130-maximum-twin-sum-of-a-linked-list/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2130-maximum-twin-sum-of-a-linked-list/</guid><description>Medium | Linked List, Two Pointers, Stack</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>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>2139. 达到目标分数的最小移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2139-minimum-moves-to-reach-target-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2139-minimum-moves-to-reach-target-score/</guid><description>Medium | Math, Greedy</description></item><item><title>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>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>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>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>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>2162. 设置烹饪时间的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2162-minimum-cost-to-set-cooking-time/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2162-minimum-cost-to-set-cooking-time/</guid><description>Medium | Math, Enumeration</description></item><item><title>2165. 重新排列后的最小值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2165-smallest-value-of-the-rearranged-number/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2165-smallest-value-of-the-rearranged-number/</guid><description>Medium | Math, 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>2177. 找到和为给定数字的三个连续整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2177-find-three-consecutive-integers-that-sum-to-a-given-number/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2177-find-three-consecutive-integers-that-sum-to-a-given-number/</guid><description>Medium | Math, Simulation</description></item><item><title>2178. 正偶数的最大分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2178-maximum-split-of-positive-even-integers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2178-maximum-split-of-positive-even-integers/</guid><description>Medium | Math, Backtracking, Greedy</description></item><item><title>2181. 合并零之间的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2181-merge-nodes-in-between-zeros/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2181-merge-nodes-in-between-zeros/</guid><description>Medium | Linked List, Simulation</description></item><item><title>2182. 构造限制重复的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2182-construct-string-with-repeat-limit/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2182-construct-string-with-repeat-limit/</guid><description>Medium | Hash Table, String, Greedy, Heap (Priority Queue), Counting</description></item><item><title>2186. 使两字符串互为字母异位词的最少步骤数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2186-minimum-number-of-steps-to-make-two-strings-anagram-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2186-minimum-number-of-steps-to-make-two-strings-anagram-ii/</guid><description>Medium | Hash Table, String, Counting</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>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>2192. 有向无环图中一个节点的所有祖先</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort</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>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>2207. 最大化字符串中子序列的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2207-maximize-number-of-subsequences-in-a-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2207-maximize-number-of-subsequences-in-a-string/</guid><description>Medium | String, Greedy, Prefix Sum</description></item><item><title>2208. 数组元素减半的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2208-minimum-operations-to-halve-array-sum/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2208-minimum-operations-to-halve-array-sum/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>2211. 道路上的碰撞次数统计</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2211-count-collisions-on-a-road/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2211-count-collisions-on-a-road/</guid><description>Medium | String, Stack, Simulation</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>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>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>2222. 选择建筑物的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2222-number-of-ways-to-select-buildings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2222-number-of-ways-to-select-buildings/</guid><description>Medium | String, Dynamic Programming, Prefix Sum</description></item><item><title>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>2232. 通过添加括号使表达式结果最小化</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2232-minimize-result-by-adding-parentheses-to-expression/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2232-minimize-result-by-adding-parentheses-to-expression/</guid><description>Medium | String, Enumeration</description></item><item><title>2240. 购买钢笔和铅笔的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2240-number-of-ways-to-buy-pens-and-pencils/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2240-number-of-ways-to-buy-pens-and-pencils/</guid><description>Medium | Math, Enumeration</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>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>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>2265. 统计子树中节点与子树平均值相等的节点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2265-count-nodes-equal-to-average-of-subtree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2265-count-nodes-equal-to-average-of-subtree/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</description></item><item><title>2266. 统计按键次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2266-count-number-of-texts/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2266-count-number-of-texts/</guid><description>Medium | Hash Table, Math, String, Dynamic Programming</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>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>2285. 道路的最大总重要性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2285-maximum-total-importance-of-roads/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2285-maximum-total-importance-of-roads/</guid><description>Medium | Greedy, Graph Theory, Sorting, Heap (Priority Queue)</description></item><item><title>2288. 给价格打折</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2288-apply-discount-to-prices/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2288-apply-discount-to-prices/</guid><description>Medium | String</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>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>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>2310. 个位数字为 K 的整数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2310-sum-of-numbers-with-units-digit-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2310-sum-of-numbers-with-units-digit-k/</guid><description>Medium | Math, Dynamic Programming, Greedy, Enumeration</description></item><item><title>2311. 最长的小于等于 K 的二进制子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2311-longest-binary-subsequence-less-than-or-equal-to-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2311-longest-binary-subsequence-less-than-or-equal-to-k/</guid><description>Medium | String, Dynamic Programming, Greedy, Memoization</description></item><item><title>2316. 统计无向图中无法互相到达的点对数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph/</guid><description>Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</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>2320. 统计放置房屋的方式数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2320-count-number-of-ways-to-place-houses/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2320-count-number-of-ways-to-place-houses/</guid><description>Medium | Dynamic Programming</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>2327. 知道秘密的人数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2327-number-of-people-aware-of-a-secret/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2327-number-of-people-aware-of-a-secret/</guid><description>Medium | Dynamic Programming, Queue, Simulation</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>2336. 无限集中的最小数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2336-smallest-number-in-infinite-set/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2336-smallest-number-in-infinite-set/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>2337. 移动片段得到字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2337-move-pieces-to-obtain-a-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2337-move-pieces-to-obtain-a-string/</guid><description>Medium | Two Pointers, String</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>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>2349. 设计数字容器系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2349-design-a-number-container-system/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2349-design-a-number-container-system/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set</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>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>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>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>2370. 最长理想子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2370-longest-ideal-subsequence/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2370-longest-ideal-subsequence/</guid><description>Medium | Hash Table, String, Dynamic Programming</description></item><item><title>2374. 具有最高边分数的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2374-node-with-highest-edge-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2374-node-with-highest-edge-score/</guid><description>Medium | Hash Table, Graph Theory</description></item><item><title>2375. 根据DI字符串构造最小数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2375-construct-smallest-number-from-di-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2375-construct-smallest-number-from-di-string/</guid><description>Medium | String, Backtracking, Stack, Greedy</description></item><item><title>2380. 重新排列二进制字符串的时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2380-time-needed-to-rearrange-a-binary-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2380-time-needed-to-rearrange-a-binary-string/</guid><description>Medium | String, Dynamic Programming, Simulation</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>2384. 最大回文数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2384-largest-palindromic-number/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2384-largest-palindromic-number/</guid><description>Medium | Hash Table, String, Greedy, Counting</description></item><item><title>2385. 二叉树感染需要的时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2385-amount-of-time-for-binary-tree-to-be-infected/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2385-amount-of-time-for-binary-tree-to-be-infected/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>2390. 移除字符串中的星号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2390-removing-stars-from-a-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2390-removing-stars-from-a-string/</guid><description>Medium | String, Stack, Simulation</description></item><item><title>2396. 严格回文数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2396-strictly-palindromic-number/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2396-strictly-palindromic-number/</guid><description>Medium | Math, Two Pointers, Brainteaser</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>2405. 字符串的最优分割</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2405-optimal-partition-of-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2405-optimal-partition-of-string/</guid><description>Medium | Hash Table, String, Greedy</description></item><item><title>2406. 将区间分为最少组数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2406-divide-intervals-into-minimum-number-of-groups/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2406-divide-intervals-into-minimum-number-of-groups/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum</description></item><item><title>2410. 玩家和训练师的最大匹配数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2410-maximum-matching-of-players-with-trainers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2410-maximum-matching-of-players-with-trainers/</guid><description>Medium | Array, Two Pointers, Greedy, Sorting</description></item><item><title>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>2414. 最长字母序连续子字符串的长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2414-length-of-the-longest-alphabetical-continuous-substring/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2414-length-of-the-longest-alphabetical-continuous-substring/</guid><description>Medium | String</description></item><item><title>2415. 反转二叉树奇数层</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2415-reverse-odd-levels-of-binary-tree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2415-reverse-odd-levels-of-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</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>2424. 最长上传前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/</guid><description>Medium | Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Set</description></item><item><title>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>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>2429. 最小化异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2429-minimize-xor/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2429-minimize-xor/</guid><description>Medium | Greedy, Bit Manipulation</description></item><item><title>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>2434. 使用机器人打印字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2434-using-a-robot-to-print-the-lexicographically-smallest-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2434-using-a-robot-to-print-the-lexicographically-smallest-string/</guid><description>Medium | Hash Table, String, Stack, Greedy</description></item><item><title>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>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>2443. 数字及其反转的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2443-sum-of-number-and-its-reverse/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2443-sum-of-number-and-its-reverse/</guid><description>Medium | Math, Enumeration</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>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>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>2457. 使整数变美丽的最小增量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2457-minimum-addition-to-make-integer-beautiful/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2457-minimum-addition-to-make-integer-beautiful/</guid><description>Medium | Math, Greedy</description></item><item><title>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>2466. 统计构造好字符串的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2466-count-ways-to-build-good-strings/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2466-count-ways-to-build-good-strings/</guid><description>Medium | Dynamic Programming</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>2471. 按层排序二叉树所需的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level/</guid><description>Medium | Tree, Breadth-First Search, Binary Tree</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>2477. 到达首都的最少燃料成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2477-minimum-fuel-cost-to-report-to-the-capital/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2477-minimum-fuel-cost-to-report-to-the-capital/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Graph Theory</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>2483. 商店的最小罚金</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2483-minimum-penalty-for-a-shop/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2483-minimum-penalty-for-a-shop/</guid><description>Medium | String, Prefix Sum</description></item><item><title>2486. 追加字符以形成子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2486-append-characters-to-string-to-make-subsequence/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2486-append-characters-to-string-to-make-subsequence/</guid><description>Medium | Two Pointers, String, Greedy</description></item><item><title>2487. 从链表中移除节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2487-remove-nodes-from-linked-list/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2487-remove-nodes-from-linked-list/</guid><description>Medium | Linked List, Stack, Recursion, Monotonic Stack</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>2492. 两座城市间路径的最小分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2492-minimum-score-of-a-path-between-two-cities/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2492-minimum-score-of-a-path-between-two-cities/</guid><description>Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</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>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>2507. 质因数分解后的最小值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2507-smallest-value-after-replacing-with-sum-of-prime-factors/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2507-smallest-value-after-replacing-with-sum-of-prime-factors/</guid><description>Medium | Math, Simulation, Number Theory</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>2513. 最小化两个数组的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2513-minimize-the-maximum-of-two-arrays/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2513-minimize-the-maximum-of-two-arrays/</guid><description>Medium | Math, Binary Search, Number Theory</description></item><item><title>2516. 从左右两侧取K个字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2516-take-k-of-each-character-from-left-and-right/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2516-take-k-of-each-character-from-left-and-right/</guid><description>Medium | Hash Table, String, Sliding Window</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>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>2522. 将字符串分割为最多 K 值的子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2522-partition-string-into-substrings-with-values-at-most-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2522-partition-string-into-substrings-with-values-at-most-k/</guid><description>Medium | String, Dynamic Programming, Greedy</description></item><item><title>2523. 区间内最近的两个质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2523-closest-prime-numbers-in-range/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2523-closest-prime-numbers-in-range/</guid><description>Medium | Math, Number Theory</description></item><item><title>2526. 从数据流中查找连续整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2526-find-consecutive-integers-from-a-data-stream/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2526-find-consecutive-integers-from-a-data-stream/</guid><description>Medium | Hash Table, Design, Queue, Counting, Data Stream</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>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>2531. 使不同字符数量相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2531-make-number-of-distinct-characters-equal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2531-make-number-of-distinct-characters-equal/</guid><description>Medium | Hash Table, String, Counting</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>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>2546. 应用按位运算使字符串相等</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2546-apply-bitwise-operations-to-make-strings-equal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2546-apply-bitwise-operations-to-make-strings-equal/</guid><description>Medium | String, Bit Manipulation</description></item><item><title>2550. 猴子碰撞的方法数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2550-count-collisions-of-monkeys-on-a-polygon/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2550-count-collisions-of-monkeys-on-a-polygon/</guid><description>Medium | Math, Recursion</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>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>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>2571. 使整数减为 0 的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2571-minimum-operations-to-reduce-an-integer-to-0/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2571-minimum-operations-to-reduce-an-integer-to-0/</guid><description>Medium | Dynamic Programming, Greedy, Bit Manipulation</description></item><item><title>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>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>2579. 统计有色格子数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2579-count-total-number-of-colored-cells/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2579-count-total-number-of-colored-cells/</guid><description>Medium | Math</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>2583. 二叉树中的第K大层和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2583-kth-largest-sum-in-a-binary-tree/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2583-kth-largest-sum-in-a-binary-tree/</guid><description>Medium | Tree, Breadth-First Search, Sorting, Binary Tree</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>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>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>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>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>1286. 组合迭代器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1286-iterator-for-combination/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1286-iterator-for-combination/</guid><description>Medium | String, Backtracking, Design, Iterator</description></item><item><title>1291. 顺次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1291-sequential-digits/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1291-sequential-digits/</guid><description>Medium | Enumeration</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>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>1297. 子串的最大出现次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1297-maximum-number-of-occurrences-of-a-substring/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1297-maximum-number-of-occurrences-of-a-substring/</guid><description>Medium | Hash Table, String, Sliding Window</description></item><item><title>1302. 最深叶节点的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1302-deepest-leaves-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1302-deepest-leaves-sum/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>1305. 两棵二叉搜索树中的所有元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1305-all-elements-in-two-binary-search-trees/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1305-all-elements-in-two-binary-search-trees/</guid><description>Medium | Tree, Depth-First Search, Binary Search Tree, Sorting, Binary Tree</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>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>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>1315. 祖父节点值为偶数的节点和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1315-sum-of-nodes-with-even-valued-grandparent/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1315-sum-of-nodes-with-even-valued-grandparent/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>1318. 使 a OR b 等于 c 的最小翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1318-minimum-flips-to-make-a-or-b-equal-to-c/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1318-minimum-flips-to-make-a-or-b-equal-to-c/</guid><description>Medium | Bit Manipulation</description></item><item><title>1319. 连通网络的操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1319-number-of-operations-to-make-network-connected/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1319-number-of-operations-to-make-network-connected/</guid><description>Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</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>1325. 删除给定值的叶子节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1325-delete-leaves-with-a-given-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1325-delete-leaves-with-a-given-value/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</description></item><item><title>1328. 破坏回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1328-break-a-palindrome/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1328-break-a-palindrome/</guid><description>Medium | String, Greedy</description></item><item><title>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>1334. 在阈值距离内邻居最少的城市</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/</guid><description>Medium | Dynamic Programming, Graph Theory, Shortest Path</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>1339. 分裂二叉树的最大乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1339-maximum-product-of-splitted-binary-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1339-maximum-product-of-splitted-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</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>1344. 时钟指针的夹角</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1344-angle-between-hands-of-a-clock/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1344-angle-between-hands-of-a-clock/</guid><description>Medium | Math</description></item><item><title>1347. 制造字母异位词的最小步骤数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1347-minimum-number-of-steps-to-make-two-strings-anagram/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1347-minimum-number-of-steps-to-make-two-strings-anagram/</guid><description>Medium | Hash Table, String, Counting</description></item><item><title>1348. 推文计数器（按频率统计）</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1348-tweet-counts-per-frequency/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1348-tweet-counts-per-frequency/</guid><description>Medium | Hash Table, String, Binary Search, Design, Sorting, Ordered Set</description></item><item><title>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>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>1358. 包含所有三种字符的子字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1358-number-of-substrings-containing-all-three-characters/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1358-number-of-substrings-containing-all-three-characters/</guid><description>Medium | Hash Table, String, Sliding Window</description></item><item><title>1361. 验证二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1361-validate-binary-tree-nodes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1361-validate-binary-tree-nodes/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Binary Tree</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>1367. 二叉树中的链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1367-linked-list-in-binary-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1367-linked-list-in-binary-tree/</guid><description>Medium | Linked List, Tree, Depth-First Search, Binary Tree</description></item><item><title>1371. 包含所有元音字母出现偶数次的最长子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1371-find-the-longest-substring-containing-vowels-in-even-counts/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1371-find-the-longest-substring-containing-vowels-in-even-counts/</guid><description>Medium | Hash Table, String, Bit Manipulation, Prefix Sum</description></item><item><title>1372. 二叉树中的最长交错路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1372-longest-zigzag-path-in-a-binary-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1372-longest-zigzag-path-in-a-binary-tree/</guid><description>Medium | Dynamic Programming, Tree, Depth-First Search, Binary Tree</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>1376. 通知所有员工所需的时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1376-time-needed-to-inform-all-employees/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1376-time-needed-to-inform-all-employees/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search</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>1382. 平衡二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1382-balance-a-binary-search-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1382-balance-a-binary-search-tree/</guid><description>Medium | Divide and Conquer, Greedy, Tree, Depth-First Search, Binary Search Tree, Binary Tree</description></item><item><title>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>1387. 根据数字的幂值排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1387-sort-integers-by-the-power-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1387-sort-integers-by-the-power-value/</guid><description>Medium | Dynamic Programming, Memoization, Sorting</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>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>1396. 设计地铁系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1396-design-underground-system/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1396-design-underground-system/</guid><description>Medium | Hash Table, String, Design</description></item><item><title>1400. 构造 K 个回文字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1400-construct-k-palindrome-strings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1400-construct-k-palindrome-strings/</guid><description>Medium | Hash Table, String, Greedy, Counting</description></item><item><title>1401. 圆和矩形是否有重叠</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1401-circle-and-rectangle-overlapping/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1401-circle-and-rectangle-overlapping/</guid><description>Medium | Math, Geometry</description></item><item><title>1404. 将二进制表示的数字减少到1的步数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one/</guid><description>Medium | String, Bit Manipulation, Simulation</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>1410. HTML 实体解析器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1410-html-entity-parser/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1410-html-entity-parser/</guid><description>Medium | Hash Table, String</description></item><item><title>1414. 找到和为 K 的最少斐波那契数字数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/</guid><description>Medium | Math, Greedy</description></item><item><title>1415. 第 k 个字典序的长度为 n 的快乐字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/</guid><description>Medium | String, Backtracking</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>1419. 青蛙叫声的最少数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1419-minimum-number-of-frogs-croaking/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1419-minimum-number-of-frogs-croaking/</guid><description>Medium | String, Counting</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>1432. 改变整数得到的最大差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1432-max-difference-you-can-get-from-changing-an-integer/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1432-max-difference-you-can-get-from-changing-an-integer/</guid><description>Medium | Math, Greedy</description></item><item><title>1433. 检查一个字符串是否可以打破另一个字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1433-check-if-a-string-can-break-another-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1433-check-if-a-string-can-break-another-string/</guid><description>Medium | String, Greedy, Sorting</description></item><item><title>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>1448. 统计二叉树中好节点的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1448-count-good-nodes-in-binary-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1448-count-good-nodes-in-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>1451. 重新排列句子中的单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1451-rearrange-words-in-a-sentence/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1451-rearrange-words-in-a-sentence/</guid><description>Medium | String, Sorting</description></item><item><title>1456. 给定长度子字符串中元音的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1456-maximum-number-of-vowels-in-a-substring-of-given-length/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1456-maximum-number-of-vowels-in-a-substring-of-given-length/</guid><description>Medium | String, Sliding Window</description></item><item><title>1457. 二叉树中的伪回文路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1457-pseudo-palindromic-paths-in-a-binary-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1457-pseudo-palindromic-paths-in-a-binary-tree/</guid><description>Medium | Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>1461. 检查字符串是否包含所有长度为 K 的二进制子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1461-check-if-a-string-contains-all-binary-codes-of-size-k/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1461-check-if-a-string-contains-all-binary-codes-of-size-k/</guid><description>Medium | Hash Table, String, Bit Manipulation, Rolling Hash, Hash Function</description></item><item><title>1462. 课程表 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1462-course-schedule-iv/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1462-course-schedule-iv/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort</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>1466. 重新规划路线</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory</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>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>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>1492. n 的第 k 个因子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1492-the-kth-factor-of-n/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1492-the-kth-factor-of-n/</guid><description>Medium | Math, Number Theory</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>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>1513. 只含1的子字符串数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1513-number-of-substrings-with-only-1s/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1513-number-of-substrings-with-only-1s/</guid><description>Medium | Math, String</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>1519. 子树中标签相同的节点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1519-number-of-nodes-in-the-sub-tree-with-the-same-label/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1519-number-of-nodes-in-the-sub-tree-with-the-same-label/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Counting</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>1525. 字符串的好分割数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1525-number-of-good-ways-to-split-a-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1525-number-of-good-ways-to-split-a-string/</guid><description>Medium | Hash Table, String, Dynamic Programming, Bit Manipulation</description></item><item><title>1529. 最少后缀翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1529-minimum-suffix-flips/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1529-minimum-suffix-flips/</guid><description>Medium | String, Greedy</description></item><item><title>1530. 好叶子节点对的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1530-number-of-good-leaf-nodes-pairs/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1530-number-of-good-leaf-nodes-pairs/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</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>1540. 在K步内转换字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1540-can-convert-string-in-k-moves/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1540-can-convert-string-in-k-moves/</guid><description>Medium | Hash Table, String</description></item><item><title>1541. 平衡括号字符串的最少插入次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1541-minimum-insertions-to-balance-a-parentheses-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1541-minimum-insertions-to-balance-a-parentheses-string/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>1545. 找出第 N 个二进制字符串中的第 K 位</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1545-find-kth-bit-in-nth-binary-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1545-find-kth-bit-in-nth-binary-string/</guid><description>Medium | String, Recursion, Simulation</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>1551. 使数组相等的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1551-minimum-operations-to-make-array-equal/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1551-minimum-operations-to-make-array-equal/</guid><description>Medium | Math</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>1557. 到达所有节点的最少顶点数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1557-minimum-number-of-vertices-to-reach-all-nodes/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1557-minimum-number-of-vertices-to-reach-all-nodes/</guid><description>Medium | Graph Theory</description></item><item><title>1558. 使数组变为目标数组的最小函数调用次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1558-minimum-numbers-of-function-calls-to-make-target-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1558-minimum-numbers-of-function-calls-to-make-target-array/</guid><description>Medium | Array, Greedy, Bit Manipulation</description></item><item><title>1561. 你能获得的最大硬币数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1561-maximum-number-of-coins-you-can-get/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1561-maximum-number-of-coins-you-can-get/</guid><description>Medium | Array, Math, Greedy, Sorting, Game Theory</description></item><item><title>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>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>1573. 字符串分割方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1573-number-of-ways-to-split-a-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1573-number-of-ways-to-split-a-string/</guid><description>Medium | Math, String</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>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>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>1593. 将字符串拆分为最多数量的唯一子字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1593-split-a-string-into-the-max-number-of-unique-substrings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1593-split-a-string-into-the-max-number-of-unique-substrings/</guid><description>Medium | Hash Table, String, Backtracking</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>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>1600. 王位继承顺序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1600-throne-inheritance/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1600-throne-inheritance/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Design</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>1609. 奇偶树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1609-even-odd-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1609-even-odd-tree/</guid><description>Medium | Tree, Breadth-First Search, Binary Tree</description></item><item><title>1615. 最大网络秩</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1615-maximal-network-rank/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1615-maximal-network-rank/</guid><description>Medium | Graph Theory</description></item><item><title>1616. 分割两个字符串得到回文串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1616-split-two-strings-to-make-palindrome/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1616-split-two-strings-to-make-palindrome/</guid><description>Medium | Two Pointers, String</description></item><item><title>1621. K 个不重叠线段的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1621-number-of-sets-of-k-non-overlapping-line-segments/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1621-number-of-sets-of-k-non-overlapping-line-segments/</guid><description>Medium | Math, Dynamic Programming, Combinatorics, Prefix Sum</description></item><item><title>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>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>1641. 统计字典序元音字符串的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1641-count-sorted-vowel-strings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1641-count-sorted-vowel-strings/</guid><description>Medium | Math, Dynamic Programming, Combinatorics</description></item><item><title>1642. 你能到达的最远建筑</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1642-furthest-building-you-can-reach/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1642-furthest-building-you-can-reach/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1647. 使字符频次唯一的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1647-minimum-deletions-to-make-character-frequencies-unique/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1647-minimum-deletions-to-make-character-frequencies-unique/</guid><description>Medium | Hash Table, String, Greedy, Sorting</description></item><item><title>1648. 销售价值递减的彩球</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1648-sell-diminishing-valued-colored-balls/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1648-sell-diminishing-valued-colored-balls/</guid><description>Medium | Array, Math, Binary Search, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>1653. 使字符串平衡的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1653-minimum-deletions-to-make-string-balanced/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1653-minimum-deletions-to-make-string-balanced/</guid><description>Medium | String, Dynamic Programming, Stack</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>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>1663. 具有给定数值的最小字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1663-smallest-string-with-a-given-numeric-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1663-smallest-string-with-a-given-numeric-value/</guid><description>Medium | String, Greedy</description></item><item><title>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>1669. 区间链表合并</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1669-merge-in-between-linked-lists/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1669-merge-in-between-linked-lists/</guid><description>Medium | Linked List</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>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>1680. 连续二进制数字的串联</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1680-concatenation-of-consecutive-binary-numbers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1680-concatenation-of-consecutive-binary-numbers/</guid><description>Medium | Math, Bit Manipulation, Simulation</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>1689. 分割数字的最小数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1689-partitioning-into-minimum-number-of-deci-binary-numbers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1689-partitioning-into-minimum-number-of-deci-binary-numbers/</guid><description>Medium | String, Greedy</description></item><item><title>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>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>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>1702. 变更后的最大二进制字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1702-maximum-binary-string-after-change/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1702-maximum-binary-string-after-change/</guid><description>Medium | String, Greedy</description></item><item><title>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>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>1717. 移除子字符串的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1717-maximum-score-from-removing-substrings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1717-maximum-score-from-removing-substrings/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>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>1721. 交换链表中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1721-swapping-nodes-in-a-linked-list/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1721-swapping-nodes-in-a-linked-list/</guid><description>Medium | Linked List, Two Pointers</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>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>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>1737. 修改最少字符使满足三个条件之一</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1737-change-minimum-characters-to-satisfy-one-of-three-conditions/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1737-change-minimum-characters-to-satisfy-one-of-three-conditions/</guid><description>Medium | Hash Table, String, Counting, Prefix Sum</description></item><item><title>1738. 找到第 K 大的异或坐标值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</guid><description>Medium | Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselect</description></item><item><title>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>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>1750. 删除相似字符串两端后的最小长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1750-minimum-length-of-string-after-deleting-similar-ends/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1750-minimum-length-of-string-after-deleting-similar-ends/</guid><description>Medium | Two Pointers, String</description></item><item><title>1753. 移除石子的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1753-maximum-score-from-removing-stones/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1753-maximum-score-from-removing-stones/</guid><description>Medium | Math, Greedy, Heap (Priority Queue)</description></item><item><title>1754. 两个字符串的最大合并</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1754-largest-merge-of-two-strings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1754-largest-merge-of-two-strings/</guid><description>Medium | Two Pointers, String, Greedy</description></item><item><title>1759. 计算同构子字符串的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1759-count-number-of-homogenous-substrings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1759-count-number-of-homogenous-substrings/</guid><description>Medium | Math, String</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>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>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>1780. 检查数字是否为三的幂的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1780-check-if-number-is-a-sum-of-powers-of-three/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1780-check-if-number-is-a-sum-of-powers-of-three/</guid><description>Medium | Math</description></item><item><title>1781. 所有子字符串美丽值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1781-sum-of-beauty-of-all-substrings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1781-sum-of-beauty-of-all-substrings/</guid><description>Medium | Hash Table, String, 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>1786. 从第一个节点到最后一个节点的受限路径数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/</guid><description>Medium | Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path</description></item><item><title>1797. 设计身份验证管理器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1797-design-authentication-manager/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1797-design-authentication-manager/</guid><description>Medium | Hash Table, Linked List, Design, Doubly-Linked List</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>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>1802. 有界数组中指定下标处的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1802-maximum-value-at-a-given-index-in-a-bounded-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1802-maximum-value-at-a-given-index-in-a-bounded-array/</guid><description>Medium | Math, Binary Search, Greedy</description></item><item><title>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>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>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>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>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>1845. 座位预约管理系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1845-seat-reservation-manager/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1845-seat-reservation-manager/</guid><description>Medium | Design, Heap (Priority Queue)</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>1849. 将字符串拆分为递减的连续值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1849-splitting-a-string-into-descending-consecutive-values/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1849-splitting-a-string-into-descending-consecutive-values/</guid><description>Medium | String, Backtracking, Enumeration</description></item><item><title>1850. 到达第 K 个最小美妙数的最小相邻交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number/</guid><description>Medium | Two Pointers, String, Greedy</description></item><item><title>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>1860. 增量内存泄漏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1860-incremental-memory-leak/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1860-incremental-memory-leak/</guid><description>Medium | Math, Simulation</description></item><item><title>1864. 使二进制字符串字符交替的最少交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating/</guid><description>Medium | String, Greedy</description></item><item><title>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>1871. 跳跃游戏 VII</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1871-jump-game-vii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1871-jump-game-vii/</guid><description>Medium | String, Dynamic Programming, Sliding Window, Prefix Sum</description></item><item><title>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>1881. 插入后的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1881-maximum-value-after-insertion/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1881-maximum-value-after-insertion/</guid><description>Medium | String, Greedy</description></item><item><title>1884. 两枚鸡蛋掉落</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1884-egg-drop-with-2-eggs-and-n-floors/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1884-egg-drop-with-2-eggs-and-n-floors/</guid><description>Medium | Math, Dynamic Programming</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>1888. 使二进制字符串字符交替的最少翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1888-minimum-number-of-flips-to-make-the-binary-string-alternating/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1888-minimum-number-of-flips-to-make-the-binary-string-alternating/</guid><description>Medium | String, Dynamic Programming, Sliding Window</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>1904. 你已经玩了多少场完整的比赛回合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1904-the-number-of-full-rounds-you-have-played/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1904-the-number-of-full-rounds-you-have-played/</guid><description>Medium | Math, String</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>1910. 删除字符串中的所有指定子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1910-remove-all-occurrences-of-a-substring/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1910-remove-all-occurrences-of-a-substring/</guid><description>Medium | String, Stack, Simulation</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>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>1922. 计算好数字的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1922-count-good-numbers/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1922-count-good-numbers/</guid><description>Medium | Math, Recursion</description></item><item><title>1927. 求和博弈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1927-sum-game/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1927-sum-game/</guid><description>Medium | Math, String, Greedy, Game Theory</description></item><item><title>1930. 长度为3的唯一回文子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1930-unique-length-3-palindromic-subsequences/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1930-unique-length-3-palindromic-subsequences/</guid><description>Medium | Hash Table, String, Bit Manipulation, Prefix Sum</description></item><item><title>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>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>1946. 变更一个子字符串后的最大数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1946-largest-number-after-mutating-substring/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1946-largest-number-after-mutating-substring/</guid><description>Medium | Array, String, Greedy</description></item><item><title>1953. 可以工作的最大周数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1953-maximum-number-of-weeks-for-which-you-can-work/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1953-maximum-number-of-weeks-for-which-you-can-work/</guid><description>Medium | Array, Greedy</description></item><item><title>1954. 收集足够苹果的最小花园周长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1954-minimum-garden-perimeter-to-collect-enough-apples/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1954-minimum-garden-perimeter-to-collect-enough-apples/</guid><description>Medium | Math, Binary Search</description></item><item><title>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>1962. 移除石子使总数最小</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1962-remove-stones-to-minimize-the-total/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1962-remove-stones-to-minimize-the-total/</guid><description>Medium | Array, Greedy, Heap (Priority Queue)</description></item><item><title>1963. 使字符串平衡的最少交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1963-minimum-number-of-swaps-to-make-the-string-balanced/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1963-minimum-number-of-swaps-to-make-the-string-balanced/</guid><description>Medium | Two Pointers, String, Stack, Greedy</description></item><item><title>1968. 数组中不等于相邻元素平均值的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1968-array-with-elements-not-equal-to-average-of-neighbors/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1968-array-with-elements-not-equal-to-average-of-neighbors/</guid><description>Medium | Array, Greedy, Sorting</description></item><item><title>1969. 数组元素的最小非零乘积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1969-minimum-non-zero-product-of-the-array-elements/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1969-minimum-non-zero-product-of-the-array-elements/</guid><description>Medium | Math, Greedy, Recursion</description></item><item><title>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>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>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>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>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>1006. 笨阶乘</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1006-clumsy-factorial/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1006-clumsy-factorial/</guid><description>Medium | Math, Stack, Simulation</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>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>1015. 可被 K 整除的最小整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1015-smallest-integer-divisible-by-k/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1015-smallest-integer-divisible-by-k/</guid><description>Medium | Hash Table, Math</description></item><item><title>1016. 二进制字符串的子串表示1到N</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1016-binary-string-with-substrings-representing-1-to-n/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1016-binary-string-with-substrings-representing-1-to-n/</guid><description>Medium | Hash Table, String, Bit Manipulation, Sliding Window</description></item><item><title>1017. 转换到以-2为基数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1017-convert-to-base-2/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1017-convert-to-base-2/</guid><description>Medium | Math</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>1026. 祖先与后代的最大差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1026-maximum-difference-between-node-and-ancestor/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1026-maximum-difference-between-node-and-ancestor/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</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>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>1033. 移动石子直到连续</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1033-moving-stones-until-consecutive/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1033-moving-stones-until-consecutive/</guid><description>Medium | Math, Brainteaser</description></item><item><title>1038. 二叉搜索树转累加树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1038-binary-search-tree-to-greater-sum-tree/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1038-binary-search-tree-to-greater-sum-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree</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>1041. 被困在圆中的机器人</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1041-robot-bounded-in-circle/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1041-robot-bounded-in-circle/</guid><description>Medium | Math, String, Simulation</description></item><item><title>1042. 花园种花</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1042-flower-planting-with-no-adjacent/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1042-flower-planting-with-no-adjacent/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory</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>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>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>1061. 字典序最小的等价字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1061-lexicographically-smallest-equivalent-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1061-lexicographically-smallest-equivalent-string/</guid><description>Medium | String, Union-Find</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>1079. 活字印刷</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1079-letter-tile-possibilities/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1079-letter-tile-possibilities/</guid><description>Medium | Hash Table, String, Backtracking, Counting</description></item><item><title>1080. 从根到叶的不足节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1080-insufficient-nodes-in-root-to-leaf-paths/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1080-insufficient-nodes-in-root-to-leaf-paths/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</description></item><item><title>1081. 不同字符的最小子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1081-smallest-subsequence-of-distinct-characters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1081-smallest-subsequence-of-distinct-characters/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>1090. 从标签中选取最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1090-largest-values-from-labels/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1090-largest-values-from-labels/</guid><description>Medium | Array, Hash Table, Greedy, Sorting, Counting</description></item><item><title>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>1104. 之字形标记二叉树中的路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1104-path-in-zigzag-labelled-binary-tree/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1104-path-in-zigzag-labelled-binary-tree/</guid><description>Medium | Math, Tree, Binary Tree</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>1111. 两个有效括号字符串的最大嵌套深度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1111-maximum-nesting-depth-of-two-valid-parentheses-strings/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1111-maximum-nesting-depth-of-two-valid-parentheses-strings/</guid><description>Medium | String, Stack</description></item><item><title>1123. 最深叶节点的最近公共祖先</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1123-lowest-common-ancestor-of-deepest-leaves/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1123-lowest-common-ancestor-of-deepest-leaves/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree</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>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>1138. 字母板上的路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1138-alphabet-board-path/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1138-alphabet-board-path/</guid><description>Medium | Hash Table, String</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>1145. 二叉树着色游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1145-binary-tree-coloring-game/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1145-binary-tree-coloring-game/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</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>1155. 掷骰子的N种方法</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1155-number-of-dice-rolls-with-target-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1155-number-of-dice-rolls-with-target-sum/</guid><description>Medium | Dynamic Programming</description></item><item><title>1156. 交换字符使得字符串同字符连续最长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1156-swap-for-longest-repeated-character-substring/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1156-swap-for-longest-repeated-character-substring/</guid><description>Medium | Hash Table, String, Sliding Window</description></item><item><title>1161. 二叉树最大层内元素和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1161-maximum-level-sum-of-a-binary-tree/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1161-maximum-level-sum-of-a-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>1170. 根据字符串最小字符的频率比较字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1170-compare-strings-by-frequency-of-the-smallest-character/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1170-compare-strings-by-frequency-of-the-smallest-character/</guid><description>Medium | Array, Hash Table, String, Binary Search, Sorting</description></item><item><title>1171. 从链表中删去总和值为零的连续节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1171-remove-zero-sum-consecutive-nodes-from-linked-list/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1171-remove-zero-sum-consecutive-nodes-from-linked-list/</guid><description>Medium | Hash Table, Linked List</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>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>1190. 反转每对括号间的子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1190-reverse-substrings-between-each-pair-of-parentheses/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1190-reverse-substrings-between-each-pair-of-parentheses/</guid><description>Medium | String, Stack</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>1201. 丑数 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1201-ugly-number-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1201-ugly-number-iii/</guid><description>Medium | Math, Binary Search, Combinatorics, Number Theory</description></item><item><title>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>1208. 预算内的相等子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1208-get-equal-substrings-within-budget/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1208-get-equal-substrings-within-budget/</guid><description>Medium | String, Binary Search, Sliding Window, Prefix Sum</description></item><item><title>1209. 删除字符串中的所有相邻重复项 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1209-remove-all-adjacent-duplicates-in-string-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1209-remove-all-adjacent-duplicates-in-string-ii/</guid><description>Medium | String, Stack</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>1227. 飞机座位分配概率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1227-airplane-seat-assignment-probability/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1227-airplane-seat-assignment-probability/</guid><description>Medium | Math, Dynamic Programming, Brainteaser, Probability and Statistics</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>1234. 替换子串得到平衡字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1234-replace-the-substring-for-balanced-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1234-replace-the-substring-for-balanced-string/</guid><description>Medium | String, Sliding Window</description></item><item><title>1237. 寻找正整数解的函数方程</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1237-find-positive-integer-solution-for-a-given-equation/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1237-find-positive-integer-solution-for-a-given-equation/</guid><description>Medium | Math, Two Pointers, Binary Search, Interactive</description></item><item><title>1238. 二进制表示中的循环排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1238-circular-permutation-in-binary-representation/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1238-circular-permutation-in-binary-representation/</guid><description>Medium | Math, Backtracking, Bit Manipulation</description></item><item><title>1247. 使字符串相等的最小交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1247-minimum-swaps-to-make-strings-equal/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1247-minimum-swaps-to-make-strings-equal/</guid><description>Medium | Math, String, Greedy</description></item><item><title>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>1249. 使括号有效的最少删除</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1249-minimum-remove-to-make-valid-parentheses/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1249-minimum-remove-to-make-valid-parentheses/</guid><description>Medium | String, Stack</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>1261. 在受污染的二叉树中查找元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1261-find-elements-in-a-contaminated-binary-tree/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1261-find-elements-in-a-contaminated-binary-tree/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree</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>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>1276. 不浪费原料的汉堡制作方案</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1276-number-of-burgers-with-no-waste-of-ingredients/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1276-number-of-burgers-with-no-waste-of-ingredients/</guid><description>Medium | Math</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>725. 分割链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0725-split-linked-list-in-parts/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0725-split-linked-list-in-parts/</guid><description>Medium | Linked List</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>738. 单调递增的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0738-monotone-increasing-digits/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0738-monotone-increasing-digits/</guid><description>Medium | Math, Greedy</description></item><item><title>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>743. 网络延迟时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0743-network-delay-time/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0743-network-delay-time/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path</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>754. 到达数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0754-reach-a-number/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0754-reach-a-number/</guid><description>Medium | Math, Binary Search</description></item><item><title>756. 金字塔转换矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0756-pyramid-transition-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0756-pyramid-transition-matrix/</guid><description>Medium | Hash Table, String, Backtracking, Bit Manipulation</description></item><item><title>763. 划分字母区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0763-partition-labels/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0763-partition-labels/</guid><description>Medium | Hash Table, Two Pointers, String, Greedy</description></item><item><title>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>767. 重构字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0767-reorganize-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0767-reorganize-string/</guid><description>Medium | Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting</description></item><item><title>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>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>777. 在LR字符串中交换相邻字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0777-swap-adjacent-in-lr-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0777-swap-adjacent-in-lr-string/</guid><description>Medium | Two Pointers, String</description></item><item><title>779. 语法中的第K个符号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0779-k-th-symbol-in-grammar/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0779-k-th-symbol-in-grammar/</guid><description>Medium | Math, Bit Manipulation, Recursion</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>784. 字母大小写全排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0784-letter-case-permutation/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0784-letter-case-permutation/</guid><description>Medium | String, Backtracking, Bit Manipulation</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>787. K 站中转内最便宜的航班</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/</guid><description>Medium | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path</description></item><item><title>788. 旋转数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0788-rotated-digits/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0788-rotated-digits/</guid><description>Medium | Math, Dynamic Programming</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>790. 多米诺骨牌和三联骨牌平铺</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0790-domino-and-tromino-tiling/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0790-domino-and-tromino-tiling/</guid><description>Medium | Dynamic Programming</description></item><item><title>791. 自定义字符串排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0791-custom-sort-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0791-custom-sort-string/</guid><description>Medium | Hash Table, String, Sorting</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>797. 所有可能的路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0797-all-paths-from-source-to-target/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0797-all-paths-from-source-to-target/</guid><description>Medium | Backtracking, Depth-First Search, Breadth-First Search, Graph Theory</description></item><item><title>799. 香槟塔</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0799-champagne-tower/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0799-champagne-tower/</guid><description>Medium | Dynamic Programming</description></item><item><title>802. 找到最终的安全状态</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0802-find-eventual-safe-states/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0802-find-eventual-safe-states/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort</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>808. 汤的供应</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0808-soup-servings/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0808-soup-servings/</guid><description>Medium | Math, Dynamic Programming, Probability and Statistics</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>814. 二叉树剪枝</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0814-binary-tree-pruning/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0814-binary-tree-pruning/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</description></item><item><title>816. 模糊坐标</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0816-ambiguous-coordinates/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0816-ambiguous-coordinates/</guid><description>Medium | String, Backtracking, Enumeration</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>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>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>831. 屏蔽个人信息</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0831-masking-personal-information/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0831-masking-personal-information/</guid><description>Medium | String</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>837. 新21点游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0837-new-21-game/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0837-new-21-game/</guid><description>Medium | Math, Dynamic Programming, Sliding Window, Probability and Statistics</description></item><item><title>838. 推多米诺</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0838-push-dominoes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0838-push-dominoes/</guid><description>Medium | Two Pointers, String, Dynamic Programming</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>841. 钥匙和房间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0841-keys-and-rooms/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0841-keys-and-rooms/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory</description></item><item><title>842. 将数组拆分成斐波那契序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0842-split-array-into-fibonacci-sequence/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0842-split-array-into-fibonacci-sequence/</guid><description>Medium | String, Backtracking</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>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>855. 考试房间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0855-exam-room/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0855-exam-room/</guid><description>Medium | Design, Heap (Priority Queue), Ordered Set</description></item><item><title>856. 括号的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0856-score-of-parentheses/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0856-score-of-parentheses/</guid><description>Medium | String, Stack</description></item><item><title>858. 镜面反射</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0858-mirror-reflection/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0858-mirror-reflection/</guid><description>Medium | Math, Geometry, Number Theory</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>863. 二叉树中所有距离为 K 的结点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0863-all-nodes-distance-k-in-binary-tree/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0863-all-nodes-distance-k-in-binary-tree/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>865. 包含所有最深节点的最小子树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0865-smallest-subtree-with-all-the-deepest-nodes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0865-smallest-subtree-with-all-the-deepest-nodes/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>866. 回文质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0866-prime-palindrome/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0866-prime-palindrome/</guid><description>Medium | Math, Number Theory</description></item><item><title>869. 重新排列得到2的幂</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0869-reordered-power-of-2/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0869-reordered-power-of-2/</guid><description>Medium | Hash Table, Math, Sorting, Counting, Enumeration</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>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>880. 索引处的解码字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0880-decoded-string-at-index/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0880-decoded-string-at-index/</guid><description>Medium | String, Stack</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>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>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>894. 所有可能的满二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0894-all-possible-full-binary-trees/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0894-all-possible-full-binary-trees/</guid><description>Medium | Dynamic Programming, Tree, Recursion, Memoization, Binary Tree</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>901. 股票价格跨度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0901-online-stock-span/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0901-online-stock-span/</guid><description>Medium | Stack, Design, Monotonic Stack, Data Stream</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>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>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>919. 完全二叉树插入器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0919-complete-binary-tree-inserter/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0919-complete-binary-tree-inserter/</guid><description>Medium | Tree, Breadth-First Search, Design, Binary Tree</description></item><item><title>921. 使括号有效的最少添加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0921-minimum-add-to-make-parentheses-valid/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0921-minimum-add-to-make-parentheses-valid/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>926. 翻转字符串到单调递增</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0926-flip-string-to-monotone-increasing/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0926-flip-string-to-monotone-increasing/</guid><description>Medium | String, Dynamic Programming</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>935. 骑士拨号器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0935-knight-dialer/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0935-knight-dialer/</guid><description>Medium | Dynamic Programming</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>947. 移除最多的同行或同列石头</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0947-most-stones-removed-with-same-row-or-column/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0947-most-stones-removed-with-same-row-or-column/</guid><description>Medium | Hash Table, Depth-First Search, Union-Find, Graph Theory</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>951. 翻转等价二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0951-flip-equivalent-binary-trees/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0951-flip-equivalent-binary-trees/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</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>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>958. 二叉树的完全性检验</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0958-check-completeness-of-a-binary-tree/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0958-check-completeness-of-a-binary-tree/</guid><description>Medium | Tree, Breadth-First Search, Binary Tree</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>967. 相邻数字差相等的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0967-numbers-with-same-consecutive-differences/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0967-numbers-with-same-consecutive-differences/</guid><description>Medium | Backtracking, Breadth-First Search</description></item><item><title>971. 翻转二叉树以匹配先序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0971-flip-binary-tree-to-match-preorder-traversal/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0971-flip-binary-tree-to-match-preorder-traversal/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</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>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>979. 在二叉树中分配硬币</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0979-distribute-coins-in-binary-tree/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0979-distribute-coins-in-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</description></item><item><title>981. 基于时间的键值存储</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0981-time-based-key-value-store/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0981-time-based-key-value-store/</guid><description>Medium | Hash Table, String, Binary Search, Design</description></item><item><title>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>984. 不含AAA或BBB的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0984-string-without-aaa-or-bbb/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0984-string-without-aaa-or-bbb/</guid><description>Medium | String, Greedy</description></item><item><title>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>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>991. 坏掉的计算器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0991-broken-calculator/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0991-broken-calculator/</guid><description>Medium | Math, Greedy</description></item><item><title>998. 最大二叉树 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0998-maximum-binary-tree-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0998-maximum-binary-tree-ii/</guid><description>Medium | Tree, Binary Tree</description></item><item><title>481. 神奇字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0481-magical-string/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0481-magical-string/</guid><description>Medium | Two Pointers, String</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>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>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>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>508. 最频繁的子树元素和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0508-most-frequent-subtree-sum/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0508-most-frequent-subtree-sum/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Binary Tree</description></item><item><title>515. 在每个树行中找最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0515-find-largest-value-in-each-tree-row/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0515-find-largest-value-in-each-tree-row/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</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>519. 随机翻转矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0519-random-flip-matrix/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0519-random-flip-matrix/</guid><description>Medium | Hash Table, Math, Reservoir Sampling, Randomized</description></item><item><title>523. 连续的子数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0523-continuous-subarray-sum/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0523-continuous-subarray-sum/</guid><description>Medium | Array, Hash Table, Math, Prefix Sum</description></item><item><title>525. 连续数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0525-contiguous-array/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0525-contiguous-array/</guid><description>Medium | Array, Hash Table, Prefix Sum</description></item><item><title>528. 按权重随机选择</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0528-random-pick-with-weight/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0528-random-pick-with-weight/</guid><description>Medium | Array, Math, Binary Search, Prefix Sum, Randomized</description></item><item><title>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>535. 编码和解码TinyURL</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0535-encode-and-decode-tinyurl/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0535-encode-and-decode-tinyurl/</guid><description>Medium | Hash Table, String, Design, Hash Function</description></item><item><title>537. 复数乘法</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0537-complex-number-multiplication/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0537-complex-number-multiplication/</guid><description>Medium | Math, String, Simulation</description></item><item><title>538. 二叉搜索树转化为累加树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0538-convert-bst-to-greater-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0538-convert-bst-to-greater-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree</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>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>556. 下一个更大元素 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0556-next-greater-element-iii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0556-next-greater-element-iii/</guid><description>Medium | Math, Two Pointers, String</description></item><item><title>558. 二进制网格的逻辑或运算（四叉树表示）</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0558-logical-or-of-two-binary-grids-represented-as-quad-trees/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0558-logical-or-of-two-binary-grids-represented-as-quad-trees/</guid><description>Medium | Divide and Conquer, Tree</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>567. 字符串的排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0567-permutation-in-string/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0567-permutation-in-string/</guid><description>Medium | Hash Table, Two Pointers, String, Sliding Window</description></item><item><title>576. 出界的路径数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0576-out-of-boundary-paths/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0576-out-of-boundary-paths/</guid><description>Medium | Dynamic Programming</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>592. 分数加减运算</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0592-fraction-addition-and-subtraction/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0592-fraction-addition-and-subtraction/</guid><description>Medium | Math, String, Simulation</description></item><item><title>593. 有效正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0593-valid-square/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0593-valid-square/</guid><description>Medium | Math, Geometry</description></item><item><title>606. 从二叉树构造字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0606-construct-string-from-binary-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0606-construct-string-from-binary-tree/</guid><description>Medium | String, Tree, Depth-First Search, Binary Tree</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>623. 在二叉树中增加一行</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0623-add-one-row-to-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0623-add-one-row-to-tree/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</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>633. 平方数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0633-sum-of-square-numbers/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0633-sum-of-square-numbers/</guid><description>Medium | Math, Two Pointers, Binary Search</description></item><item><title>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>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>647. 回文子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0647-palindromic-substrings/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0647-palindromic-substrings/</guid><description>Medium | Two Pointers, String, Dynamic Programming</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>649. Dota2 参议院</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0649-dota2-senate/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0649-dota2-senate/</guid><description>Medium | String, Greedy, Queue</description></item><item><title>650. 只有两个键的键盘</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0650-2-keys-keyboard/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0650-2-keys-keyboard/</guid><description>Medium | Math, Dynamic Programming</description></item><item><title>652. 寻找重复的子树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0652-find-duplicate-subtrees/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0652-find-duplicate-subtrees/</guid><description>Medium | Hash Table, Tree, Depth-First Search, Binary Tree</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>655. 打印二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0655-print-binary-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0655-print-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, 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>662. 二叉树的最大宽度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0662-maximum-width-of-binary-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0662-maximum-width-of-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree</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>669. 修剪二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0669-trim-a-binary-search-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0669-trim-a-binary-search-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree</description></item><item><title>670. 最大交换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0670-maximum-swap/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0670-maximum-swap/</guid><description>Medium | Math, Greedy</description></item><item><title>672. 灯泡开关 Ⅱ</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0672-bulb-switcher-ii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0672-bulb-switcher-ii/</guid><description>Medium | Math, Bit Manipulation, Depth-First Search, Breadth-First Search</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>676. 实现魔法字典</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0676-implement-magic-dictionary/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0676-implement-magic-dictionary/</guid><description>Medium | Hash Table, String, Depth-First Search, Design, Trie</description></item><item><title>678. 有效的括号字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0678-valid-parenthesis-string/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0678-valid-parenthesis-string/</guid><description>Medium | String, Dynamic Programming, Stack, Greedy</description></item><item><title>684. 冗余连接</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0684-redundant-connection/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0684-redundant-connection/</guid><description>Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory</description></item><item><title>686. 重复字符串匹配</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0686-repeated-string-match/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0686-repeated-string-match/</guid><description>Medium | String, String Matching</description></item><item><title>687. 最长同值路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0687-longest-univalue-path/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0687-longest-univalue-path/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</description></item><item><title>688. 棋盘上骑士的概率</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0688-knight-probability-in-chessboard/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0688-knight-probability-in-chessboard/</guid><description>Medium | Dynamic Programming</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>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>701. 二叉搜索树中的插入操作</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0701-insert-into-a-binary-search-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0701-insert-into-a-binary-search-tree/</guid><description>Medium | Tree, Binary Search Tree, Binary Tree</description></item><item><title>707. 设计链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0707-design-linked-list/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0707-design-linked-list/</guid><description>Medium | Linked List, Design</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>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>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>328. 奇偶链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0328-odd-even-linked-list/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0328-odd-even-linked-list/</guid><description>Medium | Linked List</description></item><item><title>331. 验证二叉树的前序序列化</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0331-verify-preorder-serialization-of-a-binary-tree/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0331-verify-preorder-serialization-of-a-binary-tree/</guid><description>Medium | String, Stack, Tree, Binary Tree</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>337. 打家劫舍 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0337-house-robber-iii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0337-house-robber-iii/</guid><description>Medium | Dynamic Programming, Tree, Depth-First Search, Binary Tree</description></item><item><title>341. 扁平化嵌套列表迭代器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0341-flatten-nested-list-iterator/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0341-flatten-nested-list-iterator/</guid><description>Medium | Stack, Tree, Depth-First Search, Design, Queue, Iterator</description></item><item><title>343. 整数拆分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0343-integer-break/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0343-integer-break/</guid><description>Medium | Math, Dynamic Programming</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>355. 设计推特</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0355-design-twitter/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0355-design-twitter/</guid><description>Medium | Hash Table, Linked List, Design, Heap (Priority Queue)</description></item><item><title>357. 统计各位数字都不同的数字个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0357-count-numbers-with-unique-digits/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0357-count-numbers-with-unique-digits/</guid><description>Medium | Math, Dynamic Programming, Backtracking</description></item><item><title>365. 水壶问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0365-water-and-jug-problem/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0365-water-and-jug-problem/</guid><description>Medium | Math, Depth-First Search, Breadth-First Search</description></item><item><title>371. 两整数之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0371-sum-of-two-integers/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0371-sum-of-two-integers/</guid><description>Medium | Math, Bit Manipulation</description></item><item><title>372. 超级次方</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0372-super-pow/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0372-super-pow/</guid><description>Medium | Math, Divide and Conquer</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>375. 猜数字大小II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0375-guess-number-higher-or-lower-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0375-guess-number-higher-or-lower-ii/</guid><description>Medium | Math, Dynamic Programming, Game Theory</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>382. 链表随机节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0382-linked-list-random-node/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0382-linked-list-random-node/</guid><description>Medium | Linked List, Math, Reservoir Sampling, 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>385. 迷你解析器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0385-mini-parser/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0385-mini-parser/</guid><description>Medium | String, Stack, Depth-First Search</description></item><item><title>388. 最长绝对文件路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0388-longest-absolute-file-path/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0388-longest-absolute-file-path/</guid><description>Medium | String, Stack, Depth-First Search</description></item><item><title>390. 消除游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0390-elimination-game/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0390-elimination-game/</guid><description>Medium | Math, Recursion</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>394. 字符串解码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0394-decode-string/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0394-decode-string/</guid><description>Medium | String, Stack, Recursion</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>397. 整数替换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0397-integer-replacement/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0397-integer-replacement/</guid><description>Medium | Dynamic Programming, Greedy, Bit Manipulation, Memoization</description></item><item><title>398. 随机数索引</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0398-random-pick-index/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0398-random-pick-index/</guid><description>Medium | Hash Table, Math, Reservoir Sampling, Randomized</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>400. 第N位数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0400-nth-digit/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0400-nth-digit/</guid><description>Medium | Math, Binary Search</description></item><item><title>402. 移除K位数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0402-remove-k-digits/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0402-remove-k-digits/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>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>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>423. 从英文中重建数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0423-reconstruct-original-digits-from-english/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0423-reconstruct-original-digits-from-english/</guid><description>Medium | Hash Table, Math, String</description></item><item><title>424. 替换后的最长重复字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0424-longest-repeating-character-replacement/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0424-longest-repeating-character-replacement/</guid><description>Medium | Hash Table, String, Sliding Window</description></item><item><title>429. N 叉树的层序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0429-n-ary-tree-level-order-traversal/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0429-n-ary-tree-level-order-traversal/</guid><description>Medium | Tree, Breadth-First Search</description></item><item><title>430. 扁平化多级双向链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0430-flatten-a-multilevel-doubly-linked-list/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0430-flatten-a-multilevel-doubly-linked-list/</guid><description>Medium | Linked List, Depth-First Search, Doubly-Linked List</description></item><item><title>433. 最小基因变化</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0433-minimum-genetic-mutation/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0433-minimum-genetic-mutation/</guid><description>Medium | Hash Table, String, Breadth-First Search</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>437. 路径总和 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0437-path-sum-iii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0437-path-sum-iii/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</description></item><item><title>438. 找到字符串中所有字母异位词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0438-find-all-anagrams-in-a-string/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0438-find-all-anagrams-in-a-string/</guid><description>Medium | Hash Table, String, Sliding Window</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>443. 字符串压缩</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0443-string-compression/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0443-string-compression/</guid><description>Medium | Two Pointers, String</description></item><item><title>445. 两数相加 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0445-add-two-numbers-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0445-add-two-numbers-ii/</guid><description>Medium | Linked List, Math, Stack</description></item><item><title>449. 序列化和反序列化二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0449-serialize-and-deserialize-bst/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0449-serialize-and-deserialize-bst/</guid><description>Medium | String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Search Tree, Binary Tree</description></item><item><title>450. 删除二叉搜索树中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0450-delete-node-in-a-bst/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0450-delete-node-in-a-bst/</guid><description>Medium | Tree, Binary Search Tree, Binary Tree</description></item><item><title>451. 根据字符出现频率排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0451-sort-characters-by-frequency/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0451-sort-characters-by-frequency/</guid><description>Medium | Hash Table, String, Sorting, Heap (Priority Queue), Bucket Sort, Counting</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>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>464. 我能赢吗</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0464-can-i-win/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0464-can-i-win/</guid><description>Medium | Math, Dynamic Programming, Bit Manipulation, Memoization, Game Theory, Bitmask</description></item><item><title>468. 验证IP地址</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0468-validate-ip-address/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0468-validate-ip-address/</guid><description>Medium | String</description></item><item><title>470. 用 Rand7() 实现 Rand10()</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0470-implement-rand10-using-rand7/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0470-implement-rand10-using-rand7/</guid><description>Medium | Math, Rejection Sampling, Randomized, Probability and Statistics</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>478. 在圆内生成随机点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0478-generate-random-point-in-a-circle/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0478-generate-random-point-in-a-circle/</guid><description>Medium | Math, Geometry, Rejection Sampling, Randomized</description></item><item><title>102. 二叉树的层序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0102-binary-tree-level-order-traversal/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0102-binary-tree-level-order-traversal/</guid><description>Medium | Tree, Breadth-First Search, Binary Tree</description></item><item><title>103. 二叉树的锯齿形层序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0103-binary-tree-zigzag-level-order-traversal/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0103-binary-tree-zigzag-level-order-traversal/</guid><description>Medium | Tree, Breadth-First Search, Binary Tree</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>107. 二叉树的层序遍历 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0107-binary-tree-level-order-traversal-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0107-binary-tree-level-order-traversal-ii/</guid><description>Medium | Tree, Breadth-First Search, Binary Tree</description></item><item><title>109. 将有序链表转换为二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0109-convert-sorted-list-to-binary-search-tree/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0109-convert-sorted-list-to-binary-search-tree/</guid><description>Medium | Linked List, 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>113. 路径总和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0113-path-sum-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0113-path-sum-ii/</guid><description>Medium | Backtracking, Tree, Depth-First Search, Binary Tree</description></item><item><title>114. 二叉树展开为链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0114-flatten-binary-tree-to-linked-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0114-flatten-binary-tree-to-linked-list/</guid><description>Medium | Linked List, Stack, Tree, Depth-First Search, Binary Tree</description></item><item><title>116. 填充每个节点的下一个右侧节点指针</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0116-populating-next-right-pointers-in-each-node/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0116-populating-next-right-pointers-in-each-node/</guid><description>Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>117. 填充每个节点的下一个右侧节点指针 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0117-populating-next-right-pointers-in-each-node-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0117-populating-next-right-pointers-in-each-node-ii/</guid><description>Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>12. 整数转罗马数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0012-integer-to-roman/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0012-integer-to-roman/</guid><description>Medium | Hash Table, Math, String</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>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>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>129. 求根节点到叶节点数字之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0129-sum-root-to-leaf-numbers/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0129-sum-root-to-leaf-numbers/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</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>133. 克隆图</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0133-clone-graph/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0133-clone-graph/</guid><description>Medium | Hash Table, Depth-First Search, Breadth-First Search, Graph Theory</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>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>138. 复制带随机指针的链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0138-copy-list-with-random-pointer/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0138-copy-list-with-random-pointer/</guid><description>Medium | Hash Table, Linked List</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>142. 环形链表 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0142-linked-list-cycle-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0142-linked-list-cycle-ii/</guid><description>Medium | Hash Table, Linked List, Two Pointers</description></item><item><title>143. 重排链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0143-reorder-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0143-reorder-list/</guid><description>Medium | Linked List, Two Pointers, Stack, Recursion</description></item><item><title>146. LRU 缓存</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0146-lru-cache/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0146-lru-cache/</guid><description>Medium | Hash Table, Linked List, Design, Doubly-Linked List</description></item><item><title>147. 插入排序链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0147-insertion-sort-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0147-insertion-sort-list/</guid><description>Medium | Linked List, Sorting</description></item><item><title>148. 排序链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0148-sort-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0148-sort-list/</guid><description>Medium | Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort</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>151. 翻转字符串中的单词</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0151-reverse-words-in-a-string/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0151-reverse-words-in-a-string/</guid><description>Medium | Two Pointers, String</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>155. 最小栈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0155-min-stack/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0155-min-stack/</guid><description>Medium | Stack, Design</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>165. 比较版本号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0165-compare-version-numbers/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0165-compare-version-numbers/</guid><description>Medium | Two Pointers, String</description></item><item><title>166. 分数到小数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0166-fraction-to-recurring-decimal/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0166-fraction-to-recurring-decimal/</guid><description>Medium | Hash Table, Math, String</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>17. 电话号码的字母组合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0017-letter-combinations-of-a-phone-number/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0017-letter-combinations-of-a-phone-number/</guid><description>Medium | Hash Table, String, Backtracking</description></item><item><title>172. 阶乘后的零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0172-factorial-trailing-zeroes/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0172-factorial-trailing-zeroes/</guid><description>Medium | Math</description></item><item><title>173. 二叉搜索树迭代器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0173-binary-search-tree-iterator/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0173-binary-search-tree-iterator/</guid><description>Medium | Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator</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>187. 重复的DNA序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0187-repeated-dna-sequences/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0187-repeated-dna-sequences/</guid><description>Medium | Hash Table, String, Bit Manipulation, Sliding Window, Rolling Hash, Hash Function</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>19. 删除链表的倒数第 N 个结点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0019-remove-nth-node-from-end-of-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0019-remove-nth-node-from-end-of-list/</guid><description>Medium | Linked List, 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>2. 两数相加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0002-add-two-numbers/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0002-add-two-numbers/</guid><description>Medium | Linked List, Math, Recursion</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>201. 数字范围按位与</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0201-bitwise-and-of-numbers-range/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0201-bitwise-and-of-numbers-range/</guid><description>Medium | Bit Manipulation</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>207. 课程表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0207-course-schedule/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0207-course-schedule/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort</description></item><item><title>208. 实现 Trie（前缀树）</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0208-implement-trie-prefix-tree/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0208-implement-trie-prefix-tree/</guid><description>Medium | Hash Table, String, Design, Trie</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>210. 课程表 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0210-course-schedule-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0210-course-schedule-ii/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort</description></item><item><title>211. 添加与搜索单词 - 数据结构设计</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0211-design-add-and-search-words-data-structure/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0211-design-add-and-search-words-data-structure/</guid><description>Medium | String, Depth-First Search, Design, Trie</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>22. 括号生成</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0022-generate-parentheses/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0022-generate-parentheses/</guid><description>Medium | String, Dynamic Programming, Backtracking</description></item><item><title>223. 矩形面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0223-rectangle-area/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0223-rectangle-area/</guid><description>Medium | Math, Geometry</description></item><item><title>227. 基本计算器 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0227-basic-calculator-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0227-basic-calculator-ii/</guid><description>Medium | Math, String, Stack</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>230. 二叉搜索树中第K小的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0230-kth-smallest-element-in-a-bst/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0230-kth-smallest-element-in-a-bst/</guid><description>Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree</description></item><item><title>235. 二叉搜索树的最近公共祖先</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0235-lowest-common-ancestor-of-a-binary-search-tree/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0235-lowest-common-ancestor-of-a-binary-search-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree</description></item><item><title>236. 二叉树的最近公共祖先</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0236-lowest-common-ancestor-of-a-binary-tree/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0236-lowest-common-ancestor-of-a-binary-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Tree</description></item><item><title>237. 删除链表中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0237-delete-node-in-a-linked-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0237-delete-node-in-a-linked-list/</guid><description>Medium | Linked List</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>24. 两两交换链表中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0024-swap-nodes-in-pairs/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0024-swap-nodes-in-pairs/</guid><description>Medium | Linked List, Recursion</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>241. 为运算表达式设计优先级</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0241-different-ways-to-add-parentheses/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0241-different-ways-to-add-parentheses/</guid><description>Medium | Math, String, Dynamic Programming, Recursion, Memoization</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>264. 丑数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0264-ugly-number-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0264-ugly-number-ii/</guid><description>Medium | Hash Table, Math, Dynamic Programming, Heap (Priority Queue)</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>279. 完全平方数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0279-perfect-squares/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0279-perfect-squares/</guid><description>Medium | Math, Dynamic Programming, Breadth-First Search</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>29. 两整数相除</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0029-divide-two-integers/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0029-divide-two-integers/</guid><description>Medium | Math, Bit Manipulation</description></item><item><title>299. 猜数字游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0299-bulls-and-cows/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0299-bulls-and-cows/</guid><description>Medium | Hash Table, String, Counting</description></item><item><title>3. 无重复字符的最长子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0003-longest-substring-without-repeating-characters/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0003-longest-substring-without-repeating-characters/</guid><description>Medium | Hash Table, String, Sliding Window</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>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>310. 最小高度树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0310-minimum-height-trees/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0310-minimum-height-trees/</guid><description>Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort</description></item><item><title>316. 去除重复字母</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0316-remove-duplicate-letters/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0316-remove-duplicate-letters/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>319. 灯泡开关</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0319-bulb-switcher/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0319-bulb-switcher/</guid><description>Medium | Math, Brainteaser</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>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>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>43. 字符串相乘</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0043-multiply-strings/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0043-multiply-strings/</guid><description>Medium | Math, String, Simulation</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>5. 最长回文子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0005-longest-palindromic-substring/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0005-longest-palindromic-substring/</guid><description>Medium | Two Pointers, String, Dynamic Programming</description></item><item><title>50. Pow(x, n)</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0050-powx-n/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0050-powx-n/</guid><description>Medium | Math, Recursion</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>6. Z 字形变换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0006-zigzag-conversion/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0006-zigzag-conversion/</guid><description>Medium | String</description></item><item><title>61. 旋转链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0061-rotate-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0061-rotate-list/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>62. 不同路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0062-unique-paths/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0062-unique-paths/</guid><description>Medium | Math, Dynamic Programming, Combinatorics</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>71. 简化路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0071-simplify-path/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0071-simplify-path/</guid><description>Medium | String, Stack</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>77. 组合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0077-combinations/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0077-combinations/</guid><description>Medium | Backtracking</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>8. 字符串转换整数 (atoi)</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0008-string-to-integer-atoi/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0008-string-to-integer-atoi/</guid><description>Medium | String</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>82. 删除排序链表中的重复元素 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0082-remove-duplicates-from-sorted-list-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0082-remove-duplicates-from-sorted-list-ii/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>86. 分隔链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0086-partition-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0086-partition-list/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>89. 格雷编码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0089-gray-code/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0089-gray-code/</guid><description>Medium | Math, Backtracking, Bit Manipulation</description></item><item><title>91. 解码方法</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0091-decode-ways/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0091-decode-ways/</guid><description>Medium | String, Dynamic Programming</description></item><item><title>92. 反转链表 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0092-reverse-linked-list-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0092-reverse-linked-list-ii/</guid><description>Medium | Linked List</description></item><item><title>93. 复原 IP 地址</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0093-restore-ip-addresses/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0093-restore-ip-addresses/</guid><description>Medium | String, Backtracking</description></item><item><title>95. 不同的二叉搜索树 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0095-unique-binary-search-trees-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0095-unique-binary-search-trees-ii/</guid><description>Medium | Dynamic Programming, Backtracking, Tree, Binary Search Tree, Binary Tree</description></item><item><title>96. 不同的二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0096-unique-binary-search-trees/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0096-unique-binary-search-trees/</guid><description>Medium | Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree</description></item><item><title>97. 交错字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0097-interleaving-string/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0097-interleaving-string/</guid><description>Medium | String, Dynamic Programming</description></item><item><title>98. 验证二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0098-validate-binary-search-tree/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0098-validate-binary-search-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree</description></item><item><title>99. 恢复二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0099-recover-binary-search-tree/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0099-recover-binary-search-tree/</guid><description>Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree</description></item></channel></rss>