Remainders Modulo 10 up to N
EasyP3Coding
Return i % 10 for every i from 1 to n, in order. For n = 12 the answer starts 1, 2, ..., 9, 0, 1, 2.
Example 1
- Input
- n = 12
- Output
- [1,2,3,4,5,6,7,8,9,0,1,2]
Example 2
- Input
- n = 1
- Output
- [1]
Example 3
- Input
- n = 9
- Output
- [1,2,3,4,5,6,7,8,9]
Constraints
- 1 <= n <= 10^5
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.