Minimum Window Substring

Find the shortest contiguous substring of text that contains every character of pattern, including repeats. If several are equally short, return the leftmost.

Implement min_window(text, pattern).

Input

text: The text to search. pattern: The characters that must appear.

Output

Return the shortest window, or an empty string if none exists.

제약 조건

1 ≤ length of text, pattern ≤ 100,000 (ASCII)

예시

입력:
text = "ADOBECODEBANC"
pattern = "ABC"

예상 출력:
expected = "BANC"

입력:
std::string text = "ADOBECODEBANC";
std::string pattern = "ABC";

예상 출력:
std::string expected = "BANC";

입력:
string text = "ADOBECODEBANC";
string pattern = "ABC";

예상 출력:
string expected = "BANC";

입력:
text = "a"
pattern = "aa"

예상 출력:
expected = ""

입력:
std::string text = "a";
std::string pattern = "aa";

예상 출력:
std::string expected = "";

입력:
string text = "a";
string pattern = "aa";

예상 출력:
string expected = "";

참고 자료

이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.

• From Problems to Performance: Two Decades of Programming Contests in the CCSC Southeast