LeetCode 23. Merge k Sorted Lists[ Algorithm + Code Explained]

[@biranchinarayanpadhi9067]

Hello Jayanti, one suggestion is before directly solving problems , you can use your notepad to discuss your approach . Here notepad means anything from ipad or any tablet which enables you to write or take notes. Using that you can discuss your approach and then solve the problem.

[@vinayakbansal8471]

@jayati can you post solving method ppt, this was very helpful.

[@jiteshkumar3112]

Hi Ma'am. how can i get cheat sheet of approaches to solve LL problems. you have that of other data structures too?

[@danqingreader8763]

I appreciate a lot for your lecture! However, I have something do not understand. What's the meaning of the "lists[index1]=ans.next"?

[@saicharan1000]

She is returning lists[0]. So, inserting the solution at index1. ans.next will be the actual starting point because ans is initialized with '-1'.

[@MakrandPatil17]

Why not use heap?

[@jayatitiwari444]

That needs extra space

[@code7434]

@@jayatitiwari444 nice solution. Got to know different way to think

[@sayantaniguha8519]

Areeeeee
Kiu nehi karta iss Q ko koi heap see

[@ShreyaSingh-vr9qi]

Thanks for your effort in making the video !! But most of the guys use editorial for understanding the concept not solution. So, please if u can first explain the concept on a white board will be more better.

[@surajgrandhi6742]

Mam I am getting time limit exceeded for the same code.

[@venkatabhavanbharadwaj4564]

Could you please make solutions in cpp... Mam

[@sumanthsaadam4522]

Entry sound of your video is so annoying!

[@danqingreader8763]

白嫖别人视频事还这么多