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 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.
The Problem with Linear Array Queues
A naive queue using a simple array has a critical flaw: wasted space.
| Initial | [_, _, _, _, _, _, _, _] (capacity = 8) |
| enqueue(A,B,C,D) | [A, B, C, D, _, _, _, _] |
| dequeue(), dequeue() | [_, _, C, D, _, _, _, _] |
| enqueue(E,F,G,H) | [_, _, C, D, E, F, G, H] |
A linear array queue wastes space at the front as elements are dequeued.
Circular Wraparound Using Modular Arithmetic
The core formula:
Example
next_index = (current_index + 1) % capacity
This keeps the index in range [0, capacity-1] and wraps:
| index 0 | next: (0+1)%5 = 1 |
| index 1 | next: (1+1)%5 = 2 |
| index 2 | next: (2+1)%5 = 3 |
| index 3 | next: (3+1)%5 = 4 |
| index 4 | next: (4+1)%5 = 0 ← wraps back to 0 |
Full vs Empty State — The Critical Challenge
Problem: With a circular queue, front == rear could mean EITHER:
- The queue is empty (front caught up to rear)
- The queue is full (rear wrapped all the way around to front)
Solution: Reserve one slot. The queue is "full" when (rear + 1) % capacity == front.
With capacity n, we allocate n+1 slots but only use n slots.
Example
class CircularQueue:
"""
Circular queue using array with one reserved slot.
Capacity n → allocate n+1 slots.
Empty: front == rear
Full: (rear + 1) % (n+1) == front
"""
def __init__(self, capacity: int):
self._size = capacity + 1 # Allocate n+1 slots
self._data = [None] * self._size
self._front = 0
self._rear = 0
def enqueue(self, item) -> bool:
"""Add to rear. Returns True on success, False if full."""
if self.is_full():
return False
self._data[self._rear] = item
self._rear = (self._rear + 1) % self._size
return True
def dequeue(self):
"""Remove from front. Returns None if empty."""
if self.is_empty():
return None
item = self._data[self._front]
self._data[self._front] = None # Clear slot
self._front = (self._front + 1) % self._size
return item
def front_val(self):
"""Peek at front element."""
if self.is_empty():
return None
return self._data[self._front]
def rear_val(self):
"""Peek at rear element."""
if self.is_empty():
return None
return self._data[(self._rear - 1) % self._size]
def is_empty(self) -> bool:
return self._front == self._rear
def is_full(self) -> bool:
return (self._rear + 1) % self._size == self._front
def count(self) -> int:
return (self._rear - self._front) % self._size
def capacity(self) -> int:
return self._size - 1
def display(self):
if self.is_empty():
print("Circular Queue: [empty]")
return
elements = []
i = self._front
while i != self._rear:
elements.append(str(self._data[i]))
i = (i + 1) % self._size
print(f"Circular Queue: [{' → '.join(elements)}] front={self._front}, rear={self._rear}")
Complete operation trace:
Example
cq = CircularQueue(5) # Capacity 5 (internal size 6)
cq.enqueue(1); cq.enqueue(2); cq.enqueue(3)
cq.display() # Circular Queue: [1 → 2 → 3] front=0, rear=3
cq.dequeue(); cq.dequeue()
cq.display() # Circular Queue: [3] front=2, rear=3
cq.enqueue(4); cq.enqueue(5); cq.enqueue(6); cq.enqueue(7)
cq.display() # Circular Queue: [3 → 4 → 5 → 6 → 7] front=2, rear=1 (wrapped!)
print(cq.is_full()) # True
print(cq.enqueue(8)) # False (full)
print(cq.dequeue()) # 3
cq.display() # [4 → 5 → 6 → 7] front=3, rear=1
Ring Buffer for Streaming Data
The circular queue is the basis of the ring buffer — used whenever data is produced at one rate and consumed at another:
Example
class RingBuffer:
"""
Fixed-size ring buffer for streaming data.
Overwrites oldest data when full (unlike the error-raising version above).
Used in: audio buffers, network receive buffers, logging systems.
"""
def __init__(self, capacity: int):
self._capacity = capacity
self._buffer = [None] * capacity
self._write_pos = 0
self._read_pos = 0
self._count = 0
def write(self, data) -> None:
"""Write data. If full, overwrites oldest."""
self._buffer[self._write_pos] = data
self._write_pos = (self._write_pos + 1) % self._capacity
if self._count < self._capacity:
self._count += 1
else:
# Overwrite: advance read position too
self._read_pos = (self._read_pos + 1) % self._capacity
def read(self):
"""Read oldest data."""
if self._count == 0:
raise BufferError("Buffer empty")
data = self._buffer[self._read_pos]
self._read_pos = (self._read_pos + 1) % self._capacity
self._count -= 1
return data
def peek(self):
if self._count == 0:
raise BufferError("Buffer empty")
return self._buffer[self._read_pos]
@property
def is_full(self):
return self._count == self._capacity
@property
def is_empty(self):
return self._count == 0
@property
def available(self):
return self._count
# Audio buffer simulation:
audio_buffer = RingBuffer(8)
# Producer writes samples faster than consumer reads
for i in range(10):
audio_buffer.write(f"sample_{i}")
# Buffer only holds last 8 samples
while not audio_buffer.is_empty:
print(audio_buffer.read())
# Prints: sample_2 through sample_9 (samples 0 and 1 were overwritten)
Circular Queue in BFS
Circular queues are used in BFS implementations where the maximum queue size is bounded by the graph size:
Example
def bfs_circular(graph, start, max_nodes):
"""BFS using a circular queue when graph size is known."""
visited = [False] * max_nodes
queue = CircularQueue(max_nodes)
queue.enqueue(start)
visited[start] = True
while not queue.is_empty():
node = queue.dequeue()
print(node)
for neighbor in graph[node]:
if not visited[neighbor]:
visited[neighbor] = True
queue.enqueue(neighbor)
Summary
- Linear array queue wastes space at the front as elements are dequeued
- Circular queue reuses freed space via modular arithmetic:
next = (curr + 1) % capacity - Full vs empty: Distinguish with reserved slot: full when
(rear+1)%cap == front - Ring buffer: Circular queue that overwrites oldest data when full
- Applications: Audio/video streaming, network buffers, OS I/O buffers, logging
*Next Lesson: Deque — Double-Ended Queue — Elements can be added and removed from both ends.*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Circular Queue — The Ring Buffer Explained with Implementation.
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, circular, queue
Related Data Structures & Algorithms Topics
Continue learning this concept
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.QueuesQueue — Complete Introduction to the FIFO Data StructureA 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.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.