<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: Deque in Python Using C</title><link>http://www.bing.com:80/search?q=Deque+in+Python+Using+C</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>Deque in Python Using C</title><link>http://www.bing.com:80/search?q=Deque+in+Python+Using+C</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 Systems: Web Accessibility Software, Services &amp; Training</title><link>https://www.deque.com/</link><description>Deque Systems provides web and mobile accessibility solutions so you can meet compliance goals and help make the web accessible to all users.</description><pubDate>Sat, 30 May 2026 07:07:00 GMT</pubDate></item><item><title>Deque Data Structure - GeeksforGeeks</title><link>https://www.geeksforgeeks.org/dsa/deque-set-1-introduction-applications/</link><description>Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends. Below is an example program of deque in different languages.</description><pubDate>Sat, 30 May 2026 12:08:00 GMT</pubDate></item><item><title>Double-ended queue - Wikipedia</title><link>https://en.wikipedia.org/wiki/Double-ended_queue</link><description>A deque substitutes the min-priority queue. 0-cost elements are enqueued in front of the deque (high-priority) and then are always processed before the higher cost elements (low-priority) that are enqueued at the rear end.</description><pubDate>Mon, 01 Jun 2026 10:04:00 GMT</pubDate></item><item><title>std::deque - cppreference.com</title><link>https://en.cppreference.com/cpp/container/deque</link><description>std::deque (double-ended queue) is an indexed sequence container that allows fast insertion and deletion at both its beginning and its end. In addition, insertion and deletion at either end of a deque never invalidates pointers or references to the rest of the elements.</description><pubDate>Mon, 01 Jun 2026 03:37:00 GMT</pubDate></item><item><title>collections — Container datatypes — Python 3.14.5 documentation</title><link>https://docs.python.org/3/library/collections.html</link><description>Once a bounded length deque is full, when new items are added, a corresponding number of items are discarded from the opposite end. Bounded length deques provide functionality similar to the tail filter in Unix.</description><pubDate>Sun, 31 May 2026 09:08:00 GMT</pubDate></item><item><title>Deque (Java Platform SE 8 ) - Oracle</title><link>https://docs.oracle.com/javase/8/docs/api/java/util/Deque.html</link><description>The name deque is short for "double ended queue" and is usually pronounced "deck". Most Deque implementations place no fixed limits on the number of elements they may contain, but this interface supports capacity-restricted deques as well as those with no fixed size limit.</description><pubDate>Mon, 01 Jun 2026 00:17:00 GMT</pubDate></item><item><title>deque - C++ Users</title><link>https://cplusplus.com/reference/deque/deque/</link><description>deque (usually pronounced like "deck") is an irregular acronym of d ouble- e nded que ue. Double-ended queues are sequence containers with dynamic sizes that can be expanded or contracted on both ends (either its front or its back).</description><pubDate>Mon, 01 Jun 2026 08:09:00 GMT</pubDate></item><item><title>Deque Data Structure - Programiz</title><link>https://www.programiz.com/dsa/deque</link><description>In this tutorial, you will learn what a double ended queue (deque) is. Also, you will find working examples of different operations on a deque in C, C++, Java and Python.</description><pubDate>Tue, 19 May 2026 09:15:00 GMT</pubDate></item><item><title>Deque University: Web Accessibility Training and Courses</title><link>https://dequeuniversity.com/</link><description>Deque is an Approved Certification Preparation Provider, and we offer Deque University online courses for CPACC and WAS exam preparation. Deque U courses also apply as continuing education courses towards your existing IAAP certification.</description><pubDate>Sat, 30 May 2026 01:38:00 GMT</pubDate></item><item><title>4.15. What Is a Deque? — Problem Solving with Algorithms and Data ...</title><link>https://runestone.academy/ns/books/published/pythonds/BasicDS/WhatIsaDeque.html</link><description>A deque, also known as a double-ended queue, is an ordered collection of items similar to the queue. It has two ends, a front and a rear, and the items remain positioned in the collection.</description><pubDate>Sat, 30 May 2026 21:40:00 GMT</pubDate></item></channel></rss>