Geeksforgeeks

Error

For a given** 3 **digit number, find whether it is armstrong number or not. An **Armstrong number** of three digits is an integer such that the sum of the cubes of its digits is equal to the **number** itself. Return "**Yes**" if it is a armstrong number else return "**No**".

**NOTE: **371 is an **Armstrong number** since 3^{3} + 7^{3 }+ 1^{3} = 371

**Example 1:**

**Input**: N = 153
**Output:** "Yes"
**Explanation**: 153 is an **Armstrong number
**since 1^{3} + 5^{3 }+ 3^{3} = 153.
Hence answer is "Yes".

**Example 2:**

**Input: **N = 370
**Output: **"Yes"
**Explanation**: 370 is an **Armstrong number**
since 3^{3} + 7^{3 }+ 0^{3} = 370.
Hence answer is "Yes".

**Your Task: **

You dont need to read input or print anything. Complete the function **armstrongNumber() **which takes n as input parameter and returns "**Yes**" if it is a armstrong number else returns "**No**"..

**Expected Time Complexity:** O(1)

**Expected Auxiliary Space:** O(1)

**Constraints:**

100 ≤ n <1000

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Armstrong Numbers

...