Hash Tables: O(1) Lookup Magic

def simple_hash(key, table_size): """Simple hash function based on string length""" return len(key) % table_size

# Problem: All keys with same length map to same bucket
print(simple_hash("ab", 10))  # Output: 2
print(simple_hash("cd", 10))  # Output: 2 - Collision!

def polynomial_hash(key, table_size, base=31, mod=10**9 + 7): """Better hash function using polynomial rolling""" hash_value = 0 for char in key: hash_value = (hash_value * base + ord(char)) % mod return hash_value % table_size

# Test
print(polynomial_hash("apple", 10))  # Distributes better
print(polynomial_hash("apply", 10))  # Different from "apple"

def number_hash(key, table_size): """Simple modulo hash for numbers""" return key % table_size

# Aadhaar-like 12-digit number
aadhaar = 123456789012
print(number_hash(aadhaar, 1000))  # Maps to a bucket

class HashTableChaining: def __init__(self, size=10): self.size = size self.table = [[] for _ in range(size)] def hash_func(self, key): return hash(key) % self.size def insert(self, key, value): index = self.hash_func(key) # Check if key exists and update for i, (k, v) in enumerate(self.table[index]): if k == key: self.table[index][i] = (key, value) return # Key not found, add new pair self.table[index].append((key, value)) def search(self, key): index = self.hash_func(key) for k, v in self.table[index]: if k == key: return v return None def delete(self, key): index = self.hash_func(key) self.table[index] = [(k, v) for k, v in self.table[index] if k != key]

# Usage
ht = HashTableChaining(5)
ht.insert("name", "Raj")
ht.insert("city", "Delhi")
ht.insert("age", 15)
print(ht.search("name"))  # Output: Raj
ht.delete("age")
print(ht.search("age")) # Output: None

class HashTableLinearProbing: def __init__(self, size=10): self.size = size self.table = [None] * size self.keys = [None] * size def hash_func(self, key): return hash(key) % self.size def insert(self, key, value): index = self.hash_func(key) # Linear probing: move forward until empty slot found while self.table[index] is not None: if self.keys[index] == key: self.table[index] = value return index = (index + 1) % self.size self.keys[index] = key self.table[index] = value def search(self, key): index = self.hash_func(key) while self.table[index] is not None: if self.keys[index] == key: return self.table[index] index = (index + 1) % self.size return None

# Usage
ht = HashTableLinearProbing(7)
ht.insert("user1", 1001)
ht.insert("user2", 1002)
print(ht.search("user1"))  # Output: 1001

class HashTableQuadraticProbing: def __init__(self, size=10): self.size = size self.table = [None] * size self.keys = [None] * size def hash_func(self, key): return hash(key) % self.size def insert(self, key, value): index = self.hash_func(key) i = 0 while self.table[index] is not None: if self.keys[index] == key: self.table[index] = value return i += 1 index = (self.hash_func(key) + i*i) % self.size self.keys[index] = key self.table[index] = value def search(self, key): index = self.hash_func(key) i = 0 while self.table[index] is not None: if self.keys[index] == key: return self.table[index] i += 1 index = (self.hash_func(key) + i*i) % self.size return None

# Usage
ht = HashTableQuadraticProbing(7)
ht.insert("key1", "value1")
print(ht.search("key1"))  # Output: value1

class DynamicHashTable: def __init__(self, initial_size=8, load_factor_threshold=0.75): self.size = initial_size self.table = {} self.load_factor_threshold = load_factor_threshold self.count = 0 def insert(self, key, value): self.table[key] = value self.count += 1 # Check if resizing needed if self.count / self.size > self.load_factor_threshold: self.resize() def resize(self): print(f"Resizing: {self.size} -> {self.size * 2}") old_table = self.table self.size *= 2 self.table = {} self.count = 0 for key, value in old_table.items(): self.insert(key, value) def search(self, key): return self.table.get(key)

# Usage
ht = DynamicHashTable(4, 0.75)
for i in range(10): ht.insert(f"key{i}", f"value{i}")
# Resize is triggered multiple times as load factor exceeds 0.75

# Dictionary operations
student = {}
student["name"] = "Arjun"
student["roll"] = 25
student["city"] = "Mumbai"

print(student["name"]) # O(1) lookup
print("roll" in student) # O(1) membership test
del student["city"] # O(1) deletion

# Iterating over dictionary
for key, value in student.items(): print(f"{key}: {value}")

# Dictionary comprehension
squares = {x: x**2 for x in range(5)}
print(squares)  # {0: 0, 1: 1, 2: 4, 3: 9, 4: 16}

# Simplified Aadhaar lookup system
class AadhaarDB: def __init__(self): self.database = {} def register(self, aadhaar_number, citizen_data): """Register a citizen's data""" self.database[aadhaar_number] = citizen_data def lookup(self, aadhaar_number): """O(1) lookup""" return self.database.get(aadhaar_number, "Not found")

aadhaar_db = AadhaarDB()
aadhaar_db.register(123456789012, {"name": "Priya", "city": "Bangalore"})
print(aadhaar_db.lookup(123456789012))

# Hindi-English dictionary
hindi_english = { "नमस्ते": "Hello", "धन्यवाद": "Thank you", "कृपया": "Please", "बहुत अच्छा": "Very good"
}

# O(1) lookup
print(hindi_english.get("नमस्ते"))  # Output: Hello

Under the Hood: Hash Tables: O(1) Lookup Magic

Here is what separates someone who merely USES technology from someone who UNDERSTANDS it: knowing what happens behind the screen. When you tap "Send" on a WhatsApp message, do you know what journey that message takes? When you search something on Google, do you know how it finds the answer among billions of web pages in less than a second? When UPI processes a payment, what makes sure the money goes to the right person?

Understanding Hash Tables: O(1) Lookup Magic gives you the ability to answer these questions. More importantly, it gives you the foundation to BUILD things, not just use things other people built. India's tech industry employs over 5 million people, and companies like Infosys, TCS, Wipro, and thousands of startups are all built on the concepts we are about to explore.

This is not just theory for exams. This is how the real world works. Let us get into it.

Database Design: Normalisation and Relationships

Good database design prevents data duplication and inconsistency. This is called normalisation. Consider an e-commerce database:

-- BAD design (denormalised — data repeated everywhere)
-- If customer moves city, you must update EVERY order row!

-- GOOD design (normalised — each fact stored once)
CREATE TABLE customers ( id SERIAL PRIMARY KEY, name TEXT NOT NULL, email TEXT UNIQUE, city  TEXT
);

CREATE TABLE products ( id SERIAL PRIMARY KEY, name  TEXT NOT NULL, price DECIMAL(10,2), category TEXT
);

CREATE TABLE orders ( id SERIAL PRIMARY KEY, customer_id INTEGER REFERENCES customers(id), product_id  INTEGER REFERENCES products(id), quantity INTEGER, order_date  TIMESTAMP DEFAULT NOW()
);

-- JOIN to reconstruct the full picture
SELECT c.name, p.name AS product, o.quantity, (p.price * o.quantity) AS total
FROM orders o
JOIN customers c ON o.customer_id = c.id
JOIN products p ON o.product_id = p.id
WHERE o.order_date > '2025-01-01';

The REFERENCES keyword creates a foreign key — a link between tables. This is a relational database: data is stored in related tables, and JOINs combine them. The tradeoff: normalised databases are consistent and space-efficient, but JOINs can be slow on very large datasets. This is why companies like Flipkart use a mix of SQL databases (for transactions) and NoSQL databases like MongoDB or Cassandra (for product catalogs and recommendations).

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.

Algorithm Complexity and Big-O Notation

Big-O notation describes how an algorithm's performance scales with input size. This is THE most important concept for coding interviews:

  BIG-O COMPARISON (n = 1,000,000 elements): O(1) Constant 1 operation Hash table lookup O(log n) Logarithmic  20 operations Binary search O(n) Linear 1,000,000 ops Linear search O(n log n)  Linearithmic 20,000,000 ops Merge sort, Quick sort O(n²) Quadratic 1,000,000,000,000 Bubble sort, Selection sort O(2ⁿ) Exponential  ∞ (universe dies) Brute force subset Time at 1 billion ops/sec: O(n log n): 0.02 seconds ← Perfectly usable O(n²): 11.5 DAYS ← Completely unusable! O(2ⁿ): Longer than the age of the universe # Python example: Merge Sort (O(n log n)) def merge_sort(arr): if len(arr) <= 1: return arr mid = len(arr) // 2 left = merge_sort(arr[:mid]) # Sort left half right = merge_sort(arr[mid:]) # Sort right half return merge(left, right) # Merge sorted halves def merge(left, right): result = [] i = j = 0 while i < len(left) and j < len(right): if left[i] <= right[j]: result.append(left[i]); i += 1 else: result.append(right[j]); j += 1 result.extend(left[i:]) result.extend(right[j:]) return result

This matters in the real world. India's Aadhaar system must search through 1.4 billion biometric records for every authentication request. At O(n), that would take seconds per request. With the right data structures (hash tables, B-trees), it takes milliseconds. The algorithm choice is the difference between a working system and an unusable one.

Production Engineering: Hash Tables: O(1) Lookup Magic at Scale

Understanding hash tables: o(1) lookup magic 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 hash tables: o(1) lookup magic 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