“Minimum Window Substring”
Hi, I’d like to suggest adding the “Minimum Window Substring” problem to the JavaScript (or other) track.
Task: Return the shortest substring of s that contains all characters from t (including duplicates).
Examples:
minWindow(“ADOBECODEBANC”, “ABC”) // “BANC”
minWindow(“aaabcbc”, “aabc”) // “aabc”
This is a solid medium-level challenge involving sliding window and hash maps. I didn’t find it on Exercism and would be happy to help add it.