Given two strings S1 and S2, find the shortest subsequence in S1 that contains all the characters in S2.
Note: the order in which S2's characters appear in S1 does not matter
S1 = "ABCKLADEKCLB"
S2 = "BEK"
shortest subsequence is "EKCLB"
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.