Problem StatementMisha wants to check and print whether the given number N is a neon number or not. Write a program that uses a function and helps her to complete this task.A neon number is a number where the sum of digits of the square of the number is equal to the number. Function Specifications: int neon(int n)Example 1Input:9Output:9 is a neon numberExplanation:92 = 81, and the sum of its digits (8+1) is equal to the original number (9).Example 2Input:12Output:12 is not a neon numberExplanation:(12)2=144, and the sum of its digits (1+4+4) is not equal to the original number (12).Note: This question helps in clearing technical coding tests for companies like Capgemini.Input format :The input consists of an integer, N.Output format :If N is a neon number, print "[N] is a neon number"Otherwise, print "[N] is not a neon number"

Write a program that checks whether a given integer is a Kaprekar number or not. A Kaprekar number is a number whose square when divided into two parts and such that the sum of the parts is equal to the original number and none of the parts has value 0. Your task is to determine if the given input integer is a Kaprekar number.Examples:9 is a Kaprekar number since 92 = 81 and 8+1 = 9.92 is not a Kaprekar number since 922 = 8464 and 84 + 64 = 148.Input format :The input consists of a single integer, n.Output format :The first line of output prints "Sum: " followed by the sum of two parts of the square of n.The second line prints one of the following:If n is a Kaprekar number, print "[n] is a kaprekar number".If n is not a Kaprekar number, print "[n] is not a kaprekar number".Refer to the sample output for formatting specifications.Code constraints :1 ≤ n ≤ 105Sample test cases :Input 1 :9Output 1 :Sum: 99 is a kaprekar numberInput 2 :92Output 2 :Sum: 14892 is not a kaprekar numberInput 3 :55Output 3 :Sum: 5555 is a kaprekar number

Sum of digitsA function, sumN, is defined that takes an integer n as argument and returns the sum of the integers from 1 through n. Write a C program to determine value of the expression shown below?  sumN(3456) - sumN(3455)Note: the arguments of function sumN() can be obtained from user at runtimeTestcases:Input:18041604Output:2Input:34563455Output:1

A curious young student named Liam stumbled upon a mathematical problem that computes the sum of the squares of its digits.Help Liam compute the result by writing a program using a do-while loop.Note: This question helps in clearing AMCAT exam.Input format :The input consists of a positive integer n.Output format :The output displays the result representing the sum of the squares of its digits.

Single File Programming QuestionProblem StatementArun wants to implement a function to check whether an integer n is an Armstrong number or not using a call-by-reference function. Assist him in completing the program.An Armstrong number is a number that is equal to the sum of its digits each raised to the power of the number of digits.Function Specifications: void checkArmstrong(int *n)Note: This question was asked in companies like Gemini Solution,TCS, Infosys, and Unthinkable Solutions.Input format :The input consists of an integer n.Output format :If n is an Armstrong number, the output prints "Armstrong number".If n is not an Armstrong number, the output prints "Not an Armstrong number".Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ n ≤ 1000Sample test cases :Input 1 :153Output 1 :Armstrong numberInput 2 :29Output 2 :Not an Armstrong numberInput 3 :1Output 3 :Armstrong numberInput 4 :1000Output 4 :Not an Armstrong number

write a program to check whether a number is a special 2-digit number or not. A Special 2-digit number is such that when the sum of its digits is added to the products of its digits the result is equal tot he original 2-digit number