Skip to main content

Java Interview Question: Count Frequency of Characters in a String (HashMap & Streams Explained)

🔹 Introduction

Counting character frequency is a very common Java interview question.
It tests your understanding of strings, HashMap, and Java Streams.

👉 In this article, we will cover:

  • HashMap approach (most asked in interviews)
  • Java Streams approach (modern & advanced)

🔹 Problem Statement

Given a string, count the occurrence of each character.

Example:

Input: aabbcc
Output: a=2, b=2, c=2

🔹 Approach 1: Using HashMap (Most Important)

💡 Explanation

  • Traverse the string
  • Store character count in HashMap
  • Use getOrDefault() for clean code

👨‍💻 Java Code (HashMap)

import java.util.*;

public class CharacterFrequency {
public static void main(String[] args) {
String str = "aabbcc";

Map<Character, Integer> map = new HashMap<>();

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

map.forEach((key, value) ->
System.out.println(key + " = " + value)
);
}
}

🔹 Approach 2: Using Java Streams (Advanced)

💡 Explanation

  • Convert string into stream of characters
  • Group characters using groupingBy()
  • Count occurrences using counting()

👉 This is a functional programming approach


👨‍💻 Java Code (Streams)

import java.util.*;
import java.util.stream.*;
import java.util.function.Function;

public class CharacterFrequency {
public static void main(String[] args) {
String str = "aabbcc";

Map<Character, Long> frequencyMap =
str.chars()
.mapToObj(c -> (char) c)
.collect(Collectors.groupingBy(
Function.identity(),
Collectors.counting()
));

frequencyMap.forEach((key, value) ->
System.out.println(key + " = " + value));
}
}

🔍 Internal Working (Important for Interviews)

  • chars() → converts string to IntStream
  • mapToObj() → converts int → Character
  • groupingBy() → groups same characters
  • counting() → counts frequency

🔹 Output

a = 2
b = 2
c = 2

🔹 Time Complexity

  • O(n) for both approaches

🔹 HashMap vs Streams



🔹 Key Takeaways

✔ HashMap is must-know
✔ Streams show advanced skills
groupingBy() is very important


🔹 Conclusion

This problem is a foundation for many string-based interview questions.
Master both approaches to stand out in interviews.

🔗 Also Read

👉 First Non-Repeating Character in Java
👉 Check Palindrome String in Java
👉 Reverse a String

Comments

Popular posts from this blog

Top Java Interview Question: First Non-Repeating Character in a String

  🔹 Introduction Java interviews often include string-based questions. One of the most commonly asked questions is: 👉 Find the first non-repeating character in a string. In this article, we will solve it step by step in a simple and easy-to-understand way. 🔹 Problem Statement Given a string, find the first character that does not repeat. Example: Input: aabbcde Output: c 🔹 Approach To solve this problem efficiently: Count frequency of each character Maintain insertion order Traverse again to find the first character with frequency = 1 👉 We use LinkedHashMap because: It maintains insertion order Helps us find the first non-repeating character 🔹 Java Code import java . util . *; public class FirstNonRepeating { public static void main ( String [] args ) { String str = "aabbcde" ; Map < Character , Integer > map = new LinkedHashMap <>(); // Count frequency for ( char ch : str . to...

Java Interview Question: Separate Even and Odd Numbers Using Streams (With Examples)

  🔹 Introduction Separating even and odd numbers is a common Java interview question. It helps test your understanding of Java Streams, filtering, and partitioning . 👉 In this article, we will solve this using: Traditional approach Java Streams (modern approach) 🔹 Problem Statement Given a list of integers, separate even and odd numbers. Example: Input: [1, 2, 3, 4, 5, 6] Output: Even: [2, 4, 6], Odd: [1, 3, 5] 🔹 Approach 1: Using Loop (Basic) 💡 Explanation Traverse list Check number % 2 Store in separate lists 👨‍💻 Java Code import java . util . *; public class EvenOdd { public static void main ( String [] args ) { List < Integer > list = Arrays . asList ( 1 , 2 , 3 , 4 , 5 , 6 ); List < Integer > even = new ArrayList <>(); List < Integer > odd = new ArrayList <>(); for ( int num : list ) { if ( num % 2 == 0 ) { even . add ( num )...

Java Interview Question: Check if a String is a Palindrome

 🔹 Introduction String problems are very common in Java interviews. One of the easiest yet frequently asked questions is: 👉 Check whether a given string is a palindrome. Let’s understand how to solve it step by step. 🔹 Problem Statement A string is called a palindrome if it reads the same forward and backward. Example: Input: madam Output: Palindrome Input: hello Output: Not a Palindrome 🔹 Approach 1: Using Two Pointers (Best Method) Start one pointer from the beginning Start another pointer from the end Compare characters If all match → Palindrome 🔹 Java Code (Two Pointer Approach) public class PalindromeCheck { public static void main ( String [] args ) { String str = "madam" ; int left = 0 ; int right = str . length () - 1 ; boolean isPalindrome = true ; while ( left < right ) { if ( str . charAt ( left ) != str . charAt ( right )) { isPalindr...