Minimum Window Substring - LeetCode 76 - Python

Explaining how to solve Minimum Window Substring in Python!
Note: can also get rid of formed and just subtract from total directly similar to what we do for the dictionary!
Code: github.com/deepti-talesra/Lee...
@1:00 - Example + Explanation
@9:41 - Code
@14:47 - Time and Space Complexity
@15:33 - Code Walkthrough with Example
Music: Bensound
Lemme know if you have any comments or questions!:)))
If you found this helpful, check out my channel for even **MORE VIDEOS**!!:)) czcams.com/users/DEEPTITALES...
Give it a shot yourself - leetcode.com/problems/minimum...

[@user-bt3hd6zi5y]

Super clear!!!!

[@deepakjyoti8355]

Great going !

[@BananaButcher]

amazing explanation maam. thank you . i watched other Vidos on the same problem but i was very confused now all confutations are clear.

[@DEEPTITALESRA]

So happy it helped! Love to hear it Shihab!!!:)))

[@GiridharaSaiPavanKumarGurram]

very clean explanation deepti.
how long did it take to come up with the full algorithm/pseudocode/code after reading the question?

[@DEEPTITALESRA]

Hahaha great question - I'd say about how long its in the video 😅 but only because I've done many, many similar problems, so after going through many examples and building up the logic, it all falls into place much easier and quicker. Takes quite a bit of practice but once you start doing a lot of problems, you begin recognizing patterns. Once that happens, the logic and implementation approach/es make much more sense and it all starts to come more "naturally". Let me know if you have any other questions Giridhara!

[@Derpthemeus]

nice algorithm but you could just use `return "W"` as your solution instead because that's the minimum substring of "Window" that will let you win

[@manuchaudhary7902]

Not sure why while explaining the problem you consider total as 3 and not 4?