Skip to content

Latest commit

 

History

History
30 lines (17 loc) · 949 Bytes

HappyNumbers.md

File metadata and controls

30 lines (17 loc) · 949 Bytes

HappyNumbers

Difficulty Tags Solution Link
Medium [Integers, Primes] To Do

Problem Description

A happy number is defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits in base-ten, and repeat the process until the number either equals 1 (where it will stay), or it loops endlessly in a cycle that does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that do not end in 1 are unhappy numbers (or sad numbers).

Source: Wikipedia

Write a function that determines if a number is happy.

Sample

Example: 19 is a happy number

12 + 92 = 82

82 + 22 = 68

62 + 82 = 100

12 + 02 + 02 = 1

Input Output
19 true