Two Sum

DSA Solving and practicing

Posted by Hitesh Kumar on June 22, 2022
1
2
3
4
5
6
7
8
9
10
11
12
13
func twoSum(nums []int, target int) []int {
	indexMap := make(map[int]int)
	for currIndex, currNum := range nums {
		if requiredIdx, isPresent := indexMap[target-currNum]; isPresent {
			return []int{requiredIdx, currIndex}
		}
		indexMap[currNum] = currIndex
	}
	return []int{}
}
 
}

Screenshot-2022-06-23-at-20-28-24-Two-Sum-Leet-Code.png