You have a matrix filled with s and exactly one . The matrix becomes beautiful when the is in the center position (row , column ). Your task: find the minimum number of adjacent swaps needed to move the to the center.
This problem tests 2D array traversal and distance calculation. You'll loop through a grid to find a target element, then compute how far it needs to move.
Count the distance.