1284. 将二进制矩阵转换为零矩阵的最小翻转次数
Hard | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix
Hard | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix
Hard | Array, Dynamic Programming, Matrix
Hard | Array, Breadth-First Search, Matrix
Hard | Array, Breadth-First Search, Graph Theory
Hard | Array, Math, String, Backtracking
Hard | Array, Dynamic Programming, Greedy
Hard | Array, Math, Greedy
Hard | Array, Dynamic Programming
Hard | Array, Dynamic Programming, Sorting
Hard | Array, Hash Table, Breadth-First Search
Hard | Array, Heap (Priority Queue)
Hard | Math, Dynamic Programming, Combinatorics
Hard | Array, Math, Dynamic Programming, Greedy, Sorting
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Hard | Dynamic Programming, Tree, Depth-First Search, Binary Search Tree, Binary Tree
Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theory
Hard | Array, Greedy, Sorting, Heap (Priority Queue)
Hard | String, Rolling Hash, String Matching, Hash Function
Hard | String, Dynamic Programming, String Matching
Hard | Array, Dynamic Programming, Greedy, Sorting