Maximum Call Stack Size Exceeded Error

Ensure recursive functions have a terminating condition.

// ❌ No base case → infinite recursion
function factorial(n) {
  return n * factorial(n - 1)
}

// ✅ With base case
function factorial(n) {
  if (n <= 1) return 1  // Base case
  return n * factorial(n - 1)
}

Replace deep recursion with loops to avoid stack limits.

// ❌ Recursive
function fibonacci(n) {
  if (n <= 1) return n
  return fibonacci(n - 1) + fibonacci(n - 2)
}

// ✅ Iterative
function fibonacci(n) {
  let a = 0, b = 1
  for (let i = 2; i <= n; i++) {
    [a, b] = [b, a + b]
  }
  return b
}

When traversing objects or graphs, track visited nodes to avoid cycles.

function deepClone(obj, visited = new WeakMap()) {
  if (obj === null || typeof obj !== "object") return obj
  
  // ❌ Skip already visited objects to prevent infinite recursion
  if (visited.has(obj)) return visited.get(obj)
  
  const clone = Array.isArray(obj) ? [] : {}
  visited.set(obj, clone)
  
  for (const key of Object.keys(obj)) {
    clone[key] = deepClone(obj[key], visited)
  }
  return clone
}