Sliding Window Algorithm - Variable Length + Fixed Length - DSA Course in Python Lecture 13

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@mdbillah9998]

Your teaching is so unique and easy way get to the student head!

[@soumikdas2946]

Greg just keep making these videos man you are just awesome ❤

[@GregHogg]

Glad to hear it!

[@Shiva-wp2nq]

Hey Greg, you're content and way of explaining make me feel like DSA is easy

[@GregHogg]

Glad to hear it!

[@mystikyogi]

Amazing explanation. Thanks!

[@naveentarakaturi9930]

you are so talented.

[@bigk9000]

What is the name of the tool you use to draw stuff out?

[@mrsengeel]

Great teaching Greg but i have a question, what is the need of comparing the max value of w to longest because there is nowhere in the code for Variable Lenght Sliding Window is longest incremented from 0. So can we just give longest = w in replace of finding the max between them

[@kdiffin]

Thanks ❤

[@creativeusername4400]

it feels illegal to watch because of its simplicity with DSA

[@carsworld3433]

Hey in first problem why did we specifically used set, I tried it with a list and it was actually better since list are more easier to work with

[@sinanakcali8008]

That would make the time complexity of your solution O(n^2). When you try to do a search in a list it is O(n), whereas search in a set is O(1)

[@pjpodx]

what about different sliding windows types/patterns: fixed length, caterpillar, shrinking /expending rules ?

[@GregHogg]

Did you watch the video?

[@pjpodx]

​@@GregHogg Yes, I think I was expecting more like recipe/template/framework for solving all sliding window problems after reading title, not just solving 2 leetcode sliding window tasks, Sorry.

[@GregHogg]

@@pjpodx This is the recipe. There's 2 common sliding window types, I say what they are, and explain how to solve an example for each. Not sure what else there is, am I missing something?

[@Fam-m4i]

First😊