1675. 最小化数组偏差
Hard | Array, Greedy, Heap (Priority Queue), Ordered Set
Hard
1687. 从仓库向港口运送箱子
Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue
1719. 重构一棵树的方案数
Hard | Array, Hash Table, Tree, Graph Theory, Simulation
1770. 执行乘法运算的最大分数
Hard | Array, Dynamic Programming
1771. 从子序列构造最长回文串
Hard | String, Dynamic Programming
1776. 车队 II
Hard | Array, Math, Stack, Heap (Priority Queue), Monotonic Stack
1787. 使所有 K 个大小的段的异或为零
Hard | Array, Hash Table, Dynamic Programming, Bit Manipulation, Counting
1803. 区间内异或对的数目
Hard | Array, Bit Manipulation, Trie
1819. 不同子序列 GCD 的数量
Hard | Array, Math, Counting, Number Theory
1883. 准时到达会议现场的最小跳过次数
Hard | Array, Dynamic Programming