# Learning Go Programming - Day 2 - Two Sum Hash Map

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

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]

``````func twoSum(nums []int, target int) []int {
var seen = map[int]int{};
for i:=0; i < len(nums); i++ {
var p, ok = seen[target - nums[i]]
if ok {
return []int{p, i}
}
seen[nums[i]]=i
}
return []int{}
}
``````

## NEW! Following my Trail (Upvote or/and Downvote)

Follow me for topics of Algorithms, Blockchain and Cloud.
I am @justyy - a Steem Witness
https://steemyy.com

#### Delegation Service

• Delegate 1000 to justyy: Link
• Delegate 5000 to justyy: Link
• Delegate 10000 to justyy: Link

#### Support me

If you like my work, please:

1. Delegate SP: https://steemyy.com/sp-delegate-form/?delegatee=justyy
2. Vote @justyy as Witness: https://steemyy.com/witness-voting/?witness=justyy&action=approve
3. Set @justyy as Proxy: https://steemyy.com/witness-voting/?witness=justyy&action=proxy
Alternatively, you can vote witness or set proxy here: https://steemit.com/~witnesses

STEEM 0.29
TRX 0.06
JST 0.039
BTC 35462.70
ETH 2441.41
USDT 1.00
SBD 3.95