While solving fabonocci problem using recursion and memoization in JavaScript, I got “Maximum Call Stack Exceeded” error when I try to run it with large inputs. To troubleshoot, I copied the solution from GeeksforGeeks (GFG) and that works correctly. However, I’m struggling to understand why my approach fails.