LeetCode Q 202 - Happy NumberWrite an algorithm to determine if a number is “happy”. A happy number is a number defined

LeetCode Q 204 - Count PrimesCount the number of prime numbers less than a non-negative number, n. Example: Input: 10 ;

LeetCode Q 836 - Rectangle OverlapA rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) are the coordina

LeetCode Q 43 - Multiply StringsGiven two non-negative integers num1 and num2 represented as strings, return the product

LeetCode Q 69 - Sqrt(x)Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a

LeetCode Q 50 - Pow(x, n)Implement pow(x, n), which calculates x raised to the power n. Example 1: Input: 2.00000, 10 ;