---
title: "Discussion on \"Double-Ended Queues in Python\" | Hashnode"
description: "Discussion on \"Double-Ended Queues in Python\". The regular queue data structure follows FIFO(First in First Out) rule. Queue is a great data structure, but when it comes to adding elements at the end or removing elements from the beginning, it gets complicated.\nThis is where Double-Ended aka dequ..."
url: "https://hashnode.com/posts/double-ended-queues-in-python/639c75904a1b1e8756b57c46"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Double-Ended Queues in Python](https://afiz.hashnode.dev/double-ended-queues-in-python?utm_source=hashnode&utm_medium=feed)

The regular queue data structure follows FIFO(First in First Out) rule. Queue is a great data structure, but when it comes to adding elements at the end or removing elements from the beginning, it gets complicated. This is where Double-Ended aka dequ...

Dec 16, 2022 · 1 min read · afiz.hashnode.dev  
Read the article

-   [#wemakedevs](https://hashnode.com/tag/wemakedevs)
-   [#python](https://hashnode.com/tag/python)
-   [#dsainpython](https://hashnode.com/tag/dsainpython)

## Written by

[Afiz](https://hashnode.com/@afiz)

@afiz

  
[View profile](https://hashnode.com/@afiz)

Senior Software Engineer from India.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
