Answer: Flipkart OA Question 2024 July | Two Pointers | on-campus

Solution: 3Sum — Sort and Two Pointers Approach We use Sorting + Two Pointers. Sorting enables us to efficiently skip duplicates and use two pointers to find pairs that sum to a target: Sort the array. Fix each element nums[i] as the first element of the triplet. Use two pointers left = i + 1 and right = n - 1 to find pairs that sum to -nums[i]. Skip duplicate values of nums[i], nums[left], and nums[right] to avoid duplicate triplets. ...