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
Master circular linked lists — singly and doubly circular variants, complete implementation with insertion and deletion, traversal without infinite loops, detecting circular structure, and real-world applications in round-robin scheduling and circular buffers.
Introduction
A circular linked list is a linked list where the last node's next pointer points back to the first node (the head), forming a continuous loop. Unlike a singly or doubly linked list, there is no None at the end.
This circular structure naturally models scenarios that loop indefinitely: round-robin CPU scheduling (cycle through processes), multiplayer game turns (cycle through players), carousel navigation (cycle through slides), and circular buffers (cycle through a fixed-size buffer).
Node Structure
python example
class CircularNode:
def __init__(self, data):
self.data = data
self.next = None # For circular singly
# self.prev = None # For circular doubly
def __repr__(self):
return f"CNode({self.data})"Singly Circular Linked List — Complete Implementation
python example
class CircularLinkedList:
"""
Singly circular linked list.
We keep a pointer to the TAIL (not head) for O(1) append and prepend.
head can be accessed as tail.next.
"""
def __init__(self):
self.tail = None # Points to last node
self._size = 0
@property
def head(self):
return self.tail.next if self.tail else None
def is_empty(self):
return self.tail is None
def __len__(self):
return self._sizeWhy Keep a Tail Pointer (Not Head)?
With a tail pointer:
- Access head:
tail.next→ O(1) - Insert at head: Create node, set
node.next = tail.next,tail.next = node→ O(1) - Insert at tail: Create node, append after tail, update tail → O(1)
With only a head pointer, inserting at tail would require O(n) traversal to find the last node.
Insertion Operations
python example
def insert_at_head(self, data):
"""Insert at the beginning. O(1)."""
new_node = CircularNode(data)
if self.tail is None:
# Single node points to itself
new_node.next = new_node
self.tail = new_node
else:
new_node.next = self.tail.next # new → old head
self.tail.next = new_node # tail → new head
self._size += 1
def insert_at_tail(self, data):
"""Insert at the end. O(1)."""
new_node = CircularNode(data)
if self.tail is None:
new_node.next = new_node
self.tail = new_node
else:
new_node.next = self.tail.next # new → head
self.tail.next = new_node # old tail → new
self.tail = new_node # Update tail
self._size += 1Visualization — insert 4 at tail when list is [1,2,3]:
Before
tail=3, 3.next=1
1 → 2 → 3 → (back to 1)
Insert 4 at tail
4.next = tail.next = 1 → (4 points to head)
tail.next = 4 → (3 points to 4)
tail = 4 → (4 is new tail)
After
tail=4, 4.next=1
1 → 2 → 3 → 4 → (back to 1)
Traversal — Must Detect Full Circle
python example
def traverse(self):
"""
Traverse all nodes exactly once.
Stop when we return to the head node.
"""
if self.tail is None:
print("Empty list")
return
current = self.tail.next # Start at head
result = []
while True:
result.append(str(current.data))
current = current.next
if current == self.tail.next: # Back at head — full circle done
break
print(" → ".join(result) + " → (back to head)")
def contains(self, value):
"""Search for a value. O(n)."""
if self.tail is None:
return False
current = self.tail.next # Start at head
while True:
if current.data == value:
return True
current = current.next
if current == self.tail.next: # Completed full circle
break
return FalseDeletion Operations
python example
def delete_head(self):
"""Remove the first element. O(1)."""
if self.tail is None:
raise ValueError("Empty list")
if self.tail.next == self.tail: # Only one node
removed = self.tail.data
self.tail = None
self._size -= 1
return removed
head = self.tail.next
removed = head.data
self.tail.next = head.next # Tail points to new head
self._size -= 1
return removed
def delete_tail(self):
"""Remove the last element. O(n) — must find second-to-last."""
if self.tail is None:
raise ValueError("Empty list")
if self.tail.next == self.tail: # Only one node
removed = self.tail.data
self.tail = None
self._size -= 1
return removed
# Find the node just before tail
current = self.tail.next # Start at head
while current.next != self.tail:
current = current.next
removed = self.tail.data
current.next = self.tail.next # Second-to-last → head
self.tail = current # Update tail
self._size -= 1
return removed
def delete_value(self, value):
"""Delete first node with given value. O(n)."""
if self.tail is None:
return False
head = self.tail.next
# Check if head is the target
if head.data == value:
self.delete_head()
return True
# Check if tail is the target
if self.tail.data == value:
self.delete_tail()
return True
# Traverse to find the node before the target
current = head
while current.next != head: # Until we loop back to head
if current.next.data == value:
current.next = current.next.next
if current.next == head: # Deleted node was tail? No — tail is handled above
pass
self._size -= 1
return True
current = current.next
return FalseDoubly Circular Linked List
For scenarios requiring both directions:
python example
class DoublyCircularNode:
def __init__(self, data):
self.data = data
self.next = None
self.prev = None
class DoublyCircularList:
def __init__(self):
# Use sentinel node (dummy) for cleaner implementation
# Sentinel.next = first real node, Sentinel.prev = last real node
self.sentinel = DoublyCircularNode(None)
self.sentinel.next = self.sentinel
self.sentinel.prev = self.sentinel
self._size = 0
def insert_at_head(self, data):
new_node = DoublyCircularNode(data)
head = self.sentinel.next
new_node.next = head
new_node.prev = self.sentinel
self.sentinel.next = new_node
head.prev = new_node
self._size += 1
def insert_at_tail(self, data):
new_node = DoublyCircularNode(data)
tail = self.sentinel.prev
new_node.prev = tail
new_node.next = self.sentinel
tail.next = new_node
self.sentinel.prev = new_node
self._size += 1
def delete_node(self, node):
"""Delete any node in O(1)."""
node.prev.next = node.next
node.next.prev = node.prev
self._size -= 1
def traverse(self):
current = self.sentinel.next
result = []
while current != self.sentinel:
result.append(str(current.data))
current = current.next
print(" ↔ ".join(result) + " ↔ (circular)")Detecting a Circular List
If you receive an unknown linked list and need to check if it is circular:
python example
def is_circular(head):
"""
Detect if a linked list is circular (has a cycle that includes head).
Uses Floyd's algorithm.
Time: O(n), Space: O(1)
"""
if head is None:
return False
slow = head
fast = head.next if head.next else None
while fast is not None and fast != slow:
slow = slow.next
fast = fast.next
if fast:
fast = fast.next
# If fast == slow, there is a cycle
# Additionally check if it cycles back to head (truly circular, not just a loop)
if fast == slow == head:
return True
# More general: check if last node points to head
current = head
while current.next and current.next != head:
current = current.next
return current.next == headReal-World Applications
1. Round-Robin CPU Scheduling
python example
class RoundRobinScheduler:
"""
Simulate round-robin CPU scheduling using circular linked list.
Each process gets equal time slices, cycling through all processes.
"""
def __init__(self, time_quantum=2):
self.cll = CircularLinkedList()
self.time_quantum = time_quantum
def add_process(self, process_id, burst_time):
# Store (process_id, remaining_time) as data
self.cll.insert_at_tail((process_id, burst_time))
print(f"Added Process P{process_id} (burst={burst_time})")
def run(self):
"""Execute all processes with round-robin scheduling."""
if self.cll.is_empty():
return
current = self.cll.tail.next # Start at head
time = 0
while not self.cll.is_empty():
pid, remaining = current.data
# Execute for time_quantum or remaining time
execute_time = min(self.time_quantum, remaining)
remaining -= execute_time
time += execute_time
print(f"Time {time}: P{pid} executed for {execute_time} units"
+ (" → Done" if remaining == 0 else f" → {remaining} remaining"))
next_node = current.next
if remaining == 0:
self.cll.delete_value(current.data) # Process complete
else:
current.data = (pid, remaining) # Update remaining time
current = next_node if not self.cll.is_empty() else None
if current and current == self.cll.head and self.cll.is_empty():
break2. Circular Buffer (Ring Buffer)
Example
class CircularBuffer:
"""
Fixed-size circular buffer for producer-consumer pattern.
Overwrites oldest data when full.
Used in: audio streaming, network packet buffers, logs.
"""
def __init__(self, capacity):
self.buffer = [None] * capacity
self.capacity = capacity
self.head = 0 # Read position
self.tail = 0 # Write position
self._size = 0
def write(self, data):
"""Write data. Overwrites oldest if full."""
self.buffer[self.tail] = data
self.tail = (self.tail + 1) % self.capacity # Circular wrap
if self._size < self.capacity:
self._size += 1
else:
# Overwrite oldest — advance head
self.head = (self.head + 1) % self.capacity
def read(self):
"""Read oldest data. O(1)."""
if self._size == 0:
raise ValueError("Buffer empty")
data = self.buffer[self.head]
self.head = (self.head + 1) % self.capacity
self._size -= 1
return data
def is_full(self):
return self._size == self.capacity
def is_empty(self):
return self._size == 0
Summary
| Feature | Singly Circular | Doubly Circular |
|---|---|---|
| Traversal direction | Forward only | Both directions |
| Memory per node | data + 1 ptr | data + 2 ptrs |
| Delete given node | O(n) | O(1) |
| Head access (tail ptr) | O(1) | O(1) |
| Tail access (tail ptr) | O(1) | O(1) |
| End of list indicator | node.next == head | node.next == sentinel |
Key difference from linear linked lists: There is no None at the end. Traversal must use a "have we looped back?" condition to avoid infinite loops.
Real-world uses:
- Round-robin scheduling
- Circular buffer / ring buffer
- Multiplayer game turn management
- Carousel/slideshow UI
- Fibonacci heap (advanced data structure)
*Next Lesson: Linked List Operations — Deep dive into every linked list operation pattern used in competitive programming and interviews.*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Circular Linked List — Structure, Operations, and Applications.
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, linked, lists, circular
Related Data Structures & Algorithms Topics
Continue learning this concept
Linked ListsDoubly Linked List — Complete Implementation with Bidirectional OperationsA complete guide to doubly linked lists — node structure with prev and next pointers, all operations with O(1) and O(n) complexities, comparison with singly linked lists, LRU Cache implementation using doubly linked list and hash map, and interview problems.Linked ListsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsSolve 12 classic linked list interview problems with complete solutions — reorder list, add two numbers, copy list with random pointer, flatten multilevel list, rotate list, remove nth from end, odd-even linked list, merge k sorted lists, and more.Linked ListsLinked Lists — A Complete Introduction with Memory Model and TypesLearn everything about linked lists from scratch — what they are, how they are stored in memory with pointers, the difference from arrays, all three types (singly, doubly, circular), node structure, and the fundamental operations with time and space complexity.Linked ListsLinked List Operations — Every Technique with Code and ComplexityA complete reference of all essential linked list operations and patterns — reversal, merge, cycle detection, finding nth from end, palindrome check, flattening, sorting, partitioning, and the two-pointer technique — each with full implementation, complexity analysis, and explanations.Linked ListsReverse Linked List — All Approaches from Basic to AdvancedMaster every approach to reversing a linked list — iterative reversal with three pointers, recursive reversal with complete derivation, reversing a sublist, reversing k-groups, reversing alternating k-groups, and why the iterative approach is always preferred in interviews.Linked ListsSingly Linked List — Complete Implementation with All OperationsMaster the singly linked list with complete Python and Java implementations of every operation — insert at head/tail/position, delete by value/position, search, reverse, detect and remove loops, find middle, merge sorted lists, and all classic interview techniques.