Given an array of distinct integers and a target value, count the total number of unique triplets (i, j, k) such that arr[i] + arr[j] + arr[k] < target.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.