Pursuant to the first problem in this series, this one involves checking for divisibility by 10.
Write a function to determine if a number is divisible by 10. This can be done by checking if the last digit is zero.
Previous problem: divisible by 9. Next problem: divisible by 11.
477 Solvers
Reverse the Words (not letters) of a String
228 Solvers
Project Euler: Problem 7, Nth prime
301 Solvers
Getting the indices from a vector
1013 Solvers
208 Solvers