Skip to main content

3Sum Smaller

Medium
Data Structures and Algorithms
Editorial
Topics:
Array
Two Pointers
Binary Search

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.

Need help or want more practice?

Practise in an interviewGet AI Coach help