Skip to main content

Can you explain how React’s reconciliation algorithm works? What are keys in React, and why are they important?

 🔄 React’s Reconciliation Algorithm

Reconciliation is the process React uses to determine how the UI should change in response to new state or props. When your component renders, React builds a virtual DOM (a lightweight copy of the real DOM), and when the state or props change, React creates a new virtual DOM and compares it to the previous one.

React uses a diffing algorithm to find the minimal set of changes needed to update the real DOM efficiently.

How does React’s useMemo hook help performance, and what are the common mistakes when using it?

Key principles:

  1. Assumes trees of the same type will result in similar output.

  2. Diffs elements of the same level in the tree.

  3. Recursively updates children, only if the parent type is the same.

  4. Uses keys to optimize list updates (more on that below!).

Example:

<ul> <li>Apple</li> <li>Banana</li> </ul>

If you change it to:

<ul> <li>Banana</li> <li>Apple</li> </ul>

React doesn’t blindly re-render everything. It tries to reuse as much of the existing DOM as possible. However, without keys, it may remove and recreate both <li> elements even if they just swapped.

🔑 What Are Keys in React?

Keys are special string attributes you assign to elements in a list to help React identify which items have changed, been added, or removed.

{items.map(item => ( <li key={item.id}>{item.name}</li> ))}

Why are keys important?

  • Efficiency: Helps React avoid unnecessary DOM manipulations.

  • Identity: Lets React uniquely identify each element, so it can preserve component state between renders.

  • Stability: Avoids bugs that can occur when components are mistakenly re-created instead of updated.

Bad practice:

Using the index as a key is okay only when the list never changes order or length.

// ❌ Not ideal if list changes {items.map((item, index) => ( <li key={index}>{item.name}</li> ))}

TL;DR

  • Reconciliation: React compares old and new virtual DOMs to update only what's necessary.

  • Keys: Help React match elements between renders for optimal performance and accurate updates.

Let me know if you want a visual example or a deep dive into how the diffing algorithm works under the hood!

Popular posts from this blog

How does BGP prevent routing loops? Explain AS_PATH and loop prevention mechanisms.

 In Border Gateway Protocol (BGP), preventing routing loops is critical — especially because BGP is the inter-domain routing protocol used to connect Autonomous Systems (ASes) on the internet. 🔄 How BGP Prevents Routing Loops The main mechanism BGP uses is the AS_PATH attribute . 🔍 What is AS_PATH? AS_PATH is a BGP path attribute that lists the sequence of Autonomous Systems (AS numbers) a route has traversed. Each time a route is advertised across an AS boundary, the local AS number is prepended to the AS_PATH. Example: If AS 65001 → AS 65002 → AS 65003 is the route a prefix has taken, the AS_PATH will look like: makefile AS_PATH: 65003 65002 65001 It’s prepended in reverse order — so the last AS is first . 🚫 Loop Prevention Using AS_PATH ✅ Core Mechanism: BGP routers reject any route advertisement that contains their own AS number in the AS_PATH. 🔁 Why It Works: If a route makes its way back to an AS that’s already in the AS_PATH , that AS kno...

What’s the impact of BGP full routes on router memory and performance?

Receiving full BGP routes (i.e., the full global BGP routing table) has a significant impact on a router's memory and performance. Here's a breakdown of the key impacts: 🔧 1. Memory Usage (RAM) A full BGP table typically contains ~1 million IPv4 routes and growing (~200k+ IPv6 routes). Each BGP route consumes tens to hundreds of bytes of memory, depending on attributes (AS path, communities, etc.). This translates to hundreds of megabytes to several gigabytes of RAM just for storing the BGP RIB (Routing Information Base). The FIB (Forwarding Information Base) , which is installed into the router's hardware or kernel for actual packet forwarding, also consumes memory (especially in TCAM for hardware routers). ❗ Example A router might require 4–8 GB of RAM (or more) to comfortably handle full BGP routes with headroom for growth and stability. 🧠 2. CPU Utilization High CPU load during: Initial BGP session establishment (parsing all rout...

Explain the OSPF LSDB (Link State Database) and how SPF (Shortest Path First) algorithm works.

OSPF (Open Shortest Path First) is a link-state routing protocol , and the LSDB (Link-State Database) and SPF (Shortest Path First) algorithm are core to how OSPF calculates the best paths . Let’s break them down. 🧠 What is the OSPF LSDB (Link-State Database)? The LSDB is a map of the entire OSPF network area — each router stores a complete topology of its area. 🔍 Details: Built from LSAs (Link-State Advertisements) exchanged between routers. Contains info about: Routers and their interfaces Network segments Neighbor relationships Each OSPF router maintains an identical LSDB within the same area. ✅ Key Characteristics: Feature Description Scope One LSDB per OSPF area Source Built from received LSAs Consistency All routers in an area have identical LSDBs Purpose Used as input for SPF algorithm to calculate best paths ⚙️ How the SPF Algorithm Works in OSPF OSPF uses Dijkstra’s Shortest Path First (SPF) algorithm to compute the shortest (lowest-cost)...