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 tabulation (bottom-up DP) completely — how to build DP tables iteratively from base cases, converting recursive solutions to iterative ones, space optimization by rolling arrays, 1D and 2D tabulation examples, and when bottom-up beats top-down memoization.
What Is Tabulation?
Tabulation is the bottom-up approach to dynamic programming. Instead of starting from the original problem and recursing down (memoization), tabulation starts from the smallest subproblems and works up to the final answer — filling a table one entry at a time.
The name comes from filling a "table" (array) of precomputed results.
Step-by-Step: Converting Memoization to Tabulation
Pattern
Memoization approach
def dp(i, j, ...):
if (i,j) in cache: return cache[(i,j)]
# base cases
result = f(dp(i-1,...), dp(i,...-1), ...)
cache[(i,j)] = result
return result
Tabulation approach
dp = [[0]*cols for _ in range(rows)]
# Fill base cases
for i in range(rows): dp[i][0] = base_value
for j in range(cols): dp[0][j] = base_value
# Fill remaining cells
for i in range(1, rows):
for j in range(1, cols):
dp[i][j] = f(dp[i-1][j], dp[i][j-1], ...)
# Answer
return dp[rows-1][cols-1]
Example 1 — Fibonacci (1D Tabulation)
Example
def fibonacci_tabulation(n):
"""
Tabulation: build table from base cases forward.
Time: O(n), Space: O(n)
"""
if n <= 1: return n
dp = [0] * (n + 1)
dp[0] = 0 # Base case
dp[1] = 1 # Base case
for i in range(2, n + 1):
dp[i] = dp[i-1] + dp[i-2] # Fill from known values
return dp[n]
print(fibonacci_tabulation(10)) # 55
# Space optimization: only need last 2 values
def fibonacci_optimized(n):
if n <= 1: return n
prev2, prev1 = 0, 1
for _ in range(2, n+1):
prev2, prev1 = prev1, prev2 + prev1
return prev1
print(fibonacci_optimized(10)) # 55
Table visualization for n=6:
Example
Index: 0 1 2 3 4 5 6
dp: 0 1 1 2 3 5 8
↑ ↑ ↑ ↑ ↑ ↑ ↑
BC BC ←+← ←+← ←+← ←+←
Example 2 — Longest Common Subsequence (2D Tabulation)
Example
def lcs(s1, s2):
"""
Longest Common Subsequence using 2D tabulation.
Time: O(m×n), Space: O(m×n)
"""
m, n = len(s1), len(s2)
# dp[i][j] = LCS of s1[:i] and s2[:j]
dp = [[0] * (n+1) for _ in range(m+1)]
# Base cases: dp[i][0] = dp[0][j] = 0 (already initialized)
for i in range(1, m+1):
for j in range(1, n+1):
if s1[i-1] == s2[j-1]:
dp[i][j] = dp[i-1][j-1] + 1 # Characters match
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1]) # Take best
return dp[m][n]
# Reconstruct the actual LCS string:
def lcs_string(s1, s2):
m, n = len(s1), len(s2)
dp = [[0]*(n+1) for _ in range(m+1)]
for i in range(1, m+1):
for j in range(1, n+1):
if s1[i-1] == s2[j-1]: dp[i][j] = dp[i-1][j-1]+1
else: dp[i][j] = max(dp[i-1][j], dp[i][j-1])
# Backtrack to find the sequence
result = []
i, j = m, n
while i > 0 and j > 0:
if s1[i-1] == s2[j-1]:
result.append(s1[i-1]); i -= 1; j -= 1
elif dp[i-1][j] > dp[i][j-1]: i -= 1
else: j -= 1
return ''.join(reversed(result))
print(lcs("ABCBDAB", "BDCAB")) # 4
print(lcs_string("ABCBDAB", "BDCAB")) # "BCAB"
Table visualization for s1="ABCD", s2="ACBD":
Example
"" A C B D
"" 0 0 0 0 0
A 0 1 1 1 1
B 0 1 1 2 2
C 0 1 2 2 2
D 0 1 2 2 3
Example 3 — 0/1 Knapsack (2D Tabulation)
Example
def knapsack_01(weights, values, capacity):
"""
0/1 Knapsack: each item used at most once.
dp[i][w] = max value using items 0..i-1 with capacity w
Time: O(n×W), Space: O(n×W)
"""
n = len(weights)
dp = [[0] * (capacity + 1) for _ in range(n + 1)]
for i in range(1, n+1):
w_i = weights[i-1]
v_i = values[i-1]
for w in range(capacity + 1):
# Option 1: Don't take item i
dp[i][w] = dp[i-1][w]
# Option 2: Take item i (if it fits)
if w >= w_i:
dp[i][w] = max(dp[i][w], dp[i-1][w - w_i] + v_i)
return dp[n][capacity]
weights = [2, 3, 4, 5]
values = [3, 4, 5, 6]
capacity = 5
print(knapsack_01(weights, values, capacity)) # 7 (items with w=2,3 → v=3+4=7)
# Space-optimized: 1D array (process capacity in REVERSE to avoid reuse)
def knapsack_01_1d(weights, values, capacity):
dp = [0] * (capacity + 1)
for i in range(len(weights)):
for w in range(capacity, weights[i]-1, -1): # REVERSE order!
dp[w] = max(dp[w], dp[w - weights[i]] + values[i])
return dp[capacity]
print(knapsack_01_1d(weights, values, capacity)) # 7
Why reverse order in space-optimized version? In the 2D table, dp[i][w] uses dp[i-1][w - w_i] — from the PREVIOUS row. If we process forward, we'd accidentally use updated values from the CURRENT row (which would allow reusing an item). Reverse processing preserves the "previous row" semantics.
Example 4 — Coin Change (1D Tabulation)
Example
def coin_change(coins, amount):
"""
Minimum coins to make amount.
dp[a] = minimum coins to make amount a
Time: O(amount × len(coins)), Space: O(amount)
"""
dp = [float('inf')] * (amount + 1)
dp[0] = 0 # Base case: 0 coins for amount 0
for a in range(1, amount + 1):
for coin in coins:
if coin <= a:
dp[a] = min(dp[a], dp[a - coin] + 1)
return dp[amount] if dp[amount] != float('inf') else -1
print(coin_change([1, 5, 6, 9], 11)) # 2 (5+6)
print(coin_change([2], 3)) # -1 (impossible)
# Table for coins=[1,5,6], amount=10:
# a: 0 1 2 3 4 5 6 7 8 9 10
# dp: 0 1 2 3 4 1 1 2 2 3 2
# ↑ ↑
# 5=1 6=1
Space Optimization — Rolling Array
When dp[i][j] only depends on dp[i-1][j] and dp[i-1][j-1], we can reduce from O(m×n) to O(n):
Example
def lcs_space_optimized(s1, s2):
"""
LCS with O(n) space instead of O(m×n).
Only need previous row to compute current row.
"""
m, n = len(s1), len(s2)
prev = [0] * (n + 1) # "Previous row"
for i in range(1, m+1):
curr = [0] * (n + 1) # "Current row"
for j in range(1, n+1):
if s1[i-1] == s2[j-1]:
curr[j] = prev[j-1] + 1
else:
curr[j] = max(prev[j], curr[j-1])
prev = curr # Slide: current becomes previous
return prev[n]
print(lcs_space_optimized("ABCBDAB", "BDCAB")) # 4
Filling Order Rules
The correct filling order ensures every cell is filled before it's needed:
Example
For dp[i][j] that depends on dp[i-1][...] and dp[i][j-1]:
→ Fill left to right, top to bottom ✓
For dp[i][j] that depends on dp[i+1][...] and dp[i][j+1]:
→ Fill right to left, bottom to top ✓
For interval DP dp[i][j] that depends on dp[i][k] and dp[k+1][j]:
→ Fill by increasing length of interval ✓
Tabulation for Shortest Path
Example
def min_path_sum(grid):
"""
Minimum path sum from top-left to bottom-right.
Only move right or down.
"""
m, n = len(grid), len(grid[0])
dp = [[0]*n for _ in range(m)]
dp[0][0] = grid[0][0]
# Fill first row (can only come from left)
for j in range(1, n):
dp[0][j] = dp[0][j-1] + grid[0][j]
# Fill first column (can only come from above)
for i in range(1, m):
dp[i][0] = dp[i-1][0] + grid[i][0]
# Fill rest
for i in range(1, m):
for j in range(1, n):
dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][j]
return dp[m-1][n-1]
grid = [[1,3,1],[1,5,1],[4,2,1]]
print(min_path_sum(grid)) # 7 (1→3→1→1→1)
Comparison: Memoization vs Tabulation
| Aspect | Memoization | Tabulation |
|---|---|---|
| Direction | Top-down (recursive) | Bottom-up (iterative) |
| Computation | Only needed states | All states in order |
| Stack overhead | Yes (recursion) | No |
| Stack overflow | Possible for large n | Not possible |
| Space optimization | Harder | Easy (rolling array) |
| Implementation | Faster to write | Slightly more code |
| Cache hits | Automatic | N/A (all computed) |
Summary
Tabulation builds the DP table from base cases upward:
- Define the DP table — what does
dp[i]ordp[i][j]represent? - Fill base cases — edges of the table, known initial values
- Fill the rest — correct order ensures dependencies are satisfied
- Return the answer — the final cell contains the answer
Space optimization: When the recurrence only looks at the previous row/column, reduce from 2D to 1D by maintaining a rolling array.
Key advantage over memoization: No recursion stack → no stack overflow risk → can safely solve problems with n = 10^6 or more.
*Next Lesson: Fibonacci DP*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Tabulation — Bottom-Up Dynamic Programming with Complete Table Building.
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, dynamic, programming, tabulation
Related Data Structures & Algorithms Topics
Continue learning this concept
Dynamic ProgrammingDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideSolve 12 classic DP interview problems — maximum product subarray, decode ways, jump game II, unique paths with obstacles, minimum path sum, coin change II, target sum, longest palindromic substring, word break, stock problems, regular expression matching, and wildcard matching.Dynamic ProgrammingDynamic Programming — Complete Introduction with Properties and Problem IdentificationMaster dynamic programming from scratch — what DP really is, the two essential properties (overlapping subproblems and optimal substructure), how to identify a DP problem, the four-step DP recipe, comparison with divide-and-conquer and greedy, and a taxonomy of DP problem types.Dynamic ProgrammingFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationMaster Fibonacci and Fibonacci-like problems with dynamic programming — naive recursion O(2^n), memoization O(n), tabulation O(n), space-optimized O(1) space, matrix exponentiation O(log n), and classic DP problems that reduce to Fibonacci variants like climbing stairs, house robber, and tile tiling.Dynamic ProgrammingKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisMaster all knapsack variants — 0/1 knapsack with 2D and 1D DP tables, unbounded knapsack with reusable items, fractional knapsack with greedy, subset sum, partition equal subset sum, and the general framework for recognizing knapsack problems in interviews.Dynamic ProgrammingLongest Common Subsequence — Complete Guide with DP Table and String VariantsMaster Longest Common Subsequence (LCS) completely — definition with clear examples, 2D DP table construction, string reconstruction, space optimization, and all important variants including Longest Common Substring, Edit Distance, Shortest Common Supersequence, and real-world applications.Dynamic ProgrammingLongest Increasing Subsequence — O(n log n) with Patience SortingMaster Longest Increasing Subsequence (LIS) completely — the O(n²) DP solution, the O(n log n) patience sorting algorithm, reconstructing the actual LIS, variants including longest non-decreasing subsequence and bitonic subsequence, and applications in scheduling and sequence analysis.