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 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.
What Is BFS?
Breadth-First Search (BFS) is a graph traversal algorithm that explores all vertices at the current "level" (distance from start) before moving to vertices at the next level. It uses a queue (FIFO) to maintain the order of exploration.
Intuition: Imagine dropping a stone in water. The ripples spread outward in concentric circles — all points at distance 1 first, then distance 2, then 3... BFS works the same way.
| Graph | BFS from vertex 0: |
| 0—1—4 Level 0 | {0} |
| | | Level 1 | {1, 3} (neighbors of 0) |
| 2—3 Level 2 | {4, 2} (neighbors of 1 and 3) |
| Level 3 | {} (no new neighbors) |
| BFS order: 0 | 1 → 3 → 4 → 2 |
BFS Step-by-Step Trace
| Graph | 0—1—2—3 (path graph) |
| Step 1 | queue=[0], visited={0} |
| Neighbors of 0 | 1, 4 — add to queue |
| Step 2 | Dequeue 1 |
| Neighbors of 1 | 0(visited), 2 |
| Step 3 | Dequeue 4 |
| Neighbors of 4 | 0(visited), 3 |
| Step 4 | Dequeue 2 |
| Neighbors | 1(visited), 3(visited) |
| Step 5 | Dequeue 3 |
| Neighbors | all visited |
| Result: 0 | 1→4→2→3 |
BFS for Shortest Path (Unweighted Graph)
Key property: In an unweighted graph, BFS guarantees the SHORTEST path (fewest edges) from source to any reachable vertex. This is because BFS explores nodes level by level — it reaches every node via the minimum number of hops.
Example
def bfs_shortest_path(graph, source, target):
"""
Find shortest path (min edges) from source to target.
Returns the path as a list, or None if unreachable.
Time: O(V + E), Space: O(V)
"""
if source == target:
return [source]
visited = {source}
queue = deque([(source, [source])]) # (current_node, path_to_node)
while queue:
node, path = queue.popleft()
for neighbor in graph[node]:
if neighbor == target:
return path + [neighbor] # Found! Return the complete path
if neighbor not in visited:
visited.add(neighbor)
queue.append((neighbor, path + [neighbor]))
return None # Target not reachable
graph = {0:[1,2], 1:[0,3], 2:[0,3], 3:[1,2,4], 4:[3]}
print(bfs_shortest_path(graph, 0, 4)) # [0, 1, 3, 4] or [0, 2, 3, 4]
BFS with Distance Array (More Efficient)
Example
def bfs_distances(graph, source):
"""
Find shortest distances from source to all reachable vertices.
Avoids storing full paths — much more memory efficient.
"""
dist = {source: 0}
queue = deque([source])
while queue:
node = queue.popleft()
for neighbor in graph[node]:
if neighbor not in dist:
dist[neighbor] = dist[node] + 1
queue.append(neighbor)
return dist
graph = {0:[1,2], 1:[0,3], 2:[0,3], 3:[1,2,4], 4:[3]}
print(bfs_distances(graph, 0))
# {0:0, 1:1, 2:1, 3:2, 4:3}
Level-by-Level BFS
When you need to process all nodes at one distance before the next:
Example
def bfs_level_order(graph, start):
"""
BFS that groups nodes by level.
Used in: level-order tree traversal, finding eccentricity.
"""
visited = {start}
current_level = [start]
levels = []
while current_level:
levels.append(list(current_level))
next_level = []
for node in current_level:
for neighbor in graph[node]:
if neighbor not in visited:
visited.add(neighbor)
next_level.append(neighbor)
current_level = next_level
return levels
graph = {0:[1,2], 1:[3,4], 2:[5], 3:[], 4:[], 5:[]}
print(bfs_level_order(graph, 0))
# [[0], [1,2], [3,4,5]]
BFS on 2D Grid
Grids are graphs where each cell is a vertex and edges go to adjacent cells:
Example
def bfs_grid(grid, start_r, start_c, target_r, target_c):
"""
Find shortest path in 2D grid.
grid[r][c] = 0 means passable, 1 means blocked.
"""
m, n = len(grid), len(grid[0])
if grid[start_r][start_c] == 1 or grid[target_r][target_c] == 1:
return -1
queue = deque([(start_r, start_c, 0)]) # (row, col, distance)
visited = {(start_r, start_c)}
while queue:
r, c, dist = queue.popleft()
if r == target_r and c == target_c:
return dist
for dr, dc in [(0,1),(0,-1),(1,0),(-1,0)]: # 4 directions
nr, nc = r+dr, c+dc
if (0 <= nr < m and 0 <= nc < n and
grid[nr][nc] == 0 and (nr,nc) not in visited):
visited.add((nr, nc))
queue.append((nr, nc, dist+1))
return -1 # No path exists
grid = [
[0,0,0,0],
[0,1,1,0],
[0,0,0,0]
]
print(bfs_grid(grid, 0, 0, 2, 3)) # 5
Multi-Source BFS
When you have multiple starting points simultaneously:
Example
def multi_source_bfs(grid, sources):
"""
Start BFS from all source cells simultaneously.
Finds distance from nearest source for each cell.
Used in: walls and gates, rotten oranges.
"""
m, n = len(grid), len(grid[0])
dist = [[float('inf')]*n for _ in range(m)]
queue = deque()
for r, c in sources:
dist[r][c] = 0
queue.append((r, c))
while queue:
r, c = queue.popleft()
for dr, dc in [(0,1),(0,-1),(1,0),(-1,0)]:
nr, nc = r+dr, c+dc
if 0 <= nr < m and 0 <= nc < n and dist[nr][nc] == float('inf'):
dist[nr][nc] = dist[r][c] + 1
queue.append((nr, nc))
return dist
BFS for Bipartite Check
A graph is bipartite if vertices can be colored with 2 colors such that no two adjacent vertices share the same color.
Example
def is_bipartite(graph):
"""
Check if graph is bipartite using 2-coloring via BFS.
A graph is bipartite iff it has no odd-length cycles.
Time: O(V + E)
"""
color = {}
for start in graph:
if start in color:
continue # Already colored this component
color[start] = 0
queue = deque([start])
while queue:
node = queue.popleft()
for neighbor in graph[node]:
if neighbor not in color:
color[neighbor] = 1 - color[node] # Opposite color
queue.append(neighbor)
elif color[neighbor] == color[node]:
return False # Same color adjacent vertex → not bipartite
return True
# Bipartite (no odd cycles)
g1 = {0:[1,3], 1:[0,2], 2:[1,3], 3:[0,2]}
print(is_bipartite(g1)) # True
# Not bipartite (triangle = 3-cycle = odd)
g2 = {0:[1,2], 1:[0,2], 2:[0,1]}
print(is_bipartite(g2)) # False
0-1 BFS — For Graphs with Edge Weights 0 or 1
When edges have weight 0 or 1 (not general), a deque achieves O(V+E) instead of Dijkstra's O((V+E) log V):
Example
def bfs_01(graph, source, n):
"""
0-1 BFS: edge weights are 0 or 1.
Weight-0 edges: prepend (front of deque)
Weight-1 edges: append (back of deque)
Time: O(V + E)
"""
dist = [float('inf')] * n
dist[source] = 0
dq = deque([source])
while dq:
node = dq.popleft()
for neighbor, weight in graph[node]:
new_dist = dist[node] + weight
if new_dist < dist[neighbor]:
dist[neighbor] = new_dist
if weight == 0:
dq.appendleft(neighbor) # High priority
else:
dq.append(neighbor) # Lower priority
return dist
Connected Components
Example
def count_components(graph, n):
"""Count connected components using BFS."""
visited = set()
components = 0
for start in range(n):
if start not in visited:
components += 1
queue = deque([start])
visited.add(start)
while queue:
node = queue.popleft()
for neighbor in graph.get(node, []):
if neighbor not in visited:
visited.add(neighbor)
queue.append(neighbor)
return components
Complexity
| Aspect | Value | Notes |
|---|---|---|
| Time | O(V + E) | Visit each vertex once, each edge once |
| Space | O(V) | Queue holds at most V vertices |
| Shortest path guarantee | ✅ Yes | For unweighted graphs only |
| Completeness | ✅ Yes | Finds all reachable vertices |
Summary
BFS uses a queue and explores level by level:
- Start at source, mark visited, add to queue
- Dequeue a vertex, process it, add unvisited neighbors to queue
- Repeat until queue is empty
Key properties:
- Finds shortest path (min edges) in unweighted graphs
- Explores in order of distance from source
- O(V+E) time with adjacency list
- Natural for level-order traversal, multi-source, bipartite checking
Use BFS when: "Minimum steps," "shortest path in unweighted graph," "level by level processing," "find nearest X."
*Next Lesson: DFS Algorithm*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for BFS Algorithm — Breadth-First Search with All Applications and Variants.
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, graphs, bfs, algorithm
Related Data Structures & Algorithms Topics
Continue learning this concept
GraphsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionMaster 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.GraphsDFS 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.GraphsDijkstraMaster DijkstraGraphsFloyd-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.GraphsKruskalMaster KruskalGraphsPrimMaster Prim