2835. 形成目标和子序列的最少操作次数
Hard | Array, Greedy, Bit Manipulation
Hard
2836. 传球游戏中函数的最大值
Hard | Array, Dynamic Programming, Bit Manipulation
2842. 具有最大美丽值的字符串的 K 子序列数量
Hard | Hash Table, Math, String, Greedy, Sorting, Combinatorics
2846. 树中边权重均衡查询的最小操作数
Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
2851. 字符串变换
Hard | Math, String, Dynamic Programming, String Matching
2858. 最少边反转次数使每个节点都可达
Hard | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory
2862. 完整子集的最大元素和
Hard | Array, Math, Number Theory
2867. 树中的有效路径数目
Hard | Math, Dynamic Programming, Tree, Depth-First Search, Number Theory
2872. K 可整除组件的最大数量
Hard | Tree, Depth-First Search
2876. 统计有向图中被访问的节点数
Hard | Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort, Memoization