3501. 通过交换II最大化活跃区段
Hard | Array, String, Binary Search, Segment Tree
Array
3502. 到达每个位置的最小成本
Easy | Array
3505. 使 K 个子数组内元素相等的最少操作次数
Hard | Array, Hash Table, Math, Dynamic Programming, Sliding Window, Heap (Priority Queue)
3507. 最小配对移除操作使数组有序 I
Easy | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set
3508. 实现路由器
Medium | Array, Hash Table, Binary Search, Design, Queue, Ordered Set
3509. 求交替和等于 K 的子序列的最大乘积
Hard | Array, Hash Table, Dynamic Programming
3510. 最小配对移除使数组有序 II
Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set
3512. 使数组总和能被 K 整除的最小操作次数
Easy | Array, Math
3513. 唯一异或三元组数量 I
Medium | Array, Math, Bit Manipulation
3514. 唯一异或三元组的数量 II
Medium | Array, Math, Bit Manipulation, Enumeration