You are given an array of strings words.
Two strings of equal length are considered similar if every character in the first string can be shifted cyclically forward in the English alphabet by the same fixed amount to obtain the second string. Shifting the character 'z' forward cyclically wraps around to 'a'.
Return the total number of pairs (i, j) such that words[i] is similar to words[j].
Constraints:
words[i] consists only of lowercase English letters.
You are given an array of strings words.
Two strings of equal length are considered similar if every character in the first string can be shifted cyclically forward in the English alphabet by the same fixed amount to obtain the second string. Shifting the character 'z' forward cyclically wraps around to 'a'.
Return the total number of pairs (i, j) such that words[i] is similar to words[j].
Constraints:
words[i] consists only of lowercase English letters.