3Sum Smaller
Difficulty: Medium
Category: DSA
Topics: Array, Two Pointers, Binary Search, Sorting
Asked at: IBM, Citadel
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.