# Problem 13: Minimum Inclusive Span (Minimum Window Substring)

## Problem Statement
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. If there is no such substring, return the empty string "".

## Input Format
- Two strings `s` and `t`.

## Example
**Input:** s = "ADOBECODEBANC", t = "ABC"  
**Output:** "BANC"