EasyNo. 2666
Allow One Function Call — LeetCode 2666 Python Solution
- Topics
- JavaScript
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given a function fn, return a new function that is identical to the original function except that it ensures fn is called at most once. The first time the returned function is called, it should return the same result as fn.
Example
- Input
- fn = (a,b,c) => (a + b + c), calls = [[1,2,3],[2,3,6]]
- Output
- [{"calls":1,"value":6}]
- Explanation
- const onceFn = once(fn);
Complexity
- Time
- O(n)
- Space · auxiliary
- O(1) to O(n)
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 2672 | Number of Adjacent Elements With the Same Color | Medium |
| 0057 | Insert Interval | Medium |
| 0192 | Word Frequency | Medium |
| 0193 | Valid Phone Numbers | Easy |
| 0194 | Transpose File | Medium |
| 0195 | Tenth Line | Easy |
Frequently asked questions
- How hard is LeetCode 2666. Allow One Function Call?
LeetCode 2666. Allow One Function Call is rated Easy on LeetCode.
- What topics does LeetCode 2666. Allow One Function Call cover?
LeetCode 2666. Allow One Function Call is tagged JavaScript on LeetCode.