Leetcode - Minimum Window Substring (Python)

Показать описание

Leetcode Blind Curated 75
Leetcode - Minimum Window Substring #73
Difficulty: Hard(?)

Timothy H Chang

Рекомендации по теме

Комментарии

Died at the disappointment in your voice at the end with "and remember do not trust me, I know nothing..."

EJupkeep

Thank you for your explanation using the more efficient solution! Really helped me to understand as I go through it with pen and paper!

bennypham

The brute force for this problem was throwing me for a bit quite a bit on this one! Thanks for walking through the approaches again!

janmichaelaustria

The reason why u didn't have to do start:end+1 was because your end pointer would anyways move to the next
For eg:
AB
End on A
Count becomes 0
But end +1 is the last line
So ur end becomes 1
That's why s[0:2]
Therefore AB

haydencordeiro

This approach will not work for the following: s="aa" t="aa" and s="bbaa" t="aba".

BharathReddyPothuluru

Super solution sir. But I did not understood the second solution though

sharifmansuri

Leetcode - Minimum Window Substring (Python)

Minimum Window Substring - Airbnb Interview Question - Leetcode 76

Minimum Window Substring | Sliding Window | LeetCode

Minimum Window Substring | Leetcode #76

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

MINIMUM WINDOW SUBSTRING | LEETCODE # 76 | PYTHON SOLUTION

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

Leetcode - Minimum Window Substring (Python)

Minimum Window Substring | Google | Leetcode 76

Minimum Window Substring - LeetCode 76 - JavaScript

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

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

Sliding Window Algorithm Explained Clearly | Longest Substring Without Repeating Characters Leetcode

FIND Minimum Window Substring - Leetcode 76

Minimum Window Substring - LeetCode #76 - Python

Leetcode Blind 75 C++: Minimum Window Substring

Leetcode 76. Minimum Window Substring

Minimum Window Substring (Leetcode Hard) | Hashmap Interview Questions

Minimum Window Substring | LeetCode 76 | Python Solution

Minimum Window Substring - Leetcode 76 - Sliding Window

Leetcode #76 Minimum Window Substring | JavaScript

76. Minimum Window Substring | LeetCode | Java Solution

Minimum Window Substring (LeetCode 76 - Hard)

Minimum Window Substring | Leetcode 76 | Live coding session 🔥🔥🔥 | 2 Pointer

Leetcode 76. Minimum Window Substring #shorts #python #leetcodechallenge #coding