Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the condition nums[i] + nums[j] + nums[k] < target.
n
nums
target
i
j
k
0 <= i < j < k < n
nums[i] + nums[j] + nums[k] < target
Need help or want more practice?