Count Good Triplets — C# Coding Problem
Difficulty: medium | Category: array
Problem Description
Given an array of integers `arr` and three integers `a`, `b`, `c`, find all the **good triplets**. A triplet `(arr[i], arr[j], arr[k])` is good if: - `0 <= i < j < k < arr.length` - `|arr[i] - arr[j]| <= a` - `|arr[j] - arr[k]| <= b` - `|arr[i] - arr[k]| <= c` Return the **number** of good triplets.
Examples
Example 1
Input: arr = [3,0,1,1,9,7], a = 7, b = 2, c = 3
Output: 4
Example 2
Input: arr = [1,1,2,2,3], a = 0, b = 0, c = 1
Output: 0