3238. 获胜玩家的数量
Easy | Array, Hash Table, Counting
Posts
3239. 使二进制网格回文的最少翻转次数 I
Medium | Array, Two Pointers, Matrix
3240. 使二进制网格回文的最少翻转次数 II
Medium | Array, Two Pointers, Matrix
3241. 标记所有节点所需的时间
Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theory
3242. 设计邻居和服务
Easy | Array, Hash Table, Design, Matrix, Simulation
3243. 道路查询后的最短距离 I
Medium | Array, Breadth-First Search, Graph Theory
3244. 道路修建查询后的最短距离 II
Hard | Array, Greedy, Graph Theory, Ordered Set
3245. 交替组 III
Hard | Array, Binary Indexed Tree, Ordered Set
3248. 矩阵中的蛇
Easy | Array, String, Simulation
3249. 统计好节点的数量
Medium | Tree, Depth-First Search
3250. 单调对的数目 I
Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
3251. 单调数对的数目 II
Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
3254. 长度为 K 的子数组的能量值 I
Medium | Array, Sliding Window
3255. 找到K大小子数组的幂II
Medium | Array, Sliding Window
3256. 通过放置三个车获得的最大价值和 I
Hard | Array, Dynamic Programming, Matrix, Enumeration
3257. 通过放置三个车获得最大价值和 II
Hard | Array, Dynamic Programming, Matrix, Enumeration
3258. 统计满足 K 约束的子字符串数量 I
Easy | String, Sliding Window
3259. 两种饮品的最大能量提升
Medium | Array, Dynamic Programming
3260. 找到能被 K 整除的最大回文数
Hard | Math, String, Dynamic Programming, Greedy, Number Theory
3261. 计算满足 K 约束的子字符串数量 II
Hard | Array, String, Binary Search, Sliding Window, Prefix Sum