Frédéric G. MARAND 8ac99831ee 03 Raindrops. | 9 months ago | |
---|---|---|
.. | ||
.exercism | 9 months ago | |
HELP.md | 9 months ago | |
README.md | 9 months ago | |
Raindrops.php | 9 months ago | |
RaindropsTest.php | 9 months ago |
Welcome to Raindrops on Exercism's PHP Track.
If you need help running the tests or submitting your code, check out HELP.md
.
Raindrops is a slightly more complex version of the FizzBuzz challenge, a classic interview question.
Your task is to convert a number into its corresponding raindrop sounds.
If a given number:
"Plong"
."PlingPlang"
.34 is not divisible by 3, 5, or 7, so the result would be "34"
.
A common way to test if one number is evenly divisible by another is to compare the [remainder][remainder] or [modulus][modulo] to zero.
Most languages provide operators or functions for one (or both) of these.
[remainder]: https://exercism.org/docs/programming/operators/remainder
[modulo]: https://en.wikipedia.org/wiki/Modulo_operation
A variation on FizzBuzz, a famous technical interview question that is intended to weed out potential candidates. That question is itself derived from Fizz Buzz, a popular children's game for teaching division. - https://en.wikipedia.org/wiki/Fizz_buzz