Descending Counter Repeated
EasyP3Coding
Count down from n to 1, and do that whole countdown n times in a row. Return every value shown, in order. For n = 3 the answer is [3, 2, 1, 3, 2, 1, 3, 2, 1].
Example 1
- Input
- n = 3
- Output
- [3,2,1,3,2,1,3,2,1]
Example 2
- Input
- n = 1
- Output
- [1]
Example 3
- Input
- n = 2
- Output
- [2,1,2,1]
Constraints
- 1 <= n <= 100
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 8. ⌘Enter runs, ⌘⇧Enter submits.