Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

You are given an array where each element represents your maximum jump length at that position. Determine if you can reach the last index starting from the first index.

You're given an array that's supposedly a doubled version of another array. Your task is to reconstruct the original array from this doubled array, if possible.