mediumStack
Two Number Indices Solution
Problem Statement
You are given an array of integers `nums` and an integer `target`. Return the indices of the two numbers in the array that add up to `target`.
Examples
Example 1:
Input:{"nums":[2,7,11,15],"target":9}
Output:[0,1]
Explanation: Because `nums[0] + nums[1] == 2 + 7 == 9`, we return `[0, 1]`.
Example 2:
Input:{"nums":[3,2,4],"target":6}
Output:[1,2]
Explanation: Because `nums[1] + nums[2] == 2 + 4 == 6`, we return `[1, 2]`.
Example 3:
Input:{"nums":[3,3],"target":6}
Output:[0,1]
Explanation: Because `nums[0] + nums[1] == 3 + 3 == 6`, we return `[0, 1]`.
Time: O(n) Space: O(n)
The optimal approach uses a Hash Table to store the numbers we've seen so far and their indices, allowing us to find the complement of each number in constant time. This results in a time complexity of O(n) and a space complexity of O(n).
Run, Test & Submit Code
Ready to practice this challenge? Launch our interactive compilation environment with compiler validation.
Solve on Interactive WorkspaceTested Solutions
No solution code is currently loaded.
Complete this code in the workspace editor.