def longest_common_suffix()

in understanding_rl_vision/rl_clarity/interface.py [0:0]

• 5 lines of code
• 4 McCabe index (conditional complexity)

def longest_common_suffix(l):
    l = set([s[-min(map(len, l)) :] for s in l])
    while len(l) > 1:
        l = set([s[1:] for s in l])
    return list(l)[0]