3519. 计算非递减数字的数量
Hard | Math, String, Dynamic Programming
Math
3524. 寻找数组的X值 I
Medium | Array, Math, Dynamic Programming
3525. 求数组的 X 值 II
Hard | Array, Math, Segment Tree
3536. 两位数的最大乘积
Easy | Math, Sorting
3539. 寻找神奇序列的数组乘积之和
Hard | Array, Math, Dynamic Programming, Bit Manipulation, Combinatorics, Bitmask
3547. 图中边值的最大和
Hard | Math, Greedy, Graph Theory
3550. 数字和等于索引的最小下标
Easy | Array, Math
3556. 最大质数子串的和
Medium | Hash Table, Math, String, Sorting, Number Theory
3558. 分配边权重的方案数 I
Medium | Math, Tree, Depth-First Search
3559. 边权重分配的方案数II
Hard | Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
3560. 寻找最小原木运输成本
Easy | Math
3569. 分割后不同质数个数的最大值
Hard | Array, Math, Segment Tree, Number Theory
3588. 找到三角形的最大面积
Medium | Array, Hash Table, Math, Greedy, Geometry, Enumeration
3589. 统计质数间隔平衡的子数组
Medium | Array, Math, Queue, Sliding Window, Number Theory, Monotonic Queue
3591. 检查是否有元素的频率为质数
Easy | Array, Hash Table, Math, Counting, Number Theory
3602. 十六进制和三十六进制转换
Easy | Math, String
3605. 数组的最小稳定性因子
Hard | Array, Math, Binary Search, Greedy, Segment Tree, Number Theory
3609. 到达网格目标的最小移动次数
Hard | Math
3618. 按质数索引分割数组
Medium | Array, Math, Number Theory
3621. 具有 Popcount-Depth 等于 K 的整数数量 I
Hard | Math, Dynamic Programming, Bit Manipulation, Combinatorics