Given two large or small numbers, the task is to find the last digit of the product of these two numbers.
Input: a = 1234567891233789, b = 567891233156156 Output: 4 Input: a = 123, b = 456 Output: 8
Approach: In general, the last digit of multiplication of 2 numbers a and b is the last digit of the product of the LSB of these two numbers.
For example: For a = 123 and b = 456,
the last digit of a*b
= Last digit of ((LSB of a)*(LSB of b))
= Last digit of ((3)*(6))
= Last digit of (18)
Below is the implementation of the above approach:
Time Complexity: O(1).
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Find Last Digit of a^b for Large Numbers
- Print all K digit repeating numbers in a very large number
- First digit in product of an array of numbers
- Largest palindrome which is product of two N-digit numbers : Set 2
- Largest palindrome which is product of two n-digit numbers
- Check if all sub-numbers have distinct Digit product
- Check whether a number can be expressed as a product of single digit numbers
- Recursive sum of digit in n^x, where n and x are very large
- Count of Numbers in Range where first digit is equal to last digit of the number
- Count numbers in a range with digit sum divisible by K having first and last digit different
- Count n digit numbers not having a particular digit
- Product of N with its largest odd digit
- Digit - Product - Sequence
- GCD of two numbers when one of them can be very large
- LCM of two large numbers
- Sum of two large numbers
- Maximum number with same digit factorial product
- Divisible by 37 for large numbers
- Difference of two large numbers
- Remainder with 7 for large numbers
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.