Memoization

Memoization is an optimization technique used to speed up function calls by caching the results of expensive function calls and returning the cached result when the same inputs occur again.

Implement a memoization function that takes a function as an argument and returns a memoized version of that function. The memoized function should cache the results based on the arguments passed to it.

Example Inputs & Outputs

// Example 1: 
function expensiveFunction(a, b) {
    return a + b;
}
const memoizedExpensiveFunction = memoize(expensiveFunction);
console.log(memoizedExpensiveFunction(1, 2)); // Output: 3 (calculated)
console.log(memoizedExpensiveFunction(1, 2)); // Output: 3 (cached)

// Example 2: 
function factorial(n) {
    if (n <= 1) return 1;
    return n * factorial(n - 1);
}
const memoizedFactorial = memoize(factorial);
console.log(memoizedFactorial(5)); // Output: 120 (calculated)
console.log(memoizedFactorial(5)); // Output: 120 (cached)

Constraints & Edge Cases

• The function to be memoized can have any number of arguments.
• The memoized function should handle different argument types (numbers, strings, objects, etc.).

This challenge tests understanding of closures, caching, and function optimization in JavaScript. The solution efficiently caches results while handling various argument types and edge cases. 🚀