Memoize — LeetCode 2623 Python Solution
MediumJavaScript
- Problem
- #2623
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given a function fn, return a memoized version of that function. A memoized function is a function that will never be called twice with the same inputs.
Example
- Input
- fnName = "sum"
- Output
- [4,4,1,3,2]
- Explanation
- const sum = (a, b) => a + b;
Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(1) to O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 2623. Memoize?
- LeetCode 2623. Memoize is rated Medium on LeetCode.
- What topics does LeetCode 2623. Memoize cover?
- LeetCode 2623. Memoize is tagged JavaScript on LeetCode.