Maximum Factors from 1 to N
EasyP3Coding
Given an integer n, return the number in the range [1, n] that has the most positive divisors. If several numbers tie, return the smallest of them.
Example 1
- Input
- n = 10
- Output
- 6
Example 2
- Input
- n = 1
- Output
- 1
Example 3
- Input
- n = 2
- Output
- 2
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 10. ⌘Enter runs, ⌘⇧Enter submits.