Harshad numbers
Count how many integers in the inclusive range [1, n] are divisible by their own digit sum (Harshad / Niven numbers). For example 12 qualifies because 12 is divisible by 1+2=3. Constraints: 1 <= n <= 200000. Return the count.
Implement
count_harshad(n: int) → intExamples
in
[12]out11What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[12]11not run yetsample