HTML MASTER CLASS /// LEARN TAGS /// BUILD STRUCTURE /// SEMANTIC WEB /// HTML MASTER CLASS /// LEARN TAGS ///

Untitled Lesson

⚡ Total XP: 0|💻 backend XP: 0

Skill Matrix

UNLOCK NODES BY LEARNING NEW TAGS.

Select an unlocked node to view details root

Pascual Vila

Full-Stack Software and AI Engineer

Full-Stack Software and AI Engineer with 6 years of experience building enterprise-grade web applications across React, Angular, Node.js, and Python. Recently completed a Master's in AI Development specializing in LLMs, RAG, and AI agent architectures, and currently builds enterprise systems that integrate AI and Digital Twins to optimize industrial and logistics processes.

LinkedIn ↗

Common Pitfalls & Errors

The Error //

Assuming a slow endpoint is I/O-bound (and optimizing the database query) without first confirming it via CPU usage or a profile

// Cheap first check to avoid wasted effort
const usage = process.cpuUsage();
// High and sustained CPU usage during the slow request points CPU-bound
// Low CPU usage during a slow request points I/O-bound instead

The Solution //

Optimizing the wrong category of bottleneck wastes significant investigation and engineering time with no improvement to show for it. Check system-level CPU usage first (a quick, cheap signal) before assuming the cause and diving into a specific optimization.

The Error //

Using a regular expression with nested quantifiers against unvalidated, potentially long user input

// Dangerous: vulnerable to catastrophic backtracking
const regex = /(a+)+b/;

// Safer: avoid the nested quantifier structure entirely
const regex = /a+b/; // linear time, no backtracking explosion

The Solution //

Certain regex patterns exhibit catastrophic exponential-time backtracking against specific adversarial inputs, effectively creating a denial-of-service vector if reachable with user-controlled input — a single malicious request can hang the event loop for an extremely long time. Avoid nested quantifiers in patterns that process user input, and consider a regex complexity linter or a dedicated validation library.