Happy number
A happy number repeatedly replaced by the sum of the squares of its digits eventually reaches 1. Return whether n is happy.
Implement
is_happy(n: int) → boolExamples
in
[19]outtrueWhat 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 15 min
solution.py
InputExpectedGot
[19]truenot run yetsample