Counter — LeetCode 2620 Python Solution
EasyJavaScript
- Problem
- #2620
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given an integer n, return a counter function. This counter function initially returns n and then returns 1 more than the previous value every subsequent time it is called (n, n + 1, n + 2, etc).
Example
- Input
- n = 10
- Output
- [10,11,12]
- Explanation
- counter() = 10 // The first time counter() is called, it returns n.
Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(1) to O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 2620. Counter?
- LeetCode 2620. Counter is rated Easy on LeetCode.
- What topics does LeetCode 2620. Counter cover?
- LeetCode 2620. Counter is tagged JavaScript on LeetCode.