Leetcode #202: Happy Number

This problem can be solved using recursion. Thought process: Base case: Check if the number is 1. -OR- If the loop has been going on for a while. Split the digits and sum it up (square of each digit) Call the loop again until the value reaches 1 or...