double-ended-queue

Here are 3 public repositories matching this topic...

VarunS2002 / Python-Data-Structures-Algorithms

Repository for Data Structures and Algorithms in Python.

python stack tower-of-hanoi searching-algorithms pascals-triangle matrix-calculations data-structures-algorithms sorting-algorithm-visualizations binary-tree-traversal double-ended-queue permutations-and-combinations factors-factorial

Updated May 26, 2022
Python

jibran-mohammad / Algorithms-and-Datastructures

Star

Basic algorithm and Datastructres

search stack python3 matrix-multiplication insertion-sort sorting-algorithms heapsort sliding-windows queues divide-and-conquer circular-queue algorithms-and-data-structures linked-lists double-ended-queue maximum-sum-subarray

Updated Aug 17, 2022
Python

Dibyendu1000 / Dequeue

Star

In computer science, a double-ended queue (abbreviated to deque) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail).

python computer-science data-structures deque dequeue double-ended-queue enque

Updated Jan 21, 2019
Python

Improve this page

Add a description, image, and links to the double-ended-queue topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the double-ended-queue topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly