Two-Sum Problem

Function Name: findTwoSum

Description

Write a function that takes an array of integers and a target integer as its parameters. The function should find two distinct elements in the array that sum up to the given target. The function should return indices of the two numbers such that they add up to the target, where the index of the first number is less than the index of the second number. If no such numbers exist, the function should return null or an equivalent value in your chosen language.

Requirements

• The function must accept two parameters: an array of integers (nums) and a single integer (target).
• If there are multiple pairs that add up to the target, the function can return any one of them.
• The function should return null or an equivalent value if no pair is found.
• Do not use any built-in two-sum functions, you may assume that each input would have exactly one solution, but you may not use the same element twice.
• Optimize the function for a time complexity better than O(n^2) if possible.

Examples

Given nums = [2, 7, 11, 15] and target = 9, the function should return [0, 1] because nums[0] + nums[1] = 2 + 7 = 9.Given nums = [3, 2, 4] and target = 6, the function should return [1, 2].Given nums = [3, 3] and target = 6, the function should return [0, 1].Given nums = [1, 2, 3, 4] and target = 8, the function should return null as there are no two numbers that add up to 8.

Links