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 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.
Introduction
Beyond basic insert and delete, linked lists have a rich set of operations and patterns that appear repeatedly in interviews and competitive programming. This lesson is a complete reference for all major linked list operation patterns, each explained from first principles with full implementations.
Mastering these patterns — especially the two-pointer (slow-fast) technique — unlocks solutions to dozens of problems that would otherwise seem very difficult.
Reversal Operations
Reverse Entire List — O(n), O(1) Space
python example
def reverse_list(head):
"""
Classic three-pointer iterative reversal.
prev ← current → next_node
"""
prev = None
current = head
while current:
next_node = current.next # Save next
current.next = prev # Reverse pointer
prev = current # Advance prev
current = next_node # Advance current
return prev # New headReverse a Sub-List (Positions m to n) — O(n)
Example
def reverse_between(head, m, n):
"""
Reverse the sublist from position m to n (1-indexed).
Example: [1,2,3,4,5], m=2, n=4 → [1,4,3,2,5]
"""
dummy = Node(0)
dummy.next = head
prev = dummy
# Move prev to the node just before position m
for _ in range(m - 1):
prev = prev.next
current = prev.next # Node at position m (start of reversal)
next_node = current.next
# Reverse by inserting each node at the front of the reversed portion
for _ in range(n - m):
current.next = next_node.next
next_node.next = prev.next
prev.next = next_node
next_node = current.next
return dummy.next
# [1,2,3,4,5], m=2, n=4
# Step by step: 1→(4→3→2)→5
Reverse in Groups of K — O(n)
Example
def reverse_k_group(head, k):
"""
Reverse every k nodes as a group.
[1,2,3,4,5], k=2 → [2,1,4,3,5]
[1,2,3,4,5], k=3 → [3,2,1,4,5]
If remaining nodes < k, leave them as-is.
"""
# Check if there are k nodes remaining
count = 0
check = head
while check and count < k:
check = check.next
count += 1
if count < k:
return head # Leave remaining as-is
# Reverse k nodes
prev = None
current = head
for _ in range(k):
next_node = current.next
current.next = prev
prev = current
current = next_node
# head is now the tail of the reversed group
# Recursively reverse the next group and attach
head.next = reverse_k_group(current, k)
return prev # New head of this group
Merging and Sorting
Merge Two Sorted Lists — O(m+n), O(1)
python example
def merge_sorted(l1, l2):
"""
Merge two sorted linked lists. Dummy head simplifies edge cases.
"""
dummy = Node(0)
current = dummy
while l1 and l2:
if l1.data <= l2.data:
current.next = l1
l1 = l1.next
else:
current.next = l2
l2 = l2.next
current = current.next
current.next = l1 or l2
return dummy.nextSort a Linked List (Merge Sort) — O(n log n), O(log n)
python example
def sort_list(head):
"""
Sort a linked list using Merge Sort.
Time: O(n log n), Space: O(log n) for recursion stack.
Note: Unlike arrays, linked list Merge Sort uses O(1) extra space per merge.
"""
# Base case: empty or single node
if not head or not head.next:
return head
# Step 1: Find middle and split
mid = find_middle(head)
second_half = mid.next
mid.next = None # Split into two halves
# Step 2: Recursively sort both halves
left = sort_list(head)
right = sort_list(second_half)
# Step 3: Merge sorted halves
return merge_sorted(left, right)Palindrome Check — O(n), O(1)
python example
def is_palindrome(head):
"""
Check if linked list is a palindrome.
Algorithm:
1. Find middle
2. Reverse second half
3. Compare first half with reversed second half
4. Restore the list (optional but good practice)
Time: O(n), Space: O(1)
"""
if not head or not head.next:
return True
# Step 1: Find middle
slow = fast = head
while fast and fast.next:
slow = slow.next
fast = fast.next.next
# Step 2: Reverse second half (slow is now at middle)
second_half_head = reverse_list(slow)
second_half_copy = second_half_head # Save for restoration
# Step 3: Compare
first = head
second = second_half_head
is_palindrome_result = True
while second:
if first.data != second.data:
is_palindrome_result = False
break
first = first.next
second = second.next
# Step 4: Restore (reverse second half back)
reverse_list(second_half_copy)
return is_palindrome_resultRemove Duplicates
From Sorted List — O(n), O(1)
Example
def remove_duplicates_sorted(head):
"""
Remove duplicates from a SORTED linked list.
Since sorted, duplicates are adjacent.
"""
current = head
while current and current.next:
if current.data == current.next.data:
current.next = current.next.next # Skip duplicate
else:
current = current.next
return head
# [1,1,2,3,3] → [1,2,3]
From Unsorted List — O(n), O(n)
python example
def remove_duplicates_unsorted(head):
"""
Remove duplicates from an UNSORTED list.
Use a hash set to track seen values.
Time: O(n), Space: O(n)
"""
if not head:
return head
seen = {head.data}
current = head
while current.next:
if current.next.data in seen:
current.next = current.next.next # Skip duplicate
else:
seen.add(current.next.data)
current = current.next
return headPartitioning a Linked List
Partition Around a Value (Leetcode 86) — O(n), O(1)
python example
def partition(head, x):
"""
Partition list so all nodes < x come before nodes >= x.
Maintains relative order within each partition.
"""
# Create two dummy heads for two sublists
less_dummy = Node(0)
greater_dummy = Node(0)
less = less_dummy
greater = greater_dummy
current = head
while current:
if current.data < x:
less.next = current
less = less.next
else:
greater.next = current
greater = greater.next
current = current.next
greater.next = None # End the greater list
less.next = greater_dummy.next # Connect less list to greater list
return less_dummy.nextIntersection of Two Lists — O(m+n), O(1)
python example
def get_intersection_node(headA, headB):
"""
Find the node where two linked lists intersect.
Key insight: If lengths differ, advance the longer list first.
Alternative: Two pointers switch to other list's head when they reach None.
"""
if not headA or not headB:
return None
pointerA = headA
pointerB = headB
# When a pointer reaches end, redirect to the other list's head
# After at most m+n steps, both pointers will either both be None (no intersection)
# or both at the intersection node
while pointerA != pointerB:
pointerA = pointerA.next if pointerA else headB
pointerB = pointerB.next if pointerB else headA
return pointerA # Either the intersection node or NoneFlattening a Multilevel List
python example
def flatten(head):
"""
Flatten a multilevel doubly linked list where nodes may have a 'child' pointer.
Each child list must be inserted inline after its parent node.
Time: O(n), Space: O(1)
"""
if not head:
return head
current = head
while current:
if current.child:
child = current.child
next_node = current.next
# Connect current to child
current.next = child
child.prev = current
current.child = None
# Find end of child list
tail = child
while tail.next:
tail = tail.next
# Connect end of child list to next_node
tail.next = next_node
if next_node:
next_node.prev = tail
current = current.next
return headOperations Complexity Reference
| Operation | Time | Space | Technique |
|---|---|---|---|
| Reverse entire list | O(n) | O(1) | Three-pointer |
| Reverse sublist [m,n] | O(n) | O(1) | Inject at front |
| Reverse k-groups | O(n) | O(log n) | Recursion |
| Find middle | O(n) | O(1) | Slow-fast pointers |
| Detect cycle | O(n) | O(1) | Floyd's |
| Find cycle start | O(n) | O(1) | Floyd's two-phase |
| Nth from end | O(n) | O(1) | Two pointers, gap n |
| Delete nth from end | O(n) | O(1) | Two pointers + dummy |
| Palindrome check | O(n) | O(1) | Reverse half |
| Remove duplicates (sorted) | O(n) | O(1) | Skip adjacent dups |
| Remove duplicates (unsorted) | O(n) | O(n) | Hash set |
| Merge two sorted | O(m+n) | O(1) | Two-pointer merge |
| Sort linked list | O(n log n) | O(log n) | Merge sort |
| Partition around x | O(n) | O(1) | Two sublists |
| Intersection | O(m+n) | O(1) | Pointer switching |
| Flatten multilevel | O(n) | O(1) | Inline insertion |
Summary
The two core techniques for linked list problems:
1. Two-Pointer (Slow-Fast):
- Finding middle, detecting cycles, finding nth from end
- Palindrome check (find middle + reverse second half)
- General pattern: use different speeds or different starting offsets
2. Dummy Head Node:
- Simplifies edge cases (deleting head, merging lists)
- Makes code cleaner when modifying the start of a list
- Return
dummy.nextas the new head
These two techniques, combined with careful pointer manipulation (always save next before overwriting), solve the vast majority of linked list problems.
*Next Lesson: Reverse Linked List — Comprehensive deep dive into reversal — recursive reversal, partial reversal, and k-group reversal with full analysis.*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Linked List Operations — Every Technique with Code and Complexity.
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, list
Related Data Structures & Algorithms Topics
Continue learning this concept
Linked ListsCircular Linked List — Structure, Operations, and ApplicationsMaster 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.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 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.