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:

  • is divisible by 3, add "Pling" to the result.
  • is divisible by 5, add "Plang" to the result.
  • is divisible by 7, add "Plong" to the result.
  • is not divisible by 3, 5, or 7, the result should be the number as a string.


  • 28 is divisible by 7, but not 3 or 5, so the result would be "Plong".
  • 30 is divisible by 3 and 5, but not 7, so the result would be "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 or modulus to zero. Most languages provide operators or functions for one (or both) of these.

Your awk program

The tests invoke your program with gawk, passing a value into an awk variable, but providing no filenames or redirected input. You'll need to implement the logic inside the BEGIN block.

Edit via GitHub The link opens in a new window or tab
AWK Exercism

Ready to start Raindrops?

Sign up to Exercism to learn and master AWK with 71 exercises, and real human mentoring, all for free.

Deep Dive into Raindrops!

Explore solutions using functional pipelines, matrix multiplication, a precalculated table-based solutions using a macro, an Object Oriented approach, some impressive use of both Python and TCL, and an enterprise edition.