'''
You are given two arrays, one shorter (with all distinct elements) and one longer. Find the shortest subarray in the longer array that contains all the elemtns in the shorter array. The items can appear in any order.

Example:
    Input: {1, 5, 9} | {7, 5, 9, 0, 2, 1, 3, 5, 7, 9, 1, 1, 5, 8, 8, 9, 7}
    Output: [7, 10]  --> because of the      ^  ^  ^  ^=5791

Hints: 645, 652, 669, 681, 691, 725, 731, 741
'''


def shortest_super_seq(s):
    pass

if __name__ == '__main__':
    assert shortest_super_seq('') ==
    assert shortest_super_seq('') ==
    assert shortest_super_seq('') ==
    assert shortest_super_seq('') ==
    assert shortest_super_seq('') ==
