EasyNo. 2620
Counter — LeetCode 2620 Python Solution
- Topics
- JavaScript
- 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
- Time
- O(n)
- Space · auxiliary
- O(1) to O(n)
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0057 | Insert Interval | Medium |
| 0192 | Word Frequency | Medium |
| 0193 | Valid Phone Numbers | Easy |
| 0194 | Transpose File | Medium |
| 0195 | Tenth Line | Easy |
| 0228 | Summary Ranges | Easy |
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.