make-a-square-with-the-same-color.py

# Time:  O((n - w + 1)^2 * w^2)
# Space: O(1)

import collections


# array
class Solution(object):
    def canMakeSquare(self, grid):
        """
        :type grid: List[List[str]]
        :rtype: bool
        """
        N, W = 3, 2
        return any(max(collections.Counter(grid[i+h][j+w] for h in xrange(W) for w in xrange(W)).itervalues()) >= W**2-1
                   for i in xrange(N-W+1) for j in xrange(N-W+1))