Divisible by K
EasyP3Coding
Return, in increasing order, all integers from 1 to n that are divisible by k. Return an empty array if there are none.
Example 1
- Input
- n = 10, k = 3
- Output
- [3,6,9]
Example 2
- Input
- n = 10, k = 1
- Output
- [1,2,3,4,5,6,7,8,9,10]
Example 3
- Input
- n = 5, k = 7
- Output
- []
Constraints
- 1 <= n <= 10^5
- 1 <= k <= 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.