A simple and efficient way to check Toeplitz matrix which always has the same row and column along its main diagonal

var validWordSquare = function(words) {
  const n = words.length
  for (let i = 0; i < n; i++) {
    let cnt = 0
    for (let j = i + 1; j < n; j++) {
      if (words[j].length > i) cnt++
      else break
    }
    const m = words[i].length
    if (cnt != Math.max(m - i - 1, 0)) return false
    for (let j = i + 1; j < m; j++) {
      if (words[i][j] !== words[j][i]) return false
    }
  }
  return true
};

func validWordSquare(words []string) bool {
  n := len(words)
  for i := 0; i < n; i++ {
    cnt := 0
    for j := i + 1; j < n; j++ {
      if len(words[j]) > i {
        cnt++
      } else {
        break
      }
    }
    m := len(words[i])
    if cnt != max(0, m - i - 1) {
      return false
    }
    for j := i + 1; j < m; j++ {
      if words[i][j] != words[j][i] {
        return false
      }
    }
  }
  return true
}
func max(a, b int) int {
  if a > b {
    return a
  }
  return b
}

class Solution {
  function validWordSquare($words) {
    $n = count($words);
    for ($i = 0; $i < $n; $i++) {
      $cnt = 0;
      for ($j = $i + 1; $j < $n; $j++) {
        if (strlen($words[$j]) > $i) $cnt++;
        else break;
      }
      $m = strlen($words[$i]);
      if ($cnt != max(0, $m - $i - 1)) return false;
      for ($j = $i + 1; $j < $m; $j++) {
        if ($words[$i][$j] != $words[$j][$i]) return false;
      }
    }
    return true;
  }
}

class Solution {
  public boolean validWordSquare(List<String> words) {
    int n = words.size();
    for (int i = 0; i < n; i++) {
      int cnt = 0;
      for (int j = i + 1; j < n; j++) {
        if (words.get(j).length() > i) cnt++;
        else break;
      }
      int m = words.get(i).length();
      if (cnt != Math.max(m - i - 1, 0)) return false;
      for (int j = i + 1; j < m; j++) {
        char a = words.get(i).charAt(j);
        char b = words.get(j).charAt(i);
        if (a != b) return false;
      }
    }
    return true;
  }
}

public class Solution {
  public bool ValidWordSquare(IList<string> words) {
    int n = words.Count;
    for (int i = 0; i < n; i++) {
      int cnt = 0;
      for (int j = i + 1; j < n; j++) {
        if (words[j].Length > i) cnt++;
        else break;
      }
      int m = words[i].Length;
      if (cnt != Math.Max(0, m - i - 1)) return false;
      for (int j = i + 1; j < m; j++) {
        if (words[i][j] != words[j][i]) return false;
      }
    }
    return true;
  }
}

class Solution {
public:
  bool validWordSquare(vector<string>& words) {
    int n = words.size();
    for (int i = 0; i < n; i++) {
      int cnt = 0;
      for (int j = i + 1; j < n; j++) {
        if (words[j].size() > i) cnt++;
        else break;
      }
      int m = words[i].size();
      if (cnt != max(0, m - i - 1)) return false;
      for (int j = i + 1; j < m; j++) {
        if (words[i][j] != words[j][i]) return false;
      }
    }
    return true;
  }
};

#define MAX(a, b) (a > b ? a : b)
bool validWordSquare(char ** words, int wordsSize){
  for (int i = 0; i < wordsSize; i++) {
    int cnt = 0;
    for (int j = i + 1; j < wordsSize; j++) {
      if (strlen(words[j]) > i) cnt++;
      else break;
    }
    int m = strlen(words[i]);
    if (cnt != MAX(0, m - i - 1)) return false;
    for (int j = i + 1; j < m; j++) {
      if (words[i][j] != words[j][i]) return false;
    }
  }
  return true;
}

class Solution:
  def validWordSquare(self, words: List[str]) -> bool:
    n = len(words)
    for i in range(0, n):
      cnt = 0
      for j in range(i + 1, n):
        if len(words[j]) > i: cnt += 1
        else: break
      m = len(words[i])
      if cnt != max(0, m - i - 1): return False
      for j in range(i + 1, m):
        if words[i][j] != words[j][i]: return False
    return True