GitHub

existence-of-a-substring-in-a-string-and-its-reverse.py

for i in xrange(len(s)-1): lookup[ord(s[i])-ord('a')][ord(s[i+1])-ord('a')] = True return any(lookup[ord(s[i+1])-ord('a')][ord(s[i])-ord('a')] for i in xrange(len(s)-1)) ...
GitHub

substring-with-concatenation-of-all-words.py

# You are given a string, S, and a list of words, L, that are all of the same length. # Find all starting indices of substring(s) in S that is a concatenation of each word # in L exactly once and ...