Disclaimer: Here is the practice link to help you assess your knowledge better. It's highly recommend trying to solve it before looking at the solution.

Brute Force Approach

Algorithm

In a 90-degree clockwise rotation, each element in the matrix moves from its original position to a new position based on a specific pattern. The first column becomes the first row (in reverse order) and second column becomes the second row, and so on.
We can simulate this movement by using a new matrix. For each element at position (i, j) in the original matrix, we calculate its new position in the rotated matrix as (j, n - i - 1) where n is the size of the matrix.

Initialize an empty matrix of the same size (n x n).
Loop through every element of the original matrix using two nested loops.
For each element at position (i, j), place it in the new matrix at position (j, n - i - 1).
After completing the placement for all elements, return or copy the new matrix.

Code

1234567891011121314151617181920