## Question 1
What is the output if the following strings are given as input?

`s` = “cabwefgewcwaefgcf”

`t` = “cae”
### Options

1. "cwae"
Correct
This is the shortest substring of `s` that contains all the characters of `t` with their frequencies at least equal to their corresponding frequencies in `t`.
----------------------------

2. "cabwe"
Incorrect
All the required characters are present, but it isn't the _shortest_ substring.
----------------------------

3. "aefgc"
Incorrect
All the required characters are present, but it isn't the _shortest_ substring.
----------------------------

4. ""
Incorrect

----------------------------

---------------------------------------------

## Question 2
What is the output if the following strings are given as input?

`s` = “bbaac”

`t` = “aba”


### Options

1. "bba"
Incorrect

----------------------------

2. "baa"
Correct
This is the shortest substring of `s` that contains all the characters of `t` with their frequencies at least equal to their corresponding frequencies in `t`.
----------------------------

3. "bbaa"
Incorrect

----------------------------

4. ""
Incorrect

----------------------------

---------------------------------------------

## Question 3
What is the output if the following strings are given as input?

`s` = “AbabbbAbaA”

`t` = “Bab”

### Options

1. "bAb"
Incorrect

----------------------------

2. "bab"
Incorrect

----------------------------

3. "abb"
Incorrect

----------------------------

4. ""
Correct
Since the character '$B$' in `t` is not present in `s`, no substring of `s` can be the minimum window substring of `t`.
----------------------------

---------------------------------------------