This is a popular twist Meta interviewers often put on the classic leetcode problem to find a minimum window substring.

Given an input string and an alphabet (set of characters), find the shortest substring of the input that contains all characters from the alphabet at least once. ...