3319. 二叉树中第 K 大的完美子树大小
Medium | Tree, Depth-First Search, Sorting, Binary Tree
Depth-First Search
3327. 检查DFS字符串是否为回文
Hard | Array, Hash Table, String, Tree, Depth-First Search, Hash Function
3331. 找出变化后的子树大小
Medium | Array, Hash Table, String, Tree, Depth-First Search
3367. 边删除后权重和的最大值
Hard | Dynamic Programming, Tree, Depth-First Search, Sorting
3372. 连接树后最大化目标节点数 I
Medium | Tree, Depth-First Search, Breadth-First Search
3373. 连接树后可到达目标节点的最大数目 II
Hard | Tree, Depth-First Search, Breadth-First Search
3387. 两天转换后的最大金额
Medium | Array, String, Depth-First Search, Breadth-First Search, Graph Theory
3419. 最小化图的最大边权重
Medium | Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Path
3425. 最长特殊路径
Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum
3486. 最长特殊路径 II
Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum
3493. 属性图
Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
3528. 单位转换 I
Medium | Depth-First Search, Breadth-First Search, Graph Theory
3544. 子树反转和
Hard | Array, Dynamic Programming, Tree, Depth-First Search
3553. 带权重子图的最小路径 II
Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
3558. 分配边权重的方案数 I
Medium | Math, Tree, Depth-First Search
3559. 边权重分配的方案数II
Hard | Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
3562. 股票交易折扣的最大利润
Hard | Array, Dynamic Programming, Tree, Depth-First Search
3590. 第K小路径异或和
Hard | Array, Tree, Depth-First Search, Ordered Set
3593. 最少增量使叶子路径相等
Medium | Array, Dynamic Programming, Tree, Depth-First Search
3607. 电网维护
Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Set