How should I practice Two Sum?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Akuna Capital online assessment problems in FastPrep.

Is Two Sum associated with Akuna Capital?

FastPrep tags this as a Akuna Capital online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Two Sum

Learn this problem

● Easy

Akuna CapitalNEW GRADOA

Problem statement

Given an integer array nums and an integer target, return any pair of indices [i, j] such that i < j and nums[i] + nums[j] = target.

If several valid pairs exist, you may return any one of them. If no valid pair exists, return [-1, -1].

Function

twoSum(nums: int[], target: int) → int[]

Examples

Example 1

nums = [2,7,11,15]target = 9return = [0,1]

nums[0] + nums[1] = 2 + 7 = 9, and 0 < 1.

Example 2

nums = [1,2,3]target = 7return = [-1,-1]

No pair of distinct indices has values that sum to 7.

Constraints

1 <= nums.length <= 10^5.
-10^9 <= nums[i] <= 10^9.
-10^9 <= target <= 10^9.