Given an array of integers arr, and three integers a, b, and c, return the number of good triplets.

A triplet (arr[i], arr[j], arr[k]) is defined as good if the following conditions are satisfied:

• $0 \leq i < j < k <$ arr.length

• $|$arr[i] $-$ arr[j]$| \leq$ a

• $|$arr[j] $-$ arr[k]$| \leq$ b

• $|$arr[i] $-$ arr[k]$| \leq$ c

Constraints:

• $3 \leq$ arr.length $\leq 100$

• $0 \leq$ arr[i] $\leq 1000$

• $0 \leq$ a, b, c $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.