Beautiful Matrix - Algorithm

Here's your approach:

$1.$ Create a $5 \times 5$ array to store the matrix.

$2.$ Use nested loops to read the input: outer loop for rows ($1$ to $5$), inner loop for columns ($1$ to $5$).

$3.$ While reading, check if the current element is $1$. If yes, remember its row and column.

$4.$ After finding the $1$ at position $(r, c)$, compute the distance: distance = abs(r - 3) + abs(c - 3).

$5.$ Output the distance. That's the minimum number of swaps needed.