Programmer Analyst Trainee

There was a code given and i need found out the errors in the code and correct that code and submit it. Note: similar like this there were 5 to 6 questions

 #include int main(){  

  int num, LD;  

  printf(" Enter a number"4589);  

  scanf("%d", &num); 

   LD = num / 10;

     printf(" \n The Last Digit of a Given Number %d =  %d", num, LD);  

  return 0;}

Example 2 :
void palindrome(int number)
{
int rev = 0,store, n1,left;
n1=number;
store= number;
while (number > 0)
{
left= number/10;
rev = rev + 10 * left;
number=number%10;
}
if(n1==rev)
printf("Number %d is Palindrome number",n1);
else
printf("it is not a Palindrome number");
}

Example 3:
int sumOfValue(int len, int* arr, int value)
{
int sum = 0;
for(int i =0 ; i < len; i++ )
{
if(arr[i]%value == 0) 
sum =+ arr[i];
}
return sum;
}

You are given an integer ‘NUM’ . Your task is to find out whether this number is an Armstrong number or not.

A k-digit number ‘NUM’ is an Armstrong number if and only if the k-th power of each digit sums to ‘NUM’.

Example

153 = 1^3 + 5^3 + 3^3.

Therefore 153 is an Armstrong number.

You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignore the symbols and whitespaces.

Note :

String 'S' is NOT case sensitive.

Example :

Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.

You are given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.

Since the answer can be very large, return the answer modulo 10^9 +7.

Fibonacci number is calculated using the following formula:

F(n) = F(n-1) + F(n-2), 
Where, F(1) = F(2) = 1.

For Example:

For ‘N’ = 5, the output will be 5.