Two Sum solved in golang with hashmaps

twoSum.go

func twoSum(nums []int, target int) []int {
	m := make(map[int]int)

	for i := 0; i < len(nums); i++ {
		curr := nums[i]
		diff := target - curr

		if _, ok := m[diff]; ok {
			return []int{m[diff], i}
		}

		m[curr] = i
	}

	return nil
}