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 Bellman-Ford algorithm completely — why it handles negative weights where Dijkstra fails, the V-1 relaxation rounds, negative cycle detection, SPFA optimization, comparison with Dijkstra, and applications in currency arbitrage and network routing protocols.
Why Bellman-Ford Exists
Dijkstra's algorithm fails with negative edge weights. Bellman-Ford is the solution — it handles negative weights correctly and also detects negative cycles (cycles where the total weight is negative, making shortest path undefined).
| Graph: A | B (weight=4) |
| A | C (weight=2) |
| C | B (weight=-3) ← NEGATIVE! |
| Dijkstra | processes A, extracts B with dist=4 (wrong!) |
| Bellman-Ford: correctly finds A | C→B = 2 + (-3) = -1 |
Algorithm
Example
1. Initialize dist[source] = 0, dist[all others] = infinity
2. Repeat (V-1) times:
For each edge (u, v, w) in the graph:
Relax edge (u, v, w)
3. Check for negative cycles:
For each edge (u, v, w):
If dist[u] + w < dist[v]: negative cycle exists!
Why V-1 iterations? The shortest path in a graph with V vertices has at most V-1 edges. After V-1 relaxations, all shortest paths are found (if no negative cycle exists). If a V-th iteration still finds a shorter path, a negative cycle is reachable.
Complete Implementation
Example
def bellman_ford(edges, n, source):
"""
Bellman-Ford shortest path algorithm.
edges: list of (u, v, weight)
n: number of vertices
source: starting vertex
Returns: (dist, has_negative_cycle)
Time: O(V × E), Space: O(V)
"""
dist = [float('inf')] * n
dist[source] = 0
# V-1 relaxation rounds
for i in range(n - 1):
updated = False
for u, v, w in edges:
if dist[u] != float('inf') and dist[u] + w < dist[v]:
dist[v] = dist[u] + w
updated = True
if not updated:
break # Optimization: if no update, done early
# Check for negative cycles (V-th round)
for u, v, w in edges:
if dist[u] != float('inf') and dist[u] + w < dist[v]:
return dist, True # Negative cycle detected!
return dist, False
edges = [
(0, 1, 4),
(0, 2, 2),
(2, 1, -3),
(1, 3, 1),
(2, 3, 5)
]
dist, has_neg_cycle = bellman_ford(edges, 4, 0)
print(dist) # [0, -1, 2, 0]
print(has_neg_cycle) # False
Step-by-Step Trace
| n=4 vertices, edges: (0 | 1,4),(0→2,2),(2→1,-3),(1→3,1),(2→3,5) |
| Initial | dist = [0, ∞, ∞, ∞] |
| (0 | 1, 4): dist[0]+4=4 < ∞ → dist[1]=4 |
| (0 | 2, 2): dist[0]+2=2 < ∞ → dist[2]=2 |
| (2 | 1,-3): dist[2]+(-3)=-1 < 4 → dist[1]=-1 |
| (1 | 3, 1): dist[1]+1=0 < ∞ → dist[3]=0 |
| (2 | 3, 5): dist[2]+5=7 > 0 → no update |
| After round 1 | dist = [0, -1, 2, 0] |
| No edge improves any distance | all converged |
| Final | dist = [0, -1, 2, 0] ✓ |
| No edge improves any distance | no negative cycle ✓ |
Negative Cycle Detection and Reporting
Example
def bellman_ford_detect_negative_cycle(edges, n, source):
"""
Detect negative cycles and report which vertices are affected.
Returns vertices that are in or reachable from a negative cycle.
"""
dist = [float('inf')] * n
parent = [-1] * n
dist[source] = 0
for i in range(n - 1):
for u, v, w in edges:
if dist[u] != float('inf') and dist[u] + w < dist[v]:
dist[v] = dist[u] + w
parent[v] = u
# V-th round: find one vertex in a negative cycle
neg_cycle_vertex = -1
for u, v, w in edges:
if dist[u] != float('inf') and dist[u] + w < dist[v]:
neg_cycle_vertex = v
break
if neg_cycle_vertex == -1:
return dist, None # No negative cycle
# Trace back to find the actual cycle
# Walk V more steps to ensure we're IN the cycle
x = neg_cycle_vertex
for _ in range(n):
x = parent[x]
# x is now definitely in the cycle. Trace the cycle.
cycle = []
current = x
while True:
cycle.append(current)
current = parent[current]
if current == x:
break
cycle.append(x)
cycle.reverse()
return dist, cycle
edges = [(0,1,1),(1,2,-3),(2,0,1)] # 0→1→2→0 cycle with weight -1
dist, cycle = bellman_ford_detect_negative_cycle(edges, 3, 0)
print(cycle) # [0, 1, 2, 0] — the negative cycle
SPFA — Shortest Path Faster Algorithm
SPFA is an optimization of Bellman-Ford using a queue. Instead of relaxing ALL edges in each round, only relax edges from vertices whose distance was recently updated.
Example
from collections import deque
def spfa(graph, n, source):
"""
SPFA: queue-based Bellman-Ford optimization.
Average case: O(E), Worst case: O(VE)
Much faster than Bellman-Ford in practice on sparse graphs.
"""
dist = [float('inf')] * n
dist[source] = 0
in_queue = [False] * n
relax_count = [0] * n # Count how many times each vertex relaxed
queue = deque([source])
in_queue[source] = True
while queue:
u = queue.popleft()
in_queue[u] = False
for v, w in graph[u]:
if dist[u] + w < dist[v]:
dist[v] = dist[u] + w
relax_count[v] += 1
if relax_count[v] >= n:
return dist, True # Negative cycle!
if not in_queue[v]:
queue.append(v)
in_queue[v] = True
return dist, False
Why SPFA is faster in practice:
- Only vertices with updated distances re-enter the queue
- On sparse graphs with no negative cycles, most vertices enter the queue O(1) times
- Degenerates to O(VE) only on adversarial graphs
Bellman-Ford on Directed Graphs with All-Pairs
python example
def bellman_ford_all_pairs(edges, n):
"""
Run Bellman-Ford from all vertices to get all-pairs shortest paths.
Time: O(V² × E) — much slower than Floyd-Warshall O(V³) for dense graphs.
But better for very sparse graphs.
"""
all_dist = []
for source in range(n):
dist, has_neg = bellman_ford(edges, n, source)
all_dist.append(dist)
return all_distApplication — Currency Arbitrage Detection
Example
Currencies: USD, EUR, GBP, JPY
Exchange rates form a directed graph.
Negative cycle in log-weight graph = arbitrage opportunity.
Convert exchange rates to log:
weight(u,v) = -log(exchange_rate(u,v))
A negative cycle means the product of rates > 1 → profit!
Example
import math
def detect_arbitrage(rates, currencies):
"""
rates[i][j] = exchange rate from currency i to j.
Returns True if there's an arbitrage opportunity.
"""
n = len(currencies)
edges = []
for i in range(n):
for j in range(n):
if i != j and rates[i][j] > 0:
edges.append((i, j, -math.log(rates[i][j])))
dist = [float('inf')] * n
dist[0] = 0
for _ in range(n - 1):
for u, v, w in edges:
if dist[u] + w < dist[v]:
dist[v] = dist[u] + w
# Check for negative cycle
for u, v, w in edges:
if dist[u] + w < dist[v]:
return True # Arbitrage exists!
return False
Bellman-Ford vs Dijkstra
| Feature | Dijkstra | Bellman-Ford |
|---|---|---|
| Negative weights | ❌ Fails | ✅ Handles |
| Negative cycles | ❌ Doesn't detect | ✅ Detects |
| Time complexity | O((V+E) log V) | O(V × E) |
| Algorithm type | Greedy | Dynamic programming |
| Best for | Non-negative weights | Any weights, including negative |
| Directed/Undirected | Both | Both |
Summary
Bellman-Ford: relax all edges V-1 times, detect negative cycles in V-th round.
- Time: O(V×E) — slower than Dijkstra but handles negatives
- Negative cycle detection: V-th round finds any remaining improvements
- SPFA: Queue-based optimization — O(E) average case
- Use when: Negative edges present, negative cycle detection needed, distributed settings (Bellman-Ford is the basis of RIP routing protocol)
*Next Lesson: Floyd-Warshall Algorithm*
Continue the lesson path
Study next in this module
01GraphsBFS Algorithm — Breadth-First Search with All Applications and VariantsMaster Breadth-First Search completely — the level-by-level exploration strategy, complete implementation with queue, BFS tree and shortest path guarantee, detecting bipartite graphs, multi-source BFS, 0-1 BFS, BFS on grids, and all classic BFS interview problems.02GraphsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsMaster Depth-First Search completely — recursive and iterative implementations, DFS tree and timestamps, cycle detection in directed and undirected graphs, finding articulation points and bridges, DFS on grids, topological sort foundation, and all classic DFS interview problems.03GraphsDijkstraMaster Dijkstra04GraphsFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisMaster Floyd-Warshall algorithm completely — the all-pairs shortest path approach, the DP recurrence, step-by-step table filling, path reconstruction, negative cycle detection, transitive closure, and comparison with running Dijkstra V times.