Sliding Window Maximum(LeetCode 3) | Neetcode 19 / 150 | Bharath Chandra

Hello guys, cheers to another piece of learning. Today I talked about the "Sliding Window Maximum" problem which is the first in Neetcode 150 list. It is one of the most asked questions in interviews and has some interesting ways to solve it.
In the above video, I showed all the different logics with which the problem can be solved and also the pseudocodes. Let me know if you got a hold of the logic?
Link to Two Pointer video - • Hashsets and HashMaps ...
Link to the problem - leetcode.com/p...
Link to Neetcode 150 - neetcode.io/pr...
Regular updates from me on Discord, Insta and Telegram. I post job notifications of telegram and discord
Insta - / bharathh_chandraa
Telegram - t.me/thebharat...
Discord - / discord
LinkedIn - / lokesh-bharath-chandra...
00: 00 - Introduction and Problem Statement
02: 38 - Brute Force Logic
06: 17 - Brute Force Algo and Pseudocode
14: 26 - Pseudocode
24: 42- Why not Hashmap or Model 2
30: 08- Conclusion

[@Tony-q6w8p]

Explanation superb bro pls continue series fast upload

[@ssuchitraparvathi8779]

Hey, Thank you, Was really looking forward for this video.... :)

[@bharathh_chandraa]

Happy to hear it helped! Keep practicing! 🔥