Search

Lessons (18)

• Trees & Binary Search Trees

  … Databases use B-trees , wide trees with many keys per node, so a lookup touches only 3–4 …

• Structural Patterns: How to Connect Objects

  … Flyweight 🌲 Analogy: A video game forest with 100,000 trees. Every oak shares one 3D model and texture …

• Data Structures for Scale

  … are two sets? Approximate similarity Merkle tree Which replicated blocks differ? Tree maintenance Use an approximation only where …

• Storage Engines & Database Operations

  Understand B-trees, LSM trees, write-ahead logs, connection pools, backups and the signals behind database reliability. What …

• How Browsers Render a Page

  … Combine them into a plan of what's actually visible ( render tree ). 4. Measure where every wall goes …

• Database Indexing & Transactions

  … Learn how B-tree indexes work, how to read a query plan, and how isolation levels prevent concurrency …

• Database Internals, Replication and Scaling

  … LSM trees turn writes into sequential files, then compact them; they trade read amplification and compaction work for …

• Heaps & Priority Queues

  … 2. Shape rule: the tree is complete : filled level by level, left to right, with no gaps. (A …

• Recursion & Backtracking

  … sum of nested arrays Recursion shines when the data itself is recursive (trees, nested lists, folders, JSON). js …

• React Fundamentals

  … When the data changes, React updates the screen for you. ![A page broken into a tree of components …

• Indexes, EXPLAIN & Query Plans

  … A B-tree index keeps selected values ordered so it can seek to a small matching range. The …

• DSA Interview Patterns Cheat Sheet

  … SW[Sliding window / Prefix sums] B -- no C{Tree or graph?<br/ grid, network, dependencies} C -- shortest path …

• Which Pattern Do I Need?

  … access, cache,<br/ lazy-load"] -- PR[Proxy] P8["Tree of items and groups"] -- CO[Composite] P9["Many things …

• React vs Vue vs Angular

  … fine-grained updates with no memoisation. - Angular historically checked the whole tree after every event (zone.js); modern …

• Binary Search

  … solves many minimum/maximum that works problems. - git bisect and database B-tree indexes use the same idea.

• Graphs: BFS & DFS

  … B --- D((Mall)) C --- D D --- E((Airport)) Trees are a special case of graphs (connected, no cycles …

• Sorting Algorithms

  … The array is halved log n times (the tree's height), and each level does O(n) merging …

• Next.js Rendering: CSR, SSR, SSG, ISR & Server Components

  … buttons, forms, animations 💡 Keep client components small and at the leaves of the tree. The more stays on …