1776. 车队 II
Hard | Array, Math, Stack, Heap (Priority Queue), Monotonic Stack
Monotonic Stack
1504. 统计全为1的子矩形
Medium | Array, Dynamic Programming, Stack, Matrix, Monotonic Stack
3229. 使数组等于目标数组所需的最少操作数
Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack
3420. 经过 K 次操作后非递减子数组的数量
Hard | Array, Stack, Segment Tree, Queue, Sliding Window, Monotonic Stack, Monotonic Queue
3430. 最多 K 个元素的子数组的最大值和最小值之和
Hard | Array, Math, Stack, Monotonic Stack
3523. 使数组非递减
Medium | Array, Stack, Greedy, Monotonic Stack
3542. 将所有元素转换为零的最少操作次数
Medium | Array, Hash Table, Stack, Greedy, Monotonic Stack
3638. 最大平衡货运数量
Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack
3676. 碗形子数组计数
Medium | Array, Stack, Monotonic Stack
3816. 删除重复字符后的字典序最小字符串
Hard | Hash Table, String, Stack, Greedy, Monotonic Stack
3878. 统计好子数组的数量
Hard | Array, Stack, Bit Manipulation, Monotonic Stack
3113. 找到边界元素是最大值的子数组数量
Hard | Array, Binary Search, Stack, Monotonic Stack
2736. 最大和查询
Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Sorting, Monotonic Stack
2818. 应用操作最大化分数
Hard | Array, Math, Stack, Greedy, Sorting, Monotonic Stack, Number Theory
2865. 美丽塔 I
Medium | Array, Stack, Monotonic Stack
2866. 美丽塔 II
Medium | Array, Stack, Monotonic Stack
2940. 找到爱丽丝和鲍勃可以相遇的建筑
Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack
2945. 寻找最大非递减数组长度
Hard | Array, Binary Search, Dynamic Programming, Stack, Queue, Monotonic Stack, Prefix Sum, Monotonic Queue
2030. 长度为 K 且字母出现次数最少的最小字典序子序列
Hard | String, Stack, Greedy, Monotonic Stack
2104. 子数组范围之和
Medium | Array, Stack, Monotonic Stack