Why Math and Number Theory Appear in DSA Problems in DSA Go - Test Your Knowledge

Practice - 5 Tasks

1fill in blank

easy

Complete the code to calculate the greatest common divisor (GCD) of two numbers using Euclid's algorithm.

DSA Go

func gcd(a, b int) int {
    for b != 0 {
        a, b = b, a [1] b
    }
    return a
}

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

A%

B/

C*

D+

Attempts:

3 left

💡 Hint

Common Mistakes

Using division (/) instead of modulo (%) causes incorrect results.

Euclid's algorithm uses the modulo operator (%) to find the remainder when dividing a by b.

2fill in blank

medium

Complete the code to check if a number n is prime by testing divisibility up to its square root.

DSA Go

func isPrime(n int) bool {
    if n <= 1 {
        return false
    }
    for i := 2; i <= int([1](math.Sqrt(float64(n)))); i++ {
        if n%i == 0 {
            return false
        }
    }
    return true
}

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

Amath.Floor

Bmath.Ceil

Cmath.Sqrt

Dmath.Abs

Attempts:

3 left

💡 Hint

Common Mistakes

Using Ceil or Abs instead of Floor leads to incorrect loop bounds.

We check divisibility up to the floor of the square root of n to ensure all possible factors are tested.

3fill in blank

hard

Fix the error in the code to compute the modular exponentiation (a^b mod m) efficiently.

DSA Go

func modExp(a, b, m int) int {
    result := 1
    a = a % m
    for b > 0 {
        if b & 1 == [1] {
            result = (result * a) % m
        }
        a = (a * a) % m
        b = b >> 1
    }
    return result
}

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

Aa

B0

Cb

D1

Attempts:

3 left

💡 Hint

Common Mistakes

Checking if b & 1 == 0 causes wrong multiplication logic.

We check if the least significant bit of b is 1 using bitwise AND with 1.

4fill in blank

hard

Fill both blanks to create a map of numbers to their squares for numbers greater than 3.

DSA Go

squares := map[int]int{}
for num := 1; num <= 5; num++ {
    if num [1] 3 {
        squares[num] = num [2] 2
    }
}

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

A>

B<

C**

D*

Attempts:

3 left

💡 Hint

Common Mistakes

Using < instead of > filters wrong numbers.

Using ** is not valid in Go for exponentiation.

We want numbers greater than 3, so use >. The square is calculated by multiplying the number by itself using *.

5fill in blank

hard

Fill all three blanks to create a filtered map of uppercase keys to values greater than zero.

DSA Go

result := map[string]int{}
for k, v := range data {
    if v [1] 0 {
        result[[2]] = [3]
    }
}

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

A>

B<

Ck

DtoUpper(k)

Attempts:

3 left

💡 Hint

Common Mistakes

Using < filters wrong values.

Using k instead of toUpper(k) does not convert keys.

We filter values greater than zero using >. The key is converted to uppercase using toUpper(k). The value v is assigned as is.

Practice

1. Why do problems in Data Structures & Algorithms often involve concepts from math and number theory?

easy

A. Because math slows down algorithms

B. Because math is only used for graphical user interfaces

C. Because number theory is unrelated to programming

D. Because math helps analyze algorithm efficiency and solve complex problems

Solution

1. Step 1: Understand the role of math in algorithms

   Math provides tools to measure how fast algorithms run and helps solve problems involving counting, divisibility, and patterns.

2. Step 2: Connect number theory to problem solving

   Number theory concepts like primes and modular arithmetic help solve problems efficiently, especially in cryptography and hashing.

3. Final Answer:

   Because math helps analyze algorithm efficiency and solve complex problems -> Option D

4. Quick Check:

   Math importance = Because math helps analyze algorithm efficiency and solve complex problems [OK]

Hint: Math explains why algorithms work and how fast they run [OK]

Common Mistakes:

• Thinking math is only for UI or graphics
• Ignoring number theory's role in algorithms
• Assuming math slows down code

2. Which of the following Go code snippets correctly calculates the greatest common divisor (GCD) of two integers a and b using Euclid's algorithm?

easy

A. func gcd(a, b int) int { if b == 0 { return a } else { return gcd(b, a % b) } }

B. func gcd(a, b int) int { return a + b }

C. func gcd(a, b int) int { for i := 1; i <= a; i++ { if a%i == 0 && b%i == 0 { return i } } return 1 }

D. func gcd(a, b int) int { return a * b }

Solution

1. Step 1: Identify Euclid's algorithm structure

   Euclid's algorithm uses recursion: gcd(a, b) = gcd(b, a % b) until b is zero.

2. Step 2: Check each option

   func gcd(a, b int) int { if b == 0 { return a } else { return gcd(b, a % b) } } matches the recursive Euclid's algorithm correctly. Others do not compute GCD properly.

3. Final Answer:

   func gcd(a, b int) int { if b == 0 { return a } else { return gcd(b, a % b) } } -> Option A

4. Quick Check:

   Euclid's GCD = func gcd(a, b int) int { if b == 0 { return a } else { return gcd(b, a % b) } } [OK]

Hint: Euclid's GCD uses recursion with modulo until remainder zero [OK]

Common Mistakes:

• Using addition or multiplication instead of modulo
• Returning early inside a loop incorrectly
• Not handling base case b == 0

3. What is the output of the following Go code that uses modular arithmetic to avoid overflow?

package main
import "fmt"
func main() {
  a := 1000000000
  b := 1000000000
  mod := 1000000007
  result := (a * b) % mod
  fmt.Println(result)
}

medium

A. 49

B. 0

C. 1000000000000000000

D. 500000004

Solution

1. Step 1: Calculate (a * b) mod 1000000007

   Direct multiplication is 10^9 * 10^9 = 10^18, which is large. Using modulo properties: (a * b) % mod = ((a % mod) * (b % mod)) % mod.

2. Step 2: Compute modulo values

   a % mod = 1000000000, b % mod = 1000000000. Multiply: 1000000000 * 1000000000 = 10^18. Now modulo 1000000007: 10^18 % 1000000007 = 49.

3. Final Answer:

   49 -> Option A

4. Quick Check:

   (a*b)%mod = 49 [OK]

Hint: Use modulo before multiplication to prevent overflow [OK]

Common Mistakes:

• Printing a*b without modulo causing overflow
• Confusing modulo result with zero
• Ignoring modulo properties

4. The following Go function is intended to check if a number is prime. What is the bug?

func isPrime(n int) bool {
  if n <= 1 {
    return false
  }
  for i := 2; i < n; i++ {
    if n % i == 0 {
      return false
    }
  }
  return true
}

medium

A. The loop should run until i <= n/2 instead of i < n

B. The function should return true for n <= 1

C. The loop should run until i*i <= n for efficiency

D. The modulo operator % is used incorrectly

Solution

1. Step 1: Analyze the loop condition

   The loop checks divisors from 2 up to n-1, which is correct but inefficient.

2. Step 2: Identify optimization for prime checking

   We only need to check divisors up to sqrt(n) (i*i <= n) because larger factors repeat smaller ones.

3. Final Answer:

   The loop should run until i*i <= n for efficiency -> Option C

4. Quick Check:

   Loop limit = sqrt(n) optimization [OK]

Hint: Check divisors only up to square root of n [OK]

Common Mistakes:

• Looping all the way to n-1 wastes time
• Returning true for n <= 1 is wrong
• Misusing modulo operator

5. You want to find the number of integers between 1 and 1000 that are divisible by 3 or 5 but not both. Which approach using number theory concepts is correct?

hard

A. Count multiples of 3 plus multiples of 5 plus multiples of 15

B. Count multiples of 3 plus multiples of 5 minus twice the multiples of 15

C. Count multiples of 3 only

D. Count multiples of 5 only

Solution

1. Step 1: Understand the problem

   We want numbers divisible by 3 or 5 but not both. This means numbers divisible by 3 or 5 excluding those divisible by both (15).

2. Step 2: Apply inclusion-exclusion principle

   Count multiples of 3 and 5, then subtract twice the count of multiples of 15 to exclude numbers counted twice and remove those divisible by both.

3. Final Answer:

   Count multiples of 3 plus multiples of 5 minus twice the multiples of 15 -> Option B

4. Quick Check:

   Use inclusion-exclusion with double subtraction [OK]

Hint: Use inclusion-exclusion and subtract twice common multiples [OK]

Common Mistakes:

• Adding multiples of 15 instead of subtracting
• Ignoring overlap of multiples
• Counting only one divisor's multiples