LC-3239 Medium LeetCode

3239. Minimum Number of Flips to Make Binary Grid Palindromic I

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 74% Topics: Array, Two Pointers, Matrix

Reading material

Arrays & Hashing 12 min Two Pointers 9 min Math & Geometry 12 min

Reference solution (spoiler · python)

# Time:  O(m * n)
# Space: O(1)

# array, greedy
class Solution(object):
    def minFlips(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        def count(m, n, get):
            return sum(get(i, j) != get(i, ~j) for i in xrange(m) for j in xrange(n//2))

        m, n = len(grid), len(grid[0])
        return min(count(m, n, lambda i, j: grid[i][j]),
                   count(n, m, lambda i, j: grid[j][i]))

Solution from kamyu104/LeetCode-Solutions · MIT