0249.py

# 0249. Group Shifted Strings
# Given an array of strings (all lowercase), group them s.t. all strings in a group are shifted versions of each other.
# Two string S and T are called shifted (S[i] = T[i] + k for 1 <= i <= S.length

# ----------------------------------------------------------------------
# Clarifications:
#

# Inputs:
strings = {"acd", "dfg", "wyz", "yab", "mop", "bdfh", "a", "x", "moqs"};
# Output: a x
 #        acd dfg wyz yab mop
 #        bdfh moqs

# ----------------------------------------------------------------------
# Sol1: O() / O()
n = len(strings)

if n <= 1:
    ans = []

ans = {}
for s in strings:
    m = len(s)
    if m not in ans:
        ans{m} = s


string = "acd"
m = len(word)

for ch in string




for i in range(1,n):
    diff = ord(word[i]) - ord(word[i-1])



    diff = ord(ch) - ord(ch)

ord("a") - ord("b")


# ----------------------------------------------------------------------
# Submit: Sol1, O() / O()
class Solution:
    def groupStrings(self, strings):
        n = len(strings)
        return n

# --------------
# Test:
sol = Solution()
print(sol.groupStrings(strings))

d = dict()
d{'1'} = 'a'