Character Frequency Counting in DSA Go - Time & Space Complexity

Time Complexity: Character Frequency Counting

O(n)

Understanding Time Complexity

Counting how often each character appears in a string is a common task in programming.

We want to know how the time needed grows as the string gets longer.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

func charFrequency(s string) map[rune]int {
    freq := make(map[rune]int)
    for _, ch := range s {
        freq[ch]++
    }
    return freq
}

This code counts how many times each character appears in the input string.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each character in the string once.
• How many times: Exactly once for each character in the string (n times).

How Execution Grows With Input

As the string gets longer, the number of steps grows directly with its length.

Input Size (n)	Approx. Operations
10	10 steps
100	100 steps
1000	1000 steps

Pattern observation: Doubling the string length roughly doubles the work done.

Final Time Complexity

Time Complexity: O(n)

This means the time to count characters grows in a straight line with the string length.

Common Mistake

[X] Wrong: "Counting characters takes more time because of the map updates inside the loop."

[OK] Correct: Each map update is a quick operation, so the main time is just looping through the string once.

Interview Connect

Understanding this helps you explain how simple loops and data structures work together efficiently.

Self-Check

"What if we used a nested loop to compare each character with every other character? How would the time complexity change?"

Practice

1. What does character frequency counting in a string help us find?

easy

A. How many times each character appears in the string

B. The length of the string

C. The first character of the string

D. The position of a character in the string

Solution

1. Step 1: Understand character frequency counting

   It means counting how many times each character shows up in a string.

2. Step 2: Compare with other options

   Length, first character, or position are different concepts, not frequency counting.

3. Final Answer:

   How many times each character appears in the string -> Option A

4. Quick Check:

   Frequency counting = count characters [OK]

Hint: Frequency means count of each character [OK]

Common Mistakes:

• Confusing frequency with string length
• Thinking frequency means position
• Mixing frequency with substring extraction

2. Which Go code snippet correctly initializes a map to count character frequencies?

easy

A. freq := make(map[rune]int)

B. freq := map[int]string{}

C. freq := []int{}

D. freq := make([]rune, 0)

Solution

1. Step 1: Identify correct map initialization for character counts

   We need a map with keys as characters (rune) and values as counts (int), so make(map[rune]int) is correct.

2. Step 2: Check other options

   freq := map[int]string{} uses wrong types (int keys, string values), C and D are slices, not maps.

3. Final Answer:

   freq := make(map[rune]int) -> Option A

4. Quick Check:

   Map for rune to int = freq map [OK]

Hint: Use map[rune]int for char frequency in Go [OK]

Common Mistakes:

• Using slice instead of map
• Wrong key or value types in map
• Not using make() for map initialization

3. What is the output of this Go code?

package main
import "fmt"
func main() {
  s := "hello"
  freq := make(map[rune]int)
  for _, ch := range s {
    freq[ch]++
  }
  fmt.Println(freq['l'])
}

medium

A. 3

B. 1

C. 2

D. 0

Solution

1. Step 1: Count occurrences of 'l' in "hello"

   The string "hello" has 'l' twice (positions 2 and 3).

2. Step 2: Check map frequency for 'l'

   freq['l'] increments twice, so freq['l'] = 2.

3. Final Answer:

   2 -> Option C

4. Quick Check:

   Count of 'l' in "hello" = 2 [OK]

Hint: Count repeated chars carefully [OK]

Common Mistakes:

• Counting only once
• Confusing index with count
• Using wrong character in print

4. Find the error in this Go code for counting character frequency:

package main
import "fmt"
func main() {
  s := "test"
  freq := map[rune]int{}
  for i := 0; i < len(s); i++ {
    freq[s[i]] += 1
  }
  fmt.Println(freq)
}

medium

A. fmt.Println cannot print maps

B. Map freq is not initialized properly

C. Loop should use range instead of index

D. Using s[i] as byte instead of rune causes wrong map key type

Solution

1. Step 1: Check map key type and s[i] type

   Map keys are rune but s[i] is byte, causing type mismatch.

2. Step 2: Understand why this is an error

   Go does not automatically convert byte to rune for map keys, so this causes a compile error.

3. Final Answer:

   Using s[i] as byte instead of rune causes wrong map key type -> Option D

4. Quick Check:

   Byte vs rune key mismatch error [OK]

Hint: Use rune(s[i]) or range loop for correct key type [OK]

Common Mistakes:

• Ignoring byte vs rune difference
• Assuming map auto-converts keys
• Thinking map initialization is wrong

5. Given a string, how can you find the character with the highest frequency using Go maps?

hard

A. Use a slice to store counts and pick the last element

B. Count frequencies in a map, then iterate map to find max count character

C. Sort the string and pick the first character

D. Print the string length as the highest frequency

Solution

1. Step 1: Count character frequencies using a map

   Use a map[rune]int to count how many times each character appears.

2. Step 2: Iterate the map to find the character with the highest count

   Loop through the map keys and values, track the max count and corresponding character.

3. Final Answer:

   Count frequencies in a map, then iterate map to find max count character -> Option B

4. Quick Check:

   Map count + max search = highest frequency char [OK]

Hint: Use map to count, then find max by iteration [OK]

Common Mistakes:

• Sorting string does not give frequency
• Using slice without mapping chars
• Confusing length with frequency