🌱Newbie

0 XP

🐛Spot the BuggoEasyArrays & Hashing

Two Sum - Spot the Bug (Go)

Find and fix the bug in this Go solution

Problem Brief

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.

Puzzle Hints

Test the line against the actual promise of Two Sum, not just whether the syntax looks valid.
The repair changes only this statement shape: "if val, found := m[target+num]; found {". Keep the same role, but make it match the invariant.
Wrong operator: should be subtraction not addition

Asked at 72 companies

AdobeAetionAffirm

Two Sum — HashMap Lookup

hashmap

Input: [2,7,11,15], target=9. Use HashMap: complement → index

map in Goref

Go has built-in map[K]V type. Access is O(1) average. The comma-ok idiom val, ok := m[key] checks existence without panicking. Use make(map[K]V) to initialize. No built-in Set — use map[T]bool or map[T]struct{}.

-make(map[K]V) — initialize a hash map

-val, ok := m[key] — comma-ok pattern

-delete(m, key) — remove entry

-map[T]struct{} as a memory-efficient Set

m := make(map[string]int)
m["a"] = 1
val, ok := m["a"]  // val=1, ok=true

// Set pattern
seen := make(map[int]struct{})
seen[42] = struct{}{}
_, exists := seen[42]  // exists=true

Official docs →

map in Goref

-make(map[K]V) — initialize a hash map

-val, ok := m[key] — comma-ok pattern

-delete(m, key) — remove entry

-map[T]struct{} as a memory-efficient Set

m := make(map[string]int)
m["a"] = 1
val, ok := m["a"]  // val=1, ok=true

// Set pattern
seen := make(map[int]struct{})
seen[42] = struct{}{}
_, exists := seen[42]  // exists=true

Official docs →

How to think: Hash Map / Setguide

You need O(1) lookups — checking if something exists, counting frequencies, or finding pairs.

1.Ask: "Am I searching for something repeatedly?" → Hash Map

2.Ask: "Do I need to check existence?" → Set

3.Ask: "Do I need to count occurrences?" → Map with value = count

4.Ask: "Do I need to find a pair that satisfies a condition?" → Store complement in Map

5.The tradeoff: O(n) extra space buys you O(1) per lookup

vs Nested loops (O(n²)): You're comparing every element against every other — a Map does it in one pass

vs Sorting (O(n log n)): You just need existence/frequency checks, not order

find pairtwo numbers thatfrequencycountduplicateanagramgroup by

How to think: Hash Map / Setguide

You need O(1) lookups — checking if something exists, counting frequencies, or finding pairs.

1.Ask: "Am I searching for something repeatedly?" → Hash Map

2.Ask: "Do I need to check existence?" → Set

3.Ask: "Do I need to count occurrences?" → Map with value = count

4.Ask: "Do I need to find a pair that satisfies a condition?" → Store complement in Map

5.The tradeoff: O(n) extra space buys you O(1) per lookup

vs Nested loops (O(n²)): You're comparing every element against every other — a Map does it in one pass

vs Sorting (O(n log n)): You just need existence/frequency checks, not order

find pairtwo numbers thatfrequencycountduplicateanagramgroup by

Inspect the code — click the line with the bug

1func twoSum(nums []int, target int) []int {
2	m := make(map[int]int)
3	for idx, num := range nums {
4		if val, found := m[target+num]; found {
5			return []int{val, idx}
6		}
7		m[num] = idx
8	}
9	return nil
10}

1func twoSum(nums []int, target int) []int {

2 m := make(map[int]int)

3 for idx, num := range nums {

4 if val, found := m[target+num]; found {

5 return []int{val, idx}

6 }

7 m[num] = idx

8 }

9 return nil

10}