Character Frequency Counting in DSA Java - Build from Scratch

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 writers understand which letters they use most.

🎯 Goal: Build a Java program that counts the frequency of each character in a given string and displays the counts.

📋 What You'll Learn

Create a string variable with a specific sentence.

Create a map to store character frequencies.

Use a loop to count each character's frequency.

Print the character frequencies in the map.

💡 Why This Matters

🌍 Real World

Counting character frequency is useful in text analysis, cryptography, and data compression.

💼 Career

Understanding how to count and store frequencies helps in roles like software development, data science, and natural language processing.

1

Create the input string

Create a String variable called sentence and set it to "hello world".

DSA Java

// Create the input string
// Your code here

Hint

Use String sentence = "hello world"; to create the sentence.

2

Create the frequency map

Create a Map<Character, Integer> called charFrequency and initialize it as a new HashMap<>().

DSA Java

String sentence = "hello world";
// Create the frequency map
// Your code here

Hint

Use Map<Character, Integer> charFrequency = new HashMap<>(); to create the map.

3

Count character frequencies

Use a for loop with a char variable ch to iterate over each character in sentence.toCharArray(). Inside the loop, update charFrequency to count how many times each character appears.

DSA Java

import java.util.Map;
import java.util.HashMap;

String sentence = "hello world";
Map charFrequency = new HashMap();

// Count character frequencies
// Your code here

Hint

Use for (char ch : sentence.toCharArray()) to loop through characters and charFrequency.put(ch, charFrequency.getOrDefault(ch, 0) + 1); to update counts.

4

Print the character frequencies

Use System.out.println(charFrequency); to print the charFrequency map.

DSA Java

import java.util.Map;
import java.util.HashMap;

String sentence = "hello world";
Map charFrequency = new HashMap();

for (char ch : sentence.toCharArray()) {
    charFrequency.put(ch, charFrequency.getOrDefault(ch, 0) + 1);
}

// Print the character frequencies
// Your code here

Hint

Use System.out.println(charFrequency); to display the map.

Practice

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

easy

A. The first character of the string

B. The length of the string

C. How many times each character appears in the string

D. The position of a character in the string

Solution

1. Step 1: Understand the purpose of frequency counting

   Frequency counting means counting how many times each character appears in a string.

2. Step 2: Identify what frequency counting returns

   It returns a count for each character, not the length or position.

3. Final Answer:

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

4. Quick Check:

   Frequency counting = character counts [OK]

Hint: Frequency counting means counting each character's occurrences [OK]

Common Mistakes:

• Confusing frequency with string length
• Thinking frequency gives character positions
• Assuming frequency returns only unique characters

2. Which Java data structure is best suited to store character frequencies for a string?

easy

A. HashMap

B. ArrayList<Character>

C. LinkedList<Integer>

D. Stack<Character>

Solution

1. Step 1: Identify data structure needs

   We need to map each character to its count, so a key-value pair structure is needed.

2. Step 2: Choose the correct Java collection

   HashMap stores characters as keys and their counts as values.

3. Final Answer:

   HashMap -> Option A

4. Quick Check:

   Map characters to counts = HashMap [OK]

Hint: Use HashMap to map characters to their counts [OK]

Common Mistakes:

• Using ArrayList which doesn't map keys to values
• Choosing LinkedList which is a list, not a map
• Using Stack which is for LIFO, not frequency counting

3. What is the output of the following Java code?

String s = "hello";
Map freq = new HashMap<>();
for (char c : s.toCharArray()) {
  freq.put(c, freq.getOrDefault(c, 0) + 1);
}
System.out.println(freq);

medium

A. {h=1, e=1, l=1, o=1}

B. {h=1, e=1, l=2, o=1}

C. {h=1, e=1, l=3, o=1}

D. Compilation error

Solution

1. Step 1: Count characters in "hello"

   Characters: h(1), e(1), l(2), o(1).

2. Step 2: Check code logic for counting

   Code uses getOrDefault to add 1 to existing count or start at 0, correctly counting frequencies.

3. Final Answer:

   {h=1, e=1, l=2, o=1} -> Option B

4. Quick Check:

   Count 'l' twice, others once = {h=1, e=1, l=2, o=1} [OK]

Hint: Count each character carefully, watch repeated letters [OK]

Common Mistakes:

• Counting 'l' only once
• Confusing getOrDefault usage
• Expecting syntax error incorrectly

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

String s = "test";
Map freq = new HashMap<>();
for (int i = 0; i <= s.length(); i++) {
  char c = s.charAt(i);
  freq.put(c, freq.getOrDefault(c, 0) + 1);
}

medium

A. Using <= in loop causes IndexOutOfBoundsException

B. HashMap cannot store Character keys

C. getOrDefault method is not available in HashMap

D. charAt method does not exist for String

Solution

1. Step 1: Analyze loop condition

   Loop uses i <= s.length(), but valid indices are 0 to s.length()-1.

2. Step 2: Identify error consequence

   Accessing s.charAt(s.length()) causes IndexOutOfBoundsException at runtime.

3. Final Answer:

   Using <= in loop causes IndexOutOfBoundsException -> Option A

4. Quick Check:

   Loop index must be less than length [OK]

Hint: Loop index must be less than string length, not equal [OK]

Common Mistakes:

• Thinking HashMap can't store Character keys
• Assuming getOrDefault is unavailable
• Believing charAt doesn't exist for String

5. Given a string with mixed case letters, how can you count character frequencies ignoring case (treat 'A' and 'a' as same)? Choose the best approach.

hard

A. Ignore characters that are uppercase

B. Count uppercase and lowercase separately and add later

C. Use a TreeMap instead of HashMap

D. Convert string to lowercase before counting frequencies

Solution

1. Step 1: Understand case-insensitive counting

   To treat 'A' and 'a' the same, convert all characters to one case.

2. Step 2: Choose best method

   Converting entire string to lowercase before counting ensures all letters are uniform.

3. Final Answer:

   Convert string to lowercase before counting frequencies -> Option D

4. Quick Check:

   Uniform case simplifies frequency counting [OK]

Hint: Convert string to one case before counting [OK]

Common Mistakes:

• Counting uppercase and lowercase separately
• Using TreeMap which doesn't solve case issue
• Ignoring uppercase letters incorrectly