Character Frequency Counting in DSA Java - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is character frequency counting?

It is the process of counting how many times each character appears in a given string or text.

beginner

Which data structure is commonly used to store character frequencies in Java?

A HashMap is commonly used to store characters as keys and their counts as values.

intermediate

Why do we use a HashMap instead of an array for character frequency counting?

HashMap works well for any characters including Unicode, while arrays are limited to fixed character sets like ASCII.

intermediate

What is the time complexity of counting character frequency using a HashMap?

The time complexity is O(n), where n is the length of the string, because each character is processed once.

beginner

How do you handle characters that are not yet in the frequency map when counting?

Check if the character exists in the map; if not, add it with count 1; if yes, increase its count by 1.

What data structure is best for counting character frequency in Java?

A HashMap<Character, Integer>

B ArrayList<Character>

C LinkedList<Integer>

D Stack<Character>

HashMap allows storing characters as keys and their counts as values efficiently.

What is the time complexity of counting characters in a string of length n?

A O(1)

B O(n^2)

C O(n)

D O(log n)

Each character is processed once, so the time complexity is linear, O(n).

If a character is not in the frequency map, what should you do?

A Ignore it

B Add it with count 1

C Remove it

D Set count to 0

New characters should be added with count 1 to start counting.

Which of these is NOT a reason to use HashMap for character frequency?

A Fixed size memory allocation

B Supports Unicode characters

C Fast lookup and update

D Flexible key-value storage

HashMap does not use fixed size memory; arrays do.

What will be the frequency count of 'a' in the string "banana"?

A 2

B 0

C 1

D 3

The character 'a' appears 3 times in "banana".

Explain how to count character frequency in a string using Java.

Think about how to store counts and update them as you see each character.

Describe the advantages of using a HashMap for character frequency counting over an array.

Consider character sets and memory usage.

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