Memoize II — LeetCode 2630 Python Solution
HardJavaScript
- Problem
- #2630
- 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
- getInputs = () => [[2,2],[2,2],[1,2]]
- Output
- [{"val":4,"calls":1},{"val":4,"calls":1},{"val":3,"calls":2}]
- Explanation
- const inputs = getInputs();
Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(1) to O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 2630. Memoize II?
- LeetCode 2630. Memoize II is rated Hard on LeetCode.
- What topics does LeetCode 2630. Memoize II cover?
- LeetCode 2630. Memoize II is tagged JavaScript on LeetCode.