Given strings s1 and s2, return the shortest contiguous substring of s1 in which s2 is a subsequence. If several have the same length, return the one that starts first. If none exists, return an empty string.
Practise this challenge
All coding challenges