search

GDSC-IGDTUW-Autumn-of-Code-2022 / dsa-foundation

To submit questions and answers for DSA.
5 stars 43 forks source link

Minimum Window Substring #65

Closed gh4abhi closed 1 year ago

gh4abhi commented 1 year ago

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 "".

The testcases will be generated such that the answer is unique.

gh4abhi commented 1 year ago

Please assign this issue to me.

gh4abhi commented 1 year ago

@gdsc-igdtuw @Parul-Mann

mad-alpha commented 1 year ago

Please assign this issue to me @gdsc-igdtuw @Parul-Mann