3367. 边删除后权重和的最大值
Hard | Dynamic Programming, Tree, Depth-First Search, Sorting
Posts
3370. 全设置位的最小数
Easy | Math, Bit Manipulation
3371. 识别数组中的最大异常值
Medium | Array, Hash Table, Counting, Enumeration
3372. 连接树后最大化目标节点数 I
Medium | Tree, Depth-First Search, Breadth-First Search
3373. 连接树后可到达目标节点的最大数目 II
Hard | Tree, Depth-First Search, Breadth-First Search
3375. 使数组值等于 K 的最少操作次数
Easy | Array, Hash Table
3376. 打破锁的最少时间 I
Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Breadth-First Search, Bitmask
3377. 数字操作使两个整数相等
Medium | Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Path
3378. LCM 图中的连通分量数目
Hard | Array, Hash Table, Math, Union-Find, Number Theory
3379. 转换数组
Easy | Array, Simulation
3380. 最大矩形面积与点约束 I
Medium | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumeration
3381. 长度可被 K 整除的最大子数组和
Medium | Array, Hash Table, Prefix Sum
3382. 具有点约束的最大面积矩形 II
Hard | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting
3386. 按键时间最长的按钮
Easy | Array
3387. 两天转换后的最大金额
Medium | Array, String, Depth-First Search, Breadth-First Search, Graph Theory
3388. 数组中的美丽分割数
Medium | Array, Dynamic Programming
3389. 使字符频率相等的最小操作数
Hard | Hash Table, String, Dynamic Programming, Counting, Enumeration
3392. 满足条件的长度为三的子数组
Easy | Array
3393. 具有给定异或值的路径数
Medium | Array, Dynamic Programming, Bit Manipulation, Matrix
3394. 检查网格是否可以被切割成多个部分
Medium | Array, Sorting