Dynamic Programming: Solving Problems by Remembering

# Naive recursive - exponential time O(2^n)
def fibonacci_naive(n): if n <= 1: return n return fibonacci_naive(n-1) + fibonacci_naive(n-2)

# With memoization - linear time O(n)
def fibonacci_memo(n, memo={}): if n in memo: return memo[n] if n <= 1: return n memo[n] = fibonacci_memo(n-1, memo) + fibonacci_memo(n-2, memo) return memo[n]

# Test
print(fibonacci_naive(5)) # 5 (slow)
print(fibonacci_memo(5)) # 5 (fast)
print(fibonacci_memo(40)) # 102334155 (fast!)

# Better: use decorator for memoization
from functools import lru_cache

@lru_cache(maxsize=None)
def fibonacci_cached(n): if n <= 1: return n return fibonacci_cached(n-1) + fibonacci_cached(n-2)

print(fibonacci_cached(50))  # Works instantly!

def fibonacci_tab(n): """DP with tabulation - O(n) time, O(n) space""" if n <= 1: return n dp = [0] * (n + 1) dp[0] = 0 dp[1] = 1 for i in range(2, n + 1): dp[i] = dp[i-1] + dp[i-2] return dp[n]

# Space-optimized: only store last two values
def fibonacci_optimized(n): """O(n) time, O(1) space""" if n <= 1: return n prev2 = 0 prev1 = 1 for i in range(2, n + 1): current = prev1 + prev2 prev2 = prev1 prev1 = current return prev1

print(fibonacci_tab(10)) # 55
print(fibonacci_optimized(10))  # 55

def coin_change(coins, amount): """Minimum coins to make amount - O(n*amount) time""" # dp[i] = minimum coins to make amount i dp = [float('inf')] * (amount + 1) dp[0] = 0 for i in range(1, amount + 1): for coin in coins: if coin <= i: dp[i] = min(dp[i], dp[i - coin] + 1) return dp[amount] if dp[amount] != float('inf') else -1

# Indian currency coins: 1, 2, 5, 10, 25, 50 paise and 1, 2, 5, 10 rupees
coins = [1, 2, 5, 10]
print(coin_change(coins, 27))  # 4 coins (10+10+5+2)

# Reconstruct solution - which coins to use
def coin_change_with_coins(coins, amount): dp = [float('inf')] * (amount + 1) dp[0] = 0 parent = [-1] * (amount + 1) for i in range(1, amount + 1): for coin in coins: if coin <= i and dp[i - coin] + 1 < dp[i]: dp[i] = dp[i - coin] + 1 parent[i] = coin # Reconstruct result = [] curr = amount while curr > 0: coin = parent[curr] result.append(coin) curr -= coin return result, dp[amount]

coins_used, count = coin_change_with_coins([1, 2, 5, 10], 27)
print(f"Use {count} coins: {coins_used}")  # [10, 10, 5, 2]

def lcs(text1, text2): """Longest common subsequence - O(m*n) time""" m, n = len(text1), len(text2) # dp[i][j] = LCS length of text1[:i] and text2[:j] dp = [[0] * (n + 1) for _ in range(m + 1)] for i in range(1, m + 1): for j in range(1, n + 1): if text1[i-1] == text2[j-1]: dp[i][j] = dp[i-1][j-1] + 1 else: dp[i][j] = max(dp[i-1][j], dp[i][j-1]) return dp[m][n]

def lcs_string(text1, text2): """Return the actual LCS string""" m, n = len(text1), len(text2) dp = [[0] * (n + 1) for _ in range(m + 1)] for i in range(1, m + 1): for j in range(1, n + 1): if text1[i-1] == text2[j-1]: dp[i][j] = dp[i-1][j-1] + 1 else: dp[i][j] = max(dp[i-1][j], dp[i][j-1]) # Reconstruct LCS result = [] i, j = m, n while i > 0 and j > 0: if text1[i-1] == text2[j-1]: result.append(text1[i-1]) i -= 1 j -= 1 elif dp[i-1][j] > dp[i][j-1]: i -= 1 else: j -= 1 return ''.join(reversed(result))

# Examples
print(lcs("ABCDGH", "AEDFHR"))  # 3 (ADH)
print(lcs_string("ABCDGH", "AEDFHR"))  # "ADH"

# Practical: find common words between two sentences
text1 = "hello world from delhi"
text2 = "world from delhi to here"
print(lcs(text1, text2))  # 14

def knapsack_01(weights, values, capacity): """0/1 Knapsack - O(n*capacity) time""" n = len(weights) # dp[i][w] = max value using first i items with weight limit w dp = [[0] * (capacity + 1) for _ in range(n + 1)] for i in range(1, n + 1): for w in range(capacity + 1): # Don't take item i-1 dp[i][w] = dp[i-1][w] # Take item i-1 if it fits if weights[i-1] <= w: dp[i][w] = max(dp[i][w], dp[i-1][w - weights[i-1]] + values[i-1]) return dp[n][capacity]

# Example: bag with capacity 50kg
weights = [10, 20, 30]  # kg
values = [60, 100, 120] # rupees
capacity = 50

max_value = knapsack_01(weights, values, capacity)
print(f"Maximum value: {max_value}")  # 220 (items 0 and 2)

# Minimize rupee notes for change
indian_denominations = [1, 2, 5, 10, 20, 50, 100, 500, 2000]
amount = 2847

def min_notes_for_change(amount): dp = [float('inf')] * (amount + 1) dp[0] = 0 for coin in indian_denominations: for i in range(coin, amount + 1): dp[i] = min(dp[i], dp[i - coin] + 1) return dp[amount]

print(f"Minimum notes: {min_notes_for_change(2847)}")  # 4 (2000+500+200+47... wait)

From Concept to Reality: Dynamic Programming: Solving Problems by Remembering

In the professional world, the difference between a good engineer and a great one often comes down to understanding fundamentals deeply. Anyone can copy code from Stack Overflow. But when that code breaks at 2 AM and your application is down — affecting millions of users — only someone who truly understands the underlying concepts can diagnose and fix the problem.

Dynamic Programming: Solving Problems by Remembering is one of those fundamentals. Whether you end up working at Google, building your own startup, or applying CS to solve problems in agriculture, healthcare, or education, these concepts will be the foundation everything else is built on. Indian engineers are known globally for their strong fundamentals — this is why companies worldwide recruit from IITs, NITs, IIIT Hyderabad, and BITS Pilani. Let us make sure you have that same strong foundation.

Object-Oriented Programming: Modelling the Real World

OOP lets you model real-world entities as code "objects." Each object has properties (data) and methods (behaviour). Here is a practical example:

class BankAccount: """A simple bank account — like what SBI or HDFC uses internally""" def __init__(self, holder_name, initial_balance=0): self.holder = holder_name self.balance = initial_balance # Private in practice self.transactions = [] # History log def deposit(self, amount): if amount <= 0: raise ValueError("Deposit must be positive") self.balance += amount self.transactions.append(f"+₹{amount}") return self.balance def withdraw(self, amount): if amount > self.balance: raise ValueError("Insufficient funds!") self.balance -= amount self.transactions.append(f"-₹{amount}") return self.balance def statement(self): print(f"
--- Account Statement: {self.holder} ---") for t in self.transactions: print(f"  {t}") print(f"  Balance: ₹{self.balance}")

# Usage
acc = BankAccount("Rahul Sharma", 5000)
acc.deposit(15000) # Salary credited
acc.withdraw(2000) # UPI payment to Swiggy
acc.withdraw(500) # Metro card recharge
acc.statement()

This is encapsulation — bundling data and behaviour together. The user of BankAccount does not need to know HOW deposit works internally; they just call it. Inheritance lets you extend this: a SavingsAccount could inherit from BankAccount and add interest calculation. Polymorphism means different account types can respond to the same .withdraw() method differently (savings accounts might check minimum balance, current accounts might allow overdraft).

Real-World System Design: Swiggy's Architecture

When you order food on Swiggy, here is what happens behind the scenes in about 2 seconds: your location is geocoded (algorithms), nearby restaurants are queried from a spatial index (data structures), menu prices are pulled from a database (SQL), delivery time is estimated using ML models trained on historical data (AI), the order is placed in a distributed message queue (Kafka), a delivery partner is assigned using a matching algorithm (optimization), and real-time tracking begins using WebSocket connections (networking). EVERY concept in your CS curriculum is being used simultaneously to deliver your biryani.

How the Web Request Cycle Works

Every time you visit a website, a precise sequence of events occurs. Here is the flow:

 You (Browser) DNS Server Web Server | | | |---[1] bharath.ai --->| | | | | |<--[2] IP: 76.76.21.9| | | | | |---[3] GET /index.html ----------------->  | | | | | | [4] Server finds file, | | runs server code, | | prepares response | | | |<---[5] HTTP 200 OK + HTML + CSS + JS --- | | | | [6] Browser parses HTML | Loads CSS (styling) | Executes JS (interactivity) | Renders final page |

Step 1-2 is DNS resolution — converting a human-readable domain name to a machine-readable IP address. Step 3 is the HTTP request. Step 4 is server-side processing (this is where frameworks like Node.js, Django, or Flask operate). Step 5 is the HTTP response. Step 6 is client-side rendering (this is where React, Angular, or Vue operate).

In a real-world scenario, this cycle also involves CDNs (Content Delivery Networks), load balancers, caching layers, and potentially microservices. Indian companies like Jio use this exact architecture to serve 400+ million subscribers.

Production Engineering: Dynamic Programming: Solving Problems by Remembering at Scale

Understanding dynamic programming: solving problems by remembering at an academic level is necessary but not sufficient. Let us examine how these concepts manifest in production environments where failure has real consequences.

Consider India's UPI system processing 10+ billion transactions monthly. The architecture must guarantee: atomicity (a transfer either completes fully or not at all — no half-transfers), consistency (balances always add up correctly across all banks), isolation (concurrent transactions on the same account do not interfere), and durability (once confirmed, a transaction survives any failure). These are the ACID properties, and violating any one of them in a payment system would cause financial chaos for millions of people.

At scale, you also face the thundering herd problem: what happens when a million users check their exam results at the same time? (CBSE result day, anyone?) Without rate limiting, connection pooling, caching, and graceful degradation, the system crashes. Good engineering means designing for the worst case while optimising for the common case. Companies like NPCI (the organisation behind UPI) invest heavily in load testing — simulating peak traffic to identify bottlenecks before they affect real users.

Monitoring and observability become critical at scale. You need metrics (how many requests per second? what is the 99th percentile latency?), logs (what happened when something went wrong?), and traces (how did a single request flow through 15 different microservices?). Tools like Prometheus, Grafana, ELK Stack, and Jaeger are standard in Indian tech companies. When Hotstar streams IPL to 50 million concurrent users, their engineering team watches these dashboards in real-time, ready to intervene if any metric goes anomalous.

The career implications are clear: engineers who understand both the theory (from chapters like this one) AND the practice (from building real systems) command the highest salaries and most interesting roles. India's top engineering talent earns ₹50-100+ LPA at companies like Google, Microsoft, and Goldman Sachs, or builds their own startups. The foundation starts here.

Key Vocabulary

Here are important terms from this chapter that you should know:

💡 Interview-Style Problem

Here is a problem that frequently appears in technical interviews at companies like Google, Amazon, and Flipkart: "Design a URL shortener like bit.ly. How would you generate unique short codes? How would you handle millions of redirects per second? What database would you use and why? How would you track click analytics?"

Think about: hash functions for generating short codes, read-heavy workload (99% redirects, 1% creates) suggesting caching, database choice (Redis for cache, PostgreSQL for persistence), and horizontal scaling with consistent hashing. Try sketching the system architecture on paper before looking up solutions. The ability to think through system design problems is the single most valuable skill for senior engineering roles.

Where This Takes You

The knowledge you have gained about dynamic programming: solving problems by remembering is directly applicable to: competitive programming (Codeforces, CodeChef — India has the 2nd largest competitive programming community globally), open-source contribution (India is the 2nd largest contributor on GitHub), placement preparation (these concepts form 60% of technical interview questions), and building real products (every startup needs engineers who understand these fundamentals).

India's tech ecosystem offers incredible opportunities. Freshers at top companies earn ₹15-50 LPA; experienced engineers at FAANG companies in India earn ₹50-1 Cr+. But more importantly, the problems being solved in India — digital payments for 1.4 billion people, healthcare AI for rural areas, agricultural tech for 150 million farmers — are some of the most impactful engineering challenges in the world. The fundamentals you are building will be the tools you use to tackle them.

Crafted for Class 7–9 • Graph Algorithms & Advanced DS • Aligned with NEP 2020 & CBSE Curriculum