Skip to content

Instantly share code, notes, and snippets.

@igmarin
Last active January 4, 2024 20:15
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save igmarin/83fef20a961ae86f96ac2c25ec385fc6 to your computer and use it in GitHub Desktop.
Save igmarin/83fef20a961ae86f96ac2c25ec385fc6 to your computer and use it in GitHub Desktop.
Interview Exercise1

Instructions

Your task is to convert a number into a string that contains raindrop sounds corresponding to certain potential factors. A factor is a number that evenly divides into another number, leaving no remainder. The simplest way to test if a number is a factor of another is to use the modulo operation.

The rules of raindrops are that if a given number:

  • has 3 as a factor, add 'Pling' to the result.
  • has 5 as a factor, add 'Plang' to the result.
  • has 7 as a factor, add 'Plong' to the result.
  • does not have any of 3, 5, or 7 as a factor, the result should be the digits of the number.

Examples

  • 28 has 7 as a factor, but not 3 or 5, so the result would be "Plong".
  • 30 has both 3 and 5 as factors, but not 7, so the result would be "PlingPlang".
  • 34 is not factored by 3, 5, or 7, so the result would be "34".
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment