Write an algorithm to select the number between min and maximum from a number series and that number shouldn't be a multiple of 10

Question

Accepted Answer

Algorithm to select a non-multiple of 10 from a number series between min and max

Loop through the number series from min to max
Check if the current number is a multiple of 10
If not, select the number and exit the loop
If all numbers are multiples of 10, return an error message

Accepted Answer

Initialize a variable, say ‘reversedNumber’ = 0.
Multiply the reversed number by 10, add the remainder of the original number divided by 10 to ‘reversedNumber’.
i.e., reversedNumber = (reversedNumber) * 10 + (OriginalNumber) % 10
Divide the original number by 10.
Here, in this step the value of the original number gets updated by dividing it by 10. This will remove the last digit of the original number at each iteration and will terminate the loop once the value of the original number equals 0.
     cy and Cookie Policy.	OK

Shiksha Online
Search Icon
twitterlinkedinfacebook
 › IT & Software › IT & Software Articles › Programming Articles › How to Reverse a Number in C
Share
How to Reverse a Number in C
3 mins read
420
Comment
Share
Vikram
Vikram Singh
Assistant Manager - Content
Updated on Jun 10, 2024 11:51 IST
This article will discuss how to reverse a number in C programming using while loop, for loop, and recursion method.

2023_08_Feature-Image-Templates-90.jpg
In the programming world, we learn different concepts and methods to master it. One such concept is reversing a number. At first, it looks simple, but it can be quite tricky. So, in this article, we will learn how to reverse a number in C programming with the help of different examples.

When we talk about reversing a number, it means changing its order, i.e., If you have a number 123, then it reverses would be 321.

Now, let’s see how to do this.

Algorithm to Reverse a Number in C
Initialize a variable, say ‘reversedNumber’ = 0.
Multiply the reversed number by 10, add the remainder of the original number divided by 10 to ‘reversedNumber’.
i.e., reversedNumber = (reversedNumber) * 10 + (OriginalNumber) % 10
Divide the original number by 10.
Here, in this step the value of the original number gets updated by dividing it by 10. This will remove the last digit of the original number at each iteration and will terminate the loop once the value of the original number equals 0.
Now, let’s reverse the number 123 by using the above algorithm.

Number = 123
reversedNumber = 0
reversedNumber = reversedNumber * 10 + Number % 10 = 0 * 10 + 123 % 10 = 3
Number = Number/ 10 = 12
reversedNumber = reversedNumber * 10 + Number % 10 = 3 * 10 + 12 % 10 = 32
Number = Number/ 10 = 1
reversedNumber = reversedNumber * 10 + Number % 10 = 32 * 10 + 1 % 10 = 321
Number = Number/10 = 0.

Write an algorithm to select the number between min and maximum from a number series and that number shouldn't be a multiple of 10

Top JPMorgan Chase & Co. Associate interview questions & answers

Popular interview questions of Associate

Top HR questions asked in JPMorgan Chase & Co. Associate