HardStrings
Minimum Window Substring II
Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window.
This is an Arena challenge - solutions are not shown publicly.
Work on this problem and submit your solution to contribute!