Bird
Raised Fist0
DSA Goprogramming~30 mins

Character Frequency Counting in DSA Go - Build from Scratch

Choose your learning style10 modes available
Character Frequency Counting
📖 Scenario: You are working on a text analysis tool that counts how many times each character appears in a given sentence. This helps understand the text better, like counting letters in a word game.
🎯 Goal: Build a Go program that counts the frequency of each character in a sentence and prints the results.
📋 What You'll Learn
Create a string variable with a specific sentence.
Create a map to hold character counts.
Use a loop to count each character's frequency.
Print the character frequencies in a readable format.
💡 Why This Matters
🌍 Real World
Counting character frequency is useful in text analysis, cryptography, and data compression.
💼 Career
Understanding maps and loops in Go is essential for backend development and data processing tasks.
Progress0 / 4 steps
1
Create the sentence string
Create a string variable called sentence and set it to "hello world".
DSA Go
Hint

Use sentence := "hello world" to create the string.

2
Create the frequency map
Create a map called freq with key type rune and value type int. Initialize it as an empty map.
DSA Go
Hint

Use freq := make(map[rune]int) to create the map.

3
Count characters using a loop
Use a for loop with variable char to iterate over sentence. Inside the loop, increase freq[char] by 1.
DSA Go
Hint

Use for _, char := range sentence to loop over characters and freq[char]++ to count.

4
Print the character frequencies
Use a for loop with variables char and count to iterate over freq. Inside the loop, print the character and its count using fmt.Printf("%c: %d\n", char, count). Import fmt at the top.
DSA Go
Hint

Use for char, count := range freq and fmt.Printf("%c: %d\n", char, count) to print.

Practice

(1/5)
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
Recommended

Ready to prove it?

Pass the test and this pattern moves unknown strong while earning +1 Grip toward your certificate.

10 questions~5 mineasy hard