[Java] Leetcode 76. Minimum Window Substring [Sliding Window #8]

preview_player
Показать описание
In this video, I'm going to show you how to solve Leetcode 76. Minimum Window Substring which is related to Sliding Window.

Here’s a quick rundown of what you’re about to learn:

⭐️ Course Contents ⭐️
⌨️ (0:00) Question
⌨️ (1:13) Solution Explain
⌨️ (5:02) Code

In the end, you’ll have a really good understanding on how to solve Leetcode 76. Minimum Window Substring and questions that are similar to Sliding Window.

Now, if you want to get good at Sliding Window, please checkout my Sliding Window playlist.

  1. Eric Programming
  2. leetcode Minimum Window Substring
  3. leetcode 76
  4. leetcode 76 Minimum Window Substring
  5. 76 Minimum Window Substring
  6. eric programming leetcode 76
Рекомендации по теме
[Java] Leetcode 76. 0:14:16

[Java] Leetcode 76. Minimum Window Substring [Sliding Window #8]

Minimum Window Substring 0:25:41

Minimum Window Substring - Airbnb Interview Question - Leetcode 76

Leetcode | 76. 0:21:23

Leetcode | 76. Minimum Window Substring | Hard | Java Solution

LeetCode 76. Minimum 0:09:37

LeetCode 76. Minimum Window Substring (Java)

LeetCode 76 | 0:08:02

LeetCode 76 | Minimum Window Substring | Sliding Windows | Java

76. Minimum Window 0:14:24

76. Minimum Window Substring | LeetCode | Java Solution

L12. Minimum Window 0:27:06

L12. Minimum Window Substring | 2 Pointers and Sliding Window Playlist

Minimum Window Substring 0:18:00

Minimum Window Substring | Sliding Window | LeetCode

Minimum Window Substring 0:16:57

Minimum Window Substring | Leetcode #76

Оптимизация до которой 0:11:22

Оптимизация до которой 😨 НЕПРОСТО догадаться | LeetCode №052 - Minimum Window Substring...

Minimum Window Substring 0:28:44

Minimum Window Substring - Sliding Window - Leetcode 76 - Python and Java

Leetcode 76: Minimum 0:22:45

Leetcode 76: Minimum window substring - (Explained) | Java

Minimum Window Substring 0:33:43

Minimum Window Substring | LeetCode 76 | Java

LeetCode 76 | 0:15:25

LeetCode 76 | Minimum Window Substring

Minimum Window Substring 0:40:43

Minimum Window Substring | Leetcode 76 | Java Tutorial | Step by Step explanation | Sliding Window

LeetCode: 76. Minimum 0:19:18

LeetCode: 76. Minimum Window Substring(Hard) - Golang, Java

Minimum Window Substring 0:38:06

Minimum Window Substring | Google | Leetcode 76

Minimum Window Substring 0:16:00

Minimum Window Substring | LeetCode 76 | Java | Variable Size Sliding Window | @LearnOverflow​

𝐌𝐢𝐧𝐢𝐦𝐮𝐦 𝐖𝐢𝐧𝐝𝐨𝐰 𝐒𝐮𝐛𝐬𝐭𝐫𝐢𝐧𝐠 0:23:05

𝐌𝐢𝐧𝐢𝐦𝐮𝐦 𝐖𝐢𝐧𝐝𝐨𝐰 𝐒𝐮𝐛𝐬𝐭𝐫𝐢𝐧𝐠 #Leetcode #76 #SlidingWindowTechnique...

Minimum Window Substring 0:01:00

Minimum Window Substring - Leetcode 76 - Sliding Window

Minimum Window Substring 0:13:49

Minimum Window Substring - LeetCode 76 - JavaScript

Minimum Window Substring 0:25:14

Minimum Window Substring | Sliding Window - Double pointer concept | Leetcode #76

Minimum Window Substring 0:25:07

Minimum Window Substring - Leetcode 76 - Sliding Window (Java)

76. Minimum Window 0:08:23

76. Minimum Window Substring - Day 22/31 Leetcode October Challenge

Комментарии
Автор

Thank you for the explanation! I was able to solve this problem using a condition 'window contains the min number of t characters' however I was using a set and two frequency maps so the solution was slow. It is nice to learn about a better & faster way to solve these problems with just one frequency map :)

MangoTroll
Автор

One thing I don't get is why minLen is set to Max_Value. For line 33 isn't it usually always going to be true? I don't understand setting curWindow to minLen also. Could you explain? Thank you!!

alexshay
Автор

Please do mention Time and Space complexity of the code in the description

mehboobshah
Автор

Store freq if t in 1 map and change it acc to main string and finally give output

divyanshtripathi
Автор

It's very weird that your code runs at 7ms and mine is around 125ms. Both are exactly the same code. Magic?

journalist
Автор

Wouldn't ++arr[leftChar] > 0 hold true for every character?

slimreaper
visit shbcf.ru