How should I practice Target Triplet Sum?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Motive onsite interview problems in FastPrep.

Is Target Triplet Sum associated with Motive?

FastPrep tags this as a Motive onsite interview coding practice problem when the problem catalog has that company and stage context.

Target Triplet Sum

Motive● MediumFULLTIMEONSITE INTERVIEW

Learn

Problem statement

Given an integer array nums and an integer target, return whether three distinct indices have values whose sum equals target.

Your algorithm may reorder nums, but it must use only constant auxiliary space apart from the sorting implementation's call stack.

Function

hasTargetTriplet(nums: int[], target: int) → boolean

Examples

Example 1

nums = [12,3,4,1,6,9]target = 24return = true

The values 12, 3, and 9 sum to 24.

Example 2

nums = [1,2,4,8]target = 20return = false

No three distinct indices produce 20.

Constraints

0 <= nums.length <= 100000.
-10^9 <= nums[i], target <= 10^9.