1534. Count Good Triplets
Given an array of integers arr, and three integers a, b and c. You need to find the number of good triplets. A triplet (arr[i], arr[j], arr[k]) is good if the following conditions are true: - 0 <= i < j < k < arr.length - |arr[i] - arr[j]| <= a - |arr[j] - arr[k]| <= b - |arr[i] - arr[k]| <= c Where |x| denotes the absolute value of x. Return the number of good triplets. Example 1
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start