3229. 使数组等于目标数组所需的最少操作数
Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack
Hard
3235. 检查矩形角落是否可达
Hard | Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometry
3241. 标记所有节点所需的时间
Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theory
3244. 道路修建查询后的最短距离 II
Hard | Array, Greedy, Graph Theory, Ordered Set
3245. 交替组 III
Hard | Array, Binary Indexed Tree, Ordered Set
3250. 单调对的数目 I
Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
3251. 单调数对的数目 II
Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
3256. 通过放置三个车获得的最大价值和 I
Hard | Array, Dynamic Programming, Matrix, Enumeration
3257. 通过放置三个车获得最大价值和 II
Hard | Array, Dynamic Programming, Matrix, Enumeration
3260. 找到能被 K 整除的最大回文数
Hard | Math, String, Dynamic Programming, Greedy, Number Theory