This Kata – http://www.codewars.com/kata/maximum-multiple/train/python is quite easy but I personally made it more complicated because I am not somehow skilled in math. This is a reason why I provide my solution (which is short but not ideal when you consider performance) and best solution (which is even shorter and more effective). I want to be completely honest with my skills so I do not lie that I have not made a perfect solution.
Given a Divisor and a Bound , Find the largest integer N , Such That ,
- N is divisible by divisor
- N is less than or equal to bound
- N is greater than 0.
The parameters (divisor, bound) passed to the function are only positve values .
It’s guaranteed that a divisor is Found .
Input >> Output Examples
1- maxMultiple (2,7) ==> return (6)
(6) is divisible by (2) , (6) is less than or equal to bound (7) , and (6) is > 0 .
2- maxMultiple (10,50) ==> return (50)
(50) is divisible by (10) , (50) is less than or equal to bound (50) , and (50) is > 0 .*
3- maxMultiple (37,200) ==> return (185)
(185) is divisible by (37) , (185) is less than or equal to bound (200) , and (185) is > 0 .
My solution (not ideal)
def max_multiple(divisor, bound): return max(x for x in range(0, bound+1) if x%divisor == 0) print(max_multiple(5,23))
def max_multiple(divisor, bound): return bound - (bound % divisor)