Видео

Explanation is top notch make more problem explanation in javaScript ✨

Was searching for this solution and i am glad i found it. Thank you so much!! Explained very well.

Wrong solution

it seemed a little convoluted to have i be delcared atop for the block sope why not just have it in if block for when you want to redfine the prefix

😂You finally remembered your RUclips password

Great Explaination.... Keep it up. we need you 🙌🙌

Thankyou for making in javascript , learning alot from your tutorials

You did a great job of explaining this! Thank you!

why adding plus 1 in it?

great work , thankyou its so helpful please make more atleast blind 75

i am little confuse here, its not only two lists as mention in the problem that it is k number of lists, which means more than 2 as well, so how we are doing it with just comparing two lists

great job sis

Hey, it's a great channel for DSA. I have sent you a connection request on linkedIn. I hope you accept it.

Your solution was easy and understandable. I Appreciate that. Thanks

It took me about 2 hour to understand this logic by watching over and over again.. Even after looking at solution ,can't recreate it. where am i going wrong?

Thank you for this. ❤

superb video

This is O(nLOGn), the problem requested to do under that. I also did this solution at first but I am looking for a way to do it under nLogn

but taking a prefix sum would mean using subarray (contagious part of array) - but this is not subsequence

You were saying (sum % 2) will be 1 but how, it will be 0 na ? and

Your approach and explanation to this problem is simple and best. No any jargon. Better than many top online educators. 🤟💌

thx a lot

with regex you can create a capturing group using the space and then apply reverse/join. Runtime is very low - s.trim().split(/\s+/g).reverse().join(' ')

Hi I just started learning DSA and its really helped me to understand this problem easily and that's for coding in js as there is very limited resource out there

hey my name is also monu wow

how will that know to move right from 4 --> 5 again?

The best explenation ive encountered so farrr

very nice, Thanks you

Euclidean algorithm, TIL

I like the first concept of changing the value to visited or even adding an additional property of the object seen: true

really liked the video keep the good work

Thanks for the explanation 👍

Thanks for this Solution ... ! Which microphone you using for recording this audio ?

what a misleading video? where are the questions? why faking accent ?

its too helpfull

amazing, easy to understand explanation in javascript!!!

Thank you so much for optimized solution and explanation , expecting more content like this

Excellent explanation, I got asked this question in an interview but came up with a very inefficient solution.

Pls make more video, Good Content :-)

thanks you about content

will the o(m+n) code work if the array contains negative integers .

intution is missing. Please explain why slow and fast meet at loop start in 2nd part.

your mic is way too quiet

Very well explained, much better than in bigger channels. Thank you!

while setting map , lot of times we have to check if property doesn't exist it has to be 0 . Otherwise we do +1. so instead of line 9 and 10 . Single line can do this : map.set(c, (map.get(c) || 0) +1)

Can you explain why parseInt worked and Math.floor did not?

very nice and clean explanation all other channel solution are very confusing urs is best thanks

this is terrible

you saved me from alen christy

Good Content, Hard to find JS LeetCode solutions out there. Good work