[Algorithms] Two Sum Pattern

Question

Problem Statement for Two Sum Pattern under Algorithms:

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

Input Constraints:
- 1 <= len(nums) <= 10^5
- Elements fit in memory standard spaces.

Accepted Answer

```
def twoSum(nums, target):
    seen = {}
    for i, num in enumerate(nums):
        remaining = target - num
        if remaining in seen:
            return [seen[remaining], i]
        seen[num] = i
    return []
```

[Algorithms] Two Sum Pattern

Problem Statement

Proposed Solution

Your Progress

Save Progress?