easyHash TableMathTwo Pointers 0 views
Happy Number
Write an algorithm to determine if a number n is happy.
Write an algorithm to determine if a number n is happy.
A happy number is a number defined by the following process:
Return true if n is a happy number, and false if not.
Example 1
Input: n = 19
Output: true
Explanation: 12 + 92 = 82 82 + 22 = 68 62 + 82 = 100 12 + 02 + 02 = 1
Example 2
Input: n = 2
Output: false
Constraints
- 1 <= n <= 231 - 1
Hints
No hints yet.
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.