• + 0 comments

    I came up with this solution based on your explanation.

    def flippingMatrix(matrix):

    l = len(matrix)-1
    num_groups = (len(matrix)**2)/4
    iterator = int(num_groups**(1/2))
    groups = []
    
    for i in range(iterator):
        for j in range(iterator):
            groups.append([matrix[i][j], matrix[i][l-j], matrix[l-i][j], matrix[l-i][l-j]])
    maxs = []
    for i in range(len(groups)):
        maxs.append(max(groups[i]))
    
    return sum(maxs)