Program to find Last Digit of given number - C/C++/Java

Finding the Last digit of a number helps us in solving lots of problems.
The video explains how to find the last digit of a number using the modulo operator.
Aiming to get placed in IT/Software companies. Get your Dream Job with PrepBytes Placement Program.
Get Mentorship, Video Lectures, Doubt Sessions, Mock Tests, Mock Interviews all in one program.

Want a daily dose of Coding/Technical MCQs/Aptitude?

[_chandikagiri]

I am watching this channel first time today and I loved it. When I find such tutorials I never need bothering textbooks. Thank you, ma'am.

[bhartiverma]

Thank you man and the way of your teaching is excellent

[mformobileapps]

Glad that found such type of ossm content...

[pcanaskouhlani]

i appreciate the hardwork
But you can solve it just with 2 lines (python programm):

num = input("your number")
print(num[len(num)-1])

much easier isn't it.

[girrajsharma]

excellent explaination thanx ma'me...
I have a questions...Is your payed videos are live or anytime watching

[dikshajain]

wap to input 8 no.s in an integer array and print those no.s whose last digit is perfect no.

[murkish]

nothing more than a coding teacher at 3 am to help me lol

[shabeerrafi]

what if the number has 12 digits? how to find the last digit?

[arunlachheta]

i am asking how to see the solution of prepbyte practice question there is no any hint or comment

[dikshajain]

write a program to input 10 numbers in an array and print the 3 digit numbers entered by the user

write a program to initialize the array with first 10 multiples of 3 starting with 9 and the even multiples of 3

wap to store first 10 fibonacci numbers in an array starting from zero also count the number of prime fibonacci numbers

wap to input 10 integers in an array (-ve or +ve) print the smallest and largest integers entered by the user

wap to store 10 positive integers in an array input another number 'n' in form of the user amd check how many times its present in the array

wap to store first 10 prime nos entered by the user in an array and print them

wap to input 10 numbers in an array and print the frequency of each number

wap to store 10 integers in an array (both positive as well as negative) and shift positive integers towards right and negative integers towards left part of the array

wap to input 10 no.s in an array and print the numbers in ascending order without using any sorting technique