Sorting Challenge

Given a square matrix M of size N in which each element is a lower case alphabet, elements of matrix are identified as M[i][j], where i stands for row, j stands for column. The following operation can be performed any number of times: Two adjacent characters in the same row can be swapped i.e., M[i][j] & M[i][j+1] can be swapped for all valid i, j. Determine whether the given square matrix can b