Skip List Explained | Advanced Data Structure | What is Skip List Data Structure | Coding Interview

[@SoftwareDude]

Comment and let us know if you have any questions. Like, subscribe and share. Contact us at *techhome101@**gmail.com* for a detailed course, technical consultation, interview prep and discussion.

[@kaflsezdf]

Excellent explanation! I dont usually post comments but you are great my brother. Thanks for the help!

[@SoftwareDude]

Thank you 🤩

[@Sandeep-zd6dq]

I am sure this channel will suddenly explode on KZbin, literally your content is super amazing and please don’t forget me I am your one of initial subscribers 😂❤

[@SoftwareDude]

Thank you, we’re humbled 🙌. Please share in your circle if you think this will help others also. We will be thrilled to see as many people benefit from this as possible.

[@MostafaAliMansour]

This channel is underrated, will leave this comment and edit it when it becomes famous 👏

[@SoftwareDude]

Thank you 😊

[@d0ubtingThom4s]

Space complexity also increases with a plain O(n) because you have an extra pointer with everything. Main tradeoff is no more vector operations!

[@Nallu_Swami]

The way of explanation was so clear , Thanks a lot

[@SoftwareDude]

Thank you 🤩

[@adarshanayak8392]

Thanks for this video, crystal clear explanation of how skip list can be used. implementation of this concept using any of the programing languages would have helped me ever further in understanding, Anyways this video is awesome.

[@SoftwareDude]

Glad it was helpful! 🤩 Thank you for the suggestion, we will try to accommodate it in future videos.

[@BCBlockFestivals]

This is an awesome channel. Great technical videos explained very simply. Keep going.

[@SoftwareDude]

Thank you 🤩

[@akshatbawa4750]

Can you please explain how skip graphs are different? How are they faster? How do they skip in a better way? If they do...

[@Elena-oh6xf]

thank you so much!!!! Needed this!!!

[@SoftwareDude]

Thank you 🤩

[@justinluu3032]

this is an amazing explanation!

[@SoftwareDude]

Thank you 🤩

[@__________________________6910]

Easy to understand

[@SoftwareDude]

Thank you 🤩

[@Видеосъемказапрещена]

Great video!

[@SoftwareDude]

Thank you 🤩

[@thinktank3613]

Nice explanation

[@SoftwareDude]

Thanks for liking

[@oneness-divinebeings1115]

Very well explained

[@SoftwareDude]

Thank you 🤩

[@nguyenduy-sb4ue]

pretty good explaination dude

[@SoftwareDude]

Thanks. Glad you liked it!!

[@ravibagga1506]

What if we get unsorted list. Can we apply skip list on it?

[@CodeWithConfidence01]

No, Linked List must be in sorted order must. For the skip list.

[@SoftwareDude]

No, skip list works only on sorted lists. But there are few variations that can be applied to unsorted lists. Will try to cover those in future videos.

[@vaibhavmewada4508]

good explanation

[@SoftwareDude]

Thanks for liking 🤩

[@spiikedd]

Explain how do we get O(sqrt(n))? Do we count the same node in skip list and original list twice? Do we count the last node?

[@SoftwareDude]

The avg case complexity is O(log(n)), starts with O(sqrt(n)) for 2 lanes. Will be lesser for 3 lanes and so on converging towards avg case O(log(n)). However worst case is O(n).

[@AadeshingaleOfficial-zl5fd]

Nice Sir ☺️

[@SoftwareDude]

Thank you 🤩

[@SweetPeachannel]

thank you ..

[@SoftwareDude]

You're welcome!

[@hereallyfast]

so does ipfs!

[@SoftwareDude]

Yep 😄

[@Un4GivNX]

Why not using a dictionary?

[@SoftwareDude]

Yes, here we are mainly discussing skip list. But depends on the use case and implementation trade-off.

[@SweetPeachannel]

why my lecture can not explain like you did with simplicity ...

[@SoftwareDude]

Maybe you can share this video with your lecturer 😂

[@SweetPeachannel]

@@SoftwareDude definitely