Search
⌘K

Leetcode 422. Valid Word Square

Check whether a list of words forms a valid word square: for every pair of indices i, j ensure word[i][j] == word[j][i], treating any missing/out-of-range character as a mismatch.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.