Data Structures in Javascript ( Sliding Window Maximum) | DSA Interview Questions | Deque | Leetcode

[@RoadsideCoder]

➡ Download my DSA with JS E-Book - topmate.io/roadsidecoder/491565 🔴 Complete DSA with Javascript Playlist - kzbin.info/aero/PLKhlp2qtUcSZtJefDThsXcsAbRBCSTgW4 👤 Join the RoadsideCoder Community Discord - discord.gg/2ecgDwx5EE If this video gets good response, I will make more DSA videos, so do share it with others 🔥

[@WG26Gaming]

yes at this point 11:00 i got it, you just learned this and without properly understanding yourself you created this video

[@deepakgadwal008]

i have watch lots of video but no one explain like you i am trying to understand this code for 3 days.

[@RoadsideCoder]

Thats good to know bro 🔥

[@goodguy6589]

Great video champ ...keep it up please 👍🏻

[@sudhanshusharma9888]

please like and comment all the videos because the premium content is here for free❤

[@RoadsideCoder]

yes ❤️

[@motivationalmusic3721]

Trees graph , etc is coming ?

[@motivationalmusic3721]

I understand in first go buy still need revision ..

[@thequantum-plator]

Great video, keep 'em coming

[@n1ght312]

nice video !

[@peziom-rn7sv]

30 min video and no information what is the task to and what means 'Sliding Window Maximum'

[@dhruvkhullar7691]

Even smaller logic, if using js: const slidingWindowMax = (arr, k) => { let maxSlidinArr = []; for(let i=0;i

[@utkarshpant5297]

Brilliant

[@kn-ee5iq]

Arey ye toh naive solution ka compact version hi toh hai. Complexity n*k hi aayegi iski bhi. Aur math.max 2 element pe kaam krta hai naki array kf elements pe

[@dhruvkhullar7691]

​@@kn-ee5iqconsole.log(Math.max(1, 3, 2)); // Expected output: 3 console.log(Math.max(-1, -3, -2)); // Expected output: -1 const array1 = [1, 3, 2]; console.log(Math.max(...array1)); // Expected output: 3

[@kn-ee5iq]

@@dhruvkhullar7691 ok but still complexity is high , same as of naive solution he provided in first approach What about that. Your solution looks short but have same time complexity as of first approach

[@dhruvkhullar7691]

@@kn-ee5iq where have I mentioned anything related to complexity, mate? It was just a minified way to solve it in JS. Period.

[@deepakgadwal008]

tell me one thing how window is sliding and which line doing this task

[@utkarshpant5297]

When dq.length >=k , dq.shift() removes the first element from dq array making room for pushing ith index

[@non-wg5os]

@RoadsideCoder bro it would be beneficial for all If u could make one video on how to deploy your MERN chat app project on render. The comment section there is filled with similar doubts, also the huge efforts at the end would be waste if we couldn't deploy and showcase our project. Thank you.

[@Solo_playz]

It's very easy bro, there are lot of videos out there on YT to help you with it!

[@shrikantjha4686]

hi bro can u pls make DSA with JS with all concepts involved

[@RoadsideCoder]

That is what I'm doing right now, you can check my full playlist

[@aliiqbal208]

Just joined.

[@MohanKumar-oj4dk]

Great video!! But very confusing & Not understood!!!😇

[@RoadsideCoder]

Try to watch visual explanation again, u will understand. Happens with everyone!

[@prahaladmankoliya4242]

its quadrartic time complexcity not exponial time complexcity

[@alwysrite]

Yes, it is very confusing !

[@rishiraj2548]

🙏🙏

[@WG26Gaming]

even you are confused at 10:00 and i also can't understand shit, you need improvement before teaching others.

[@shivambln]

Bhai kuch samjh ni aara .... Matlab meri hi samjh ni aara ....baaki sabko samjh aara hai ...

[@kn-ee5iq]

Bhai ye thodi hard problem hai

[@alejandrogregory978]

🌈 "promosm"

[@gouravmalik5023]

Bhai hindi m bhi bol liya kr

[@guptasagar694]

I am not able to Understand a Shit

[@RoadsideCoder]

follow from start, here's full course - kzbin.info/aero/PLKhlp2qtUcSZtJefDThsXcsAbRBCSTgW4

[@cyberpirate007]

Skill Issue bro