A Very Fast And Memory Efficient Alternative To Python Lists (Deque)

Today, we will be looking at deque, a package that comes with Python that is known for it's memory-efficiency in managing queues and stacks. It also provides us with some extra in-built methods that don't come with list.

[@pastenml]

Excellent and to the point. Appreciate the guest appearance by the ghost as well :)

[@sanskaripatrick7191]

Super informative and to the point. Loved it. Keep up the great work!

[@Indently]

Much appreciated!

[@elatedbento]

I'm late for the party, but I want to say that this is a great video. Thank you for sharing useful knowledge. Happy 2023 Holidays 😄🎄

[@miltondias6617]

Huge LIKE to this video! Very useful!

[@simiiv5021]

Crisp and on point!

[@heeming]

so useful and clear. thank you from Korea👍

[@Indently]

Glad it was helpful!

[@GigasAhriman]

I've been following a Python book. So far it's been pretty good, but it did not really explain queues well. Your vid covered it. Thank you

[@Indently]

Glad it was helpful!

[@chx75]

Looks quite useful. The font size is very small. I can still read it from the phone, but it would be much better to have a bigger one.

[@anuInbetweener]

very informative . i am using it to store live market data for algo

[@thejoojoo9999]

great video.

[@evanstar3256]

Me who took data structures: Do not cite the deep magic to me, I was there when it was written

[@ImHansana123]

Can i use dictionaries too?

[@Meenimie]

Supporting comment.

[@toasterowo2335]

So, if this is faster, more efficent, has all the same features and more features... Why exactly does list even exist as a separate and worse way of doing it? Meaning, why was deque added as a separate thing, and not the list extended and optimised with the code that is used for deque?

[@ktyu_timmy8025]

I found this answer on StackOverflow: "while deque is fast and efficient at inserting and popping at either side of the array, it is rather slow reading/accessing data from the array when comparing to list"

[@toasterowo2335]

@@ktyu_timmy8025 That sounds weird. Unless the whole structure of those two is different, it would make no sense. So unless they actually are completely different under the hood, its just a massive waste to not combine the two into the optimal thing.

[@Zhul123]

ty nerd

[@Pen__the_mightiest]

This video seems very misleading. Double ended queues take up twice the memory of a list. They are not “memory efficient” you also refer to them as a stack, a completely different data structure with very different use cases.