python_task.py

def rotate_in_place(matrix):
    # start at top left, rotate all the outermost corners
    # repeat for the full row and this will result in the
    # entire outermost "shell" being rotated and then move
    # to the cell diagonally South-East of the top left and
    # continue repeating
    n = len(matrix)
    for r in range(int(n / 2)):
        # Iterate through the elements in the current layer
        for c in range(r, n - r - 1):
            # store the top-left value
            tmp = matrix[r][c]
            # bottom-left to top-left
            matrix[r][c] = matrix[n - 1 - c][r]
            # bottom-right to bottom-left
            matrix[n - 1 - c][r] = matrix[n - 1 - r][n - 1 - c]
            # top-right to bottom-right
            matrix[n - 1 - r][n - 1 - c] = matrix[c][n - 1 - r]
            # put the old top-left (temp) to top-right
            matrix[c][n - 1 - r] = tmp


MATRIX1 = [
    [ 1,  2,  3,  4],
    [ 5,  6,  7,  8],
    [ 9, 10, 11, 12],
    [13, 14, 15, 16]
]

EXPECTED1 = [
    [13,  9,  5,  1],
    [14, 10,  6,  2],
    [15, 11,  7,  3],
    [16, 12,  8,  4]
]

MATRIX2 = [
    [ 1,  2,  3,  4,  5,  6,  7],
    [ 8,  9, 10, 11, 12, 13, 14],
    [15, 16, 17, 18, 19, 20, 21],
    [22, 23, 24, 25, 26, 27, 28],
    [29, 30, 31, 32, 33, 34, 35],
    [36, 37, 38, 39, 40, 41, 42],
    [43, 44, 45, 46, 47, 48, 49]
]

EXPECTED2 = [
    [43, 36, 29, 22, 15,  8,  1],
    [44, 37, 30, 23, 16,  9,  2],
    [45, 38, 31, 24, 17, 10,  3],
    [46, 39, 32, 25, 18, 11,  4],
    [47, 40, 33, 26, 19, 12,  5],
    [48, 41, 34, 27, 20, 13,  6],
    [49, 42, 35, 28, 21, 14,  7]
]

for testcase, expected in ((MATRIX1, EXPECTED1), (MATRIX2, EXPECTED2)):
    rotate_in_place(testcase)
    if testcase != expected:
        print('Testcase failed. Actual vs. Expected:')
        n = len(expected)
        for r1, r2 in zip(testcase, expected):
            print(f'{str(r1):<{4*n}} {r2}')
        print()
    else:
        print('Testcase OK!')