3105. 最长严格递增或严格递减子数组
Easy | Array
Array
3107. 使数组中位数等于 K 的最少操作数
Medium | Array, Greedy, Sorting
3108. 加权图中的最小费用路径
Hard | Array, Bit Manipulation, Union-Find, Graph Theory
3111. 覆盖点的最小矩形数量
Medium | Array, Greedy, Sorting
3112. 访问消失节点的最短时间
Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path
3113. 找到边界元素是最大值的子数组数量
Hard | Array, Binary Search, Stack, Monotonic Stack
3115. 最大质数差
Medium | Array, Math, Number Theory
3116. 单一面额组合的第K小金额
Hard | Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theory
3117. 通过划分数组的最小值和
Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queue
3122. 满足条件的最小操作数
Medium | Array, Dynamic Programming, Matrix