<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: Deque Python</title><link>http://www.bing.com:80/search?q=Deque+Python</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>Deque Python</title><link>http://www.bing.com:80/search?q=Deque+Python</link></image><copyright>Copyright © 2026 Microsoft. All rights reserved. These XML results may not be used, reproduced or transmitted in any manner or for any purpose other than rendering Bing results within an RSS aggregator for your personal, non-commercial use. Any other use of these results requires express written permission from Microsoft Corporation. By accessing this web page or using these results in any manner whatsoever, you agree to be bound by the foregoing restrictions.</copyright><item><title>Deque in Python - GeeksforGeeks</title><link>https://www.geeksforgeeks.org/python/deque-in-python/</link><description>A deque stands for Double-Ended Queue. It is a type of data structure that allows to add and remove elements from both ends efficiently. Allows fast insertion and deletion from both the front and rear ends. Works as both a queue (FIFO) and a stack (LIFO). Useful in scheduling, sliding window problems and real-time data processing.</description><pubDate>Mon, 16 Nov 2026 18:05:00 GMT</pubDate></item><item><title>collections — Container datatypes — Python 3.15.2 documentation</title><link>https://docs.python.org/3/library/collections.html</link><description>To implement deque slicing, use a similar approach applying rotate () to bring a target element to the left side of the deque. Remove old entries with popleft (), add new entries with extend (), and then reverse the rotation.</description><pubDate>Mon, 16 Nov 2026 18:47:00 GMT</pubDate></item><item><title>Python's deque: Implement Efficient Queues and Stacks</title><link>https://realpython.com/python-deque/</link><description>Use a Python deque to efficiently append and pop elements from both ends of a sequence, build queues and stacks, and set maxlen for history buffers.</description><pubDate>Sat, 14 Nov 2026 13:06:00 GMT</pubDate></item><item><title>Deque Implementation in Python - GeeksforGeeks</title><link>https://www.geeksforgeeks.org/python/deque-implementation-in-python/</link><description>Deque in Python is implemented using a doubly linked list, making append and pop operations from both ends O (1) (constant time). Unlike Python’s built-in list (which uses a dynamic array), deque does not require shifting elements when inserting/deleting at the front.</description><pubDate>Mon, 16 Nov 2026 23:12:00 GMT</pubDate></item><item><title>Queues with Python - W3Schools</title><link>https://www.w3schools.com/python/python_dsa_queues.asp</link><description>Dequeue: Removes and returns the first (front) element from the queue. Peek: Returns the first element in the queue. isEmpty: Checks if the queue is empty. Size: Finds the number of elements in the queue. Queues can be implemented by using arrays or linked lists.</description><pubDate>Mon, 16 Nov 2026 17:14:00 GMT</pubDate></item><item><title>Understanding Python’s deque - Python Central</title><link>https://www.pythoncentral.io/understanding-pythons-deque/</link><description>In this article, we'll explore the deque data structure in detail, including its features, use cases, and how to use it effectively in your Python programs. We'll also provide code examples to illustrate its functionality.</description><pubDate>Fri, 13 Nov 2026 05:29:00 GMT</pubDate></item><item><title>Working With Python's deque</title><link>https://realpython.com/courses/working-with-pythons-deque/</link><description>Learn how to use Python's deque to efficiently append and pop items from both ends, build queues and stacks, and set maxlen for bounded history.</description><pubDate>Mon, 16 Nov 2026 06:09:00 GMT</pubDate></item><item><title>How to Use Deque in Python: collections.deque | note.nkmk.me</title><link>https://note.nkmk.me/en/python-collections-deque/</link><description>In Python, the collections.deque class provides an efficient way to handle data as a queue, stack, or deque (double-ended queue). While the built-in list can be used as a queue, stack, or deque, collections.deque offers better performance, especially for adding or removing elements at the beginning.</description><pubDate>Sun, 15 Nov 2026 00:55:00 GMT</pubDate></item><item><title>Python collections模块之deque ()详解 - CSDN博客</title><link>https://blog.csdn.net/chl183/article/details/106958004</link><description>本文详细介绍了Python collections模块中的deque数据结构，包括其基本操作如append、appendleft、extend、extendleft等，以及高级特性如rotate、maxlen。 通过实例展示了deque在高效插入和删除元素方面的优势。</description><pubDate>Thu, 03 Sep 2026 03:55:00 GMT</pubDate></item><item><title>Python Deque - Codecademy</title><link>https://www.codecademy.com/resources/docs/python/deque</link><description>A deque is a double-ended queue implementation in Python’s collections module. It provides a versatile data structure that generalizes a stack and a queue by allowing efficient append and pop operations from both ends of the sequence.</description><pubDate>Fri, 13 Nov 2026 17:18:00 GMT</pubDate></item></channel></rss>