Two Sum Problem Classic Hash Solution in DSA Go - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to declare the map for storing numbers and their indices.

DSA Go

numsMap := map[int]int[1]

Drag options to blanks, or click blank then click option'

A()

B[]

C{}

D<>

Attempts:

3 left

💡 Hint

Common Mistakes

Using square brackets [] instead of curly braces {}

Using parentheses () which are for functions

Using angle brackets <> which are not valid in Go

In Go, to create an empty map, you use the map literal `map[keyType]valueType{}`.

2fill in blank

medium

Complete the code to check if the complement exists in the map.

DSA Go

if idx, ok := numsMap[[1]]; ok {

Drag options to blanks, or click blank then click option'

Atarget + num

Bnum + target

Cnum - target

Dtarget - num

Attempts:

3 left

💡 Hint

Common Mistakes

Adding instead of subtracting to find complement

Reversing the subtraction order

The complement is the number needed to reach the target, so it is target minus the current number.

3fill in blank

hard

Fix the error in the code to add the current number and its index to the map.

DSA Go

numsMap[[1]] = i

Drag options to blanks, or click blank then click option'

Aidx

Bnum

Ci

Dtarget

Attempts:

3 left

💡 Hint

Common Mistakes

Using the index as the key instead of the number

Using the target instead of the current number

We store the current number as the key and its index as the value in the map.

4fill in blank

hard

Fill both blanks to complete the for loop iterating over the numbers with index.

DSA Go

for [1], [2] := range nums {

Drag options to blanks, or click blank then click option'

Ai

Bnum

Cindex

Dvalue

Attempts:

3 left

💡 Hint

Common Mistakes

Swapping index and value variables

Using non-descriptive variable names

In Go, the for range loop returns index and value, commonly named i and num for clarity.

5fill in blank

hard

Fill both blanks to return the indices of the two numbers that add up to the target.

DSA Go

return []int[1], [2]

Drag options to blanks, or click blank then click option'

Aidx

Bi

C]

D[

Attempts:

3 left

💡 Hint

Common Mistakes

Forgetting square brackets around the slice

Returning values in wrong order

In Go, to return a slice with two indices, use the slice literal []int{idx, i}.

Practice

1. What is the main idea behind the Two Sum Problem Classic Hash Solution?

easy

A. Use a hash map to store numbers and their indices for quick lookup

B. Sort the array and use two pointers to find the sum

C. Use nested loops to check every pair of numbers

D. Use recursion to find pairs that add up to the target

Solution

1. Step 1: Understand the problem goal

   The goal is to find two numbers in the array that add up to a target value.

2. Step 2: Use a hash map for efficient lookup

   By storing each number and its index in a hash map, we can check if the complement (target - current number) exists quickly.

3. Final Answer:

   Use a hash map to store numbers and their indices for quick lookup -> Option A

4. Quick Check:

   Hash map lookup = fast pair finding [OK]

Hint: Use a hash map to find complements quickly [OK]

Common Mistakes:

• Trying to use nested loops which is slower
• Sorting the array which is unnecessary here
• Not storing indices with numbers

2. Which of the following Go code snippets correctly initializes a hash map to store integers as keys and values?

easy

A. var m map[int]int

B. m := map[int]int

C. m := make(map[int]int)

D. m := map[int]int(make())

Solution

1. Step 1: Recall Go map initialization syntax

   Maps in Go are initialized using the built-in make function like make(map[keyType]valueType).

2. Step 2: Identify correct syntax

   m := make(map[int]int) uses make(map[int]int) which is the correct way to create an empty map with int keys and int values.

3. Final Answer:

   m := make(map[int]int) -> Option C

4. Quick Check:

   make(map[int]int) = correct map init [OK]

Hint: Use make(map[key]value) to create maps in Go [OK]

Common Mistakes:

• Using var without make causes nil map
• Incorrect syntax like map[int]int(make())
• Using empty braces without make in some contexts

3. What will be the output of the following Go code snippet?

func twoSum(nums []int, target int) []int {
    m := make(map[int]int)
    for i, num := range nums {
        if j, ok := m[target-num]; ok {
            return []int{j, i}
        }
        m[num] = i
    }
    return nil
}

fmt.Println(twoSum([]int{2, 7, 11, 15}, 9))

medium

A. [1 0]

B. [0 1]

C. [2 3]

D. nil

Solution

1. Step 1: Trace the loop and map updates

   At i=0, num=2, map is empty, so store m[2]=0.
   At i=1, num=7, check if m[9-7=2] exists, yes at index 0.
   Return [0,1].

2. Step 2: Confirm returned indices

   The function returns indices of numbers 2 and 7 which sum to 9, so output is [0 1].

3. Final Answer:

   [0 1] -> Option B

4. Quick Check:

   Indices of 2 and 7 = [0 1] [OK]

Hint: Check map for complement before inserting current number [OK]

Common Mistakes:

• Returning indices in wrong order
• Not checking map before insertion
• Returning nil when pair exists

4. Identify the error in the following Go code for the Two Sum problem:

func twoSum(nums []int, target int) []int {
    m := make(map[int]int)
    for i, num := range nums {
        if j, ok := m[num-target]; ok {
            return []int{j, i}
        }
        m[num] = i
    }
    return nil
}

medium

A. The complement calculation should be target - num, not num - target

B. The map should store num + target as key

C. The map initialization is incorrect

D. The return statement should return nil earlier

Solution

1. Step 1: Analyze complement calculation

   The complement to find is target - current number, not num - target, because we want a number that adds with num to target.

2. Step 2: Identify the fix

   Change m[num-target] to m[target-num] to correctly check for the complement in the map.

3. Final Answer:

   The complement calculation should be target - num, not num - target -> Option A

4. Quick Check:

   Complement = target - num [OK]

Hint: Complement = target minus current number [OK]

Common Mistakes:

• Swapping target and num in complement
• Incorrect map initialization
• Returning nil too early

5. Given the input array nums = [3, 3, 4, 2] and target 6, what will the Two Sum Classic Hash Solution return?
Consider the code below:

func twoSum(nums []int, target int) []int {
    m := make(map[int]int)
    for i, num := range nums {
        if j, ok := m[target-num]; ok {
            return []int{j, i}
        }
        m[num] = i
    }
    return nil
}

medium

A. nil

B. [1 2]

C. [2 3]

D. [0 1]

Solution

1. Step 1: Trace the loop with given input

   i=0, num=3, map empty, store m[3]=0.
   i=1, num=3, check m[6-3=3], found at index 0, return [0,1].

2. Step 2: Confirm returned indices

   Indices 0 and 1 correspond to values 3 and 3 which sum to 6, so output is [0 1].

3. Final Answer:

   [0 1] -> Option D

4. Quick Check:

   3 + 3 = 6 at indices [0 1] [OK]

Hint: Check map for complement before inserting current number [OK]

Common Mistakes:

• Assuming different pairs without checking map
• Returning nil when pair exists
• Confusing indices order