973. K 个最接近原点的点
Medium | Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect
Array
980. 不同路径 III
Hard | Array, Backtracking, Bit Manipulation, Matrix
982. 按位与为零的三元组
Hard | Array, Hash Table, Bit Manipulation
994. 腐烂的橘子
Medium | Array, Breadth-First Search, Matrix
996. 平方数组的数量
Hard | Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
999. 车的可用捕获量
Easy | Array, Matrix, Simulation
3201. 寻找最长有效子序列 I
Medium | Array, Dynamic Programming
3202. 求有效子序列的最大长度 II
Medium | Array, Dynamic Programming
3206. 交替组 I
Easy | Array, Sliding Window
3207. 敌人战斗后的最大点数
Medium | Array, Greedy