DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
A thorough introduction to queues — the FIFO (First In, First Out) data structure. Learn the queue model, all operations with complexity, types of queues, real-world applications, comparison with stacks, and when to use queues in algorithms.
Introduction
A queue is a linear data structure that follows FIFO (First In, First Out) ordering — the first element added is the first one removed.
Think of a real queue (line) at a ticket counter: the first person to join the line is the first person served. New people join at the back, and service happens at the front. No one cuts in line.
This contrasts with a stack (LIFO): where the *last* added is the *first* removed (like a stack of plates).
Queues are the foundation of Breadth-First Search (BFS), CPU scheduling, print spooling, network packet management, and event-driven programming.
Queue Operations
| Operation | Description | Time |
|---|---|---|
enqueue(x) | Add element x to the rear | O(1) |
dequeue() | Remove and return front element | O(1) |
front() / peek() | View front element without removing | O(1) |
rear() | View rear element without removing | O(1) |
is_empty() | True if no elements | O(1) |
size() | Number of elements | O(1) |
Types of Queues
1. Simple Queue (Linear Queue)
Standard FIFO. Elements enqueue at rear, dequeue at front.
2. Circular Queue
The rear wraps around to the front when the array is full, reusing space freed by dequeued elements. Avoids the "wasted space" problem of linear array queues.
3. Double-Ended Queue (Deque)
Elements can be added or removed from both ends. Combines stack and queue behavior.
4. Priority Queue
Each element has a priority. The element with the highest priority is dequeued first, regardless of insertion order. Implemented with a heap.
Simple Queue Implementation
Example
from collections import deque
class Queue:
"""
Queue using Python's deque (double-ended queue).
deque gives O(1) append (enqueue) and O(1) popleft (dequeue).
Using list: append is O(1) but pop(0) is O(n) — never use list for queues!
"""
def __init__(self):
self._data = deque()
def enqueue(self, item) -> None:
"""Add to rear. O(1)."""
self._data.append(item)
def dequeue(self):
"""Remove from front. O(1)."""
if self.is_empty():
raise IndexError("Dequeue from empty queue")
return self._data.popleft()
def front(self):
"""Peek at front without removing. O(1)."""
if self.is_empty():
raise IndexError("Front of empty queue")
return self._data[0]
def rear(self):
"""Peek at rear without removing. O(1)."""
if self.is_empty():
raise IndexError("Rear of empty queue")
return self._data[-1]
def is_empty(self) -> bool:
return len(self._data) == 0
def size(self) -> int:
return len(self._data)
def __repr__(self) -> str:
return f"Queue(front→rear): {list(self._data)}"
Why use deque and NOT list:
python example
# WRONG — O(n) dequeue
queue = []
queue.append(item) # O(1) enqueue
queue.pop(0) # O(n) dequeue — shifts all elements!
# CORRECT — O(1) dequeue
from collections import deque
queue = deque()
queue.append(item) # O(1) enqueue
queue.popleft() # O(1) dequeueReal-World Applications
1. Breadth-First Search (BFS)
BFS is the most important algorithm that uses a queue. It explores a graph level by level — all nodes at distance 1, then all at distance 2, etc.
Example
from collections import deque
def bfs(graph, start):
"""
Breadth-First Search using a queue.
Explores nodes in order of their distance from start.
"""
visited = {start}
queue = deque([start])
while queue:
node = queue.popleft() # FIFO — process oldest added first
print(node)
for neighbor in graph[node]:
if neighbor not in visited:
visited.add(neighbor)
queue.append(neighbor)
# Shortest path in unweighted graph:
def shortest_path(graph, start, end):
queue = deque([(start, [start])]) # (node, path_to_node)
visited = {start}
while queue:
node, path = queue.popleft()
if node == end:
return path
for neighbor in graph[node]:
if neighbor not in visited:
visited.add(neighbor)
queue.append((neighbor, path + [neighbor]))
return None # No path found
2. CPU Process Scheduling (FIFO / Round-Robin)
python example
class CPUScheduler:
def __init__(self):
self.ready_queue = Queue()
def add_process(self, pid, burst_time):
self.ready_queue.enqueue((pid, burst_time))
def run_next(self):
if not self.ready_queue.is_empty():
pid, burst = self.ready_queue.dequeue()
print(f"Running Process P{pid} for {burst} units")3. Print Spooler
python example
class PrintSpooler:
"""Documents print in the order they were submitted."""
def __init__(self):
self._queue = Queue()
def submit_document(self, document_name):
self._queue.enqueue(document_name)
print(f"Queued: {document_name}")
def print_next(self):
if not self._queue.is_empty():
doc = self._queue.dequeue()
print(f"Printing: {doc}")4. Message Queue (Producer-Consumer)
python example
import threading
class MessageQueue:
"""Thread-safe queue for producer-consumer pattern."""
def __init__(self):
from queue import Queue as ThreadQueue
self._q = ThreadQueue() # Python's thread-safe Queue
def produce(self, message):
self._q.put(message) # Blocks if queue is full
def consume(self):
return self._q.get() # Blocks until message availableQueue vs Stack — When to Use Which
| Use Queue (FIFO) When | Use Stack (LIFO) When |
|---|---|
| Processing order matters (oldest first) | Most recent item is relevant |
| BFS traversal | DFS traversal |
| Level-by-level tree traversal | Backtracking |
| Task scheduling | Undo/Redo |
| Producer-consumer systems | Expression evaluation |
| Printing, messaging, buffering | Function call management |
Python's Queue Support
python example
# 1. collections.deque — most common for manual queue implementation
from collections import deque
q = deque()
q.append(1) # enqueue at right
q.appendleft(0) # enqueue at left
q.popleft() # dequeue from left
q.pop() # dequeue from right
# 2. queue.Queue — thread-safe, for concurrent programs
from queue import Queue, LifoQueue, PriorityQueue
q = Queue(maxsize=10) # Blocking queue, optional max size
q.put(item) # enqueue (blocks if full with maxsize)
q.get() # dequeue (blocks if empty)
q.qsize() # Size
# 3. queue.LifoQueue — stack using queue interface
lq = LifoQueue()
lq.put(1); lq.put(2)
lq.get() # Returns 2 (LIFO)
# 4. queue.PriorityQueue — min-heap based priority queue
pq = PriorityQueue()
pq.put((priority, item))
pq.get() # Returns (lowest_priority, item)Summary
The queue is the FIFO data structure:
- Enqueue: Add to rear → O(1)
- Dequeue: Remove from front → O(1)
- All core operations: O(1)
- Never use Python list for queue — use
collections.deque
Types: Simple, Circular, Deque (double-ended), Priority Queue
Real-world uses:
- BFS graph traversal (most important)
- CPU scheduling
- Print spooling and job queues
- Message passing between processes
- Network packet buffering
*Next Lesson: Queue Implementation — Complete implementations using arrays, linked lists, and two stacks.*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Queue — Complete Introduction to the FIFO Data Structure.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, queues, queue, introduction
Related Data Structures & Algorithms Topics
Continue learning this concept
QueuesCircular Queue — The Ring Buffer Explained with ImplementationA deep dive into circular queues — why they exist, the wasted space problem with linear array queues, how modular arithmetic creates the circular wraparound, full implementation with all edge cases, the distinction between full and empty states, and real-world applications as ring buffers.QueuesPriority Queue — Complete Guide from Concept to ImplementationMaster priority queues — what they are, how they differ from regular queues, heap-based implementation, PythonQueuesQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreReal-world and algorithmic applications of queues — BFS for shortest paths in unweighted graphs, level-order tree traversal, 01-BFS for binary-weighted graphs, topological sort using BFS (KahnQueuesQueue Implementation — Array, Linked List, and Two-Stack ApproachesComplete queue implementations using three different underlying structures — circular array (O(1) all operations), singly linked list (O(1) all operations), and two stacks (O(1) amortized). Includes the classic interview question of implementing a queue using two stacks.QueuesQueue Interview Problems — 10 Classic Problems with Complete SolutionsSolve 10 classic queue interview problems — BFS shortest path, walls and gates, rotten oranges, number of islands, snake and ladder, sliding window maximum, first non-repeating character in stream, generate binary numbers, interleave queue halves, and LRU cache.QueuesDeque — Double-Ended Queue with Complete Implementation and ApplicationsMaster the deque (double-ended queue) — a data structure allowing O(1) insertion and deletion at both ends. Learn complete implementation using doubly linked list and circular array, all operations, monotonic deque applications, and classic sliding window maximum problem.