| https://leetcode.com/problems/count-good-triplets/description/ | Easy |
|---|
class Solution {
fun countGoodTriplets(arr: IntArray, a: Int, b: Int, c: Int): Int {
var count = 0
for (i in 0 until arr.size) {
for (j in i + 1 until arr.size) {
for (k in j + 1 until arr.size) {
if (Math.abs(arr[i] - arr[j]) <= a &&
Math.abs(arr[j] - arr[k]) <= b &&
Math.abs(arr[i] - arr[k]) <= c) {
count++
}
}
}
}
return count
}
}