You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
tech-interview-handbook/apps/website/contents/algorithms/queue.md

3.5 KiB

id title description keywords sidebar_label toc_max_heading_level
queue Queue cheatsheet for coding interviews Queue study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
queue coding interview study guide
queue tips for coding interviews
queue practice questions
queue useful techniques
queue time complexity
queue recommended study resources
Queue 2
<head> </head>

Introduction

A queue is a linear collection of elements that are maintained in a sequence and can be modified by the addition of elements at one end of the sequence (enqueue operation) and the removal of elements from the other end (dequeue operation). Usually, the end of the sequence at which elements are added is called the back, tail, or rear of the queue, and the end at which elements are removed is called the head or front of the queue. As an abstract data type, queues can be implemented using arrays or singly linked lists.

This behavior is commonly called FIFO (first in, first out). The name "queue" for this type of structure comes from the analogy to people lining up in real life to wait for goods or services.

Breadth-first search is commonly implemented using queues.

Learning resources

Implementations

Language API
C++ std::queue
Java java.util.Queue.Use java.util.ArrayDeque
Python queue
JavaScript N/A

Time complexity

Operation Big-O
Enqueue/Offer O(1)
Dequeue/Poll O(1)
Front O(1)
Back O(1)
isEmpty O(1)

Things to look out for during interviews

Most languages don't have a built-in Queue class which can be used, and candidates often use arrays (JavaScript) or lists (Python) as a queue. However, note that the enqueue operation in such a scenario will be O(n) because it requires shifting of all other elements by one. In such cases, you can flag this to the interviewer and say that you assume that there's a queue data structure to use which has an efficient enqueue operation.

Corner cases

  • Empty queue
  • Queue with one item
  • Queue with two items

Essential questions

These are essential questions to practice if you're studying for this topic.

These are recommended questions to practice after you have studied for the topic and have practiced the essential questions.

import AlgorithmCourses from '../_courses/AlgorithmCourses.md'