Given an integer n, return true if it is an Armstrong number, or false otherwise.

An integer n is an Armstrong number if the sum of each of its digits raised to the power of $k$ is equal to n, where $k$ is the total number of digits in n.

Constraints:

• $1 \leq$ n $\leq 10^8$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.