---
title: "Discussion on \"Minimum Window Substring - LeetCode Problem\" | Hashnode"
description: "Discussion on \"Minimum Window Substring - LeetCode Problem\". Given two strings s and t, return the minimum window in s which will contain all the characters in t."
url: "https://hashnode.com/posts/minimum-window-substring-leetcode-problem/6411bdc3f29b4fab8499aa81"
---

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

Discussion

# [Minimum Window Substring - LeetCode Problem](https://blog.eyucoder.com/minimum-window-substring-leetcode-problem?utm_source=hashnode&utm_medium=feed)

Given two strings s and t, return the minimum window in s which will contain all the characters in t.

Mar 15, 2023 · 3 min read · blog.eyucoder.com  
Read the article

-   [#sliding-window](https://hashnode.com/tag/sliding-window)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#python](https://hashnode.com/tag/python)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)

## Written by

[Eyuel Dan⭐⭐⭐](https://hashnode.com/@Eyuel)

@Eyuel

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

Android | Python | React | GPT

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
