---
title: "Discussion on \"Problem: Minimum Window Substring\" | Hashnode"
description: "Discussion on \"Problem: Minimum Window Substring\". 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 \"\".\nThe testca..."
url: "https://hashnode.com/posts/problem-minimum-window-substring/632d8e88f34b380b4b9be47e"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Problem: Minimum Window Substring](https://mackph.hashnode.dev/problem-minimum-window-substring?utm_source=hashnode&utm_medium=feed)

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

Sep 23, 2022 · 2 min read · mackph.hashnode.dev  
Read the article

-   [#java](https://hashnode.com/tag/java)
-   [#problem-solving-skills](https://hashnode.com/tag/problem-solving-skills)

## Written by

[ANKUSH KUMAR](https://hashnode.com/@akankushjnvku)

@akankushjnvku · India

  
[View profile](https://hashnode.com/@akankushjnvku)

I am an intermediate back-end developer, graphic and Adobe designer working for the past few years.

({MERN Stack Developer at mackph}) | <Ex-Internshala Student Partner(ISP 16)> | <5 star coder at Hackerrank> | <Self employed at Mackph> | <GSSoC '22 Contributor> | <Ex-Campus Ambassador at International MUN>

## Responses

Markdown supported · ⌘↵ to post

No responses yet.