Print maximum occurring character in a String

In this post, we will see how to print the maximum occurring character in a String.


Problem

Print maximum occurring character in a String
For example:

String 1: java2blog tutorial
Character: a has occurred maximum times in String: 3
———————-
String 2: This is test message
Character: s has occurred maximum times in String: 5

Solution

Simple solution can be we can sort the String and then find maximum occurring character by comparing consecutive characters.

Can we do better?
Yes, we can use hashmap and keep track of maximum count with the help of hashmap.
Here is simple algorithm.

  • Initialize a HashMap with Key as character and value as count.
  • Iterate over input string.
  • If character is already present in HashMap, then increment the count else put the value as 1.
  • Keep the track of maximum count in the process.
  • Once we are done with iterate, iterate over HashMap and find character with the help of maximum count.

Program to print maximum occurring character in a String

When you run above program, you will get below output:

String 1: java2blog tutorial
Character: a has occurred maximum times in String: 3
———————-
String 2: This is test message
Character: s has occurred maximum times in String: 5

Please note that if there are more than two character which can have same maximum count, it will print one of them.

That’s all about how to Print maximum occurring character in a String.


import_contacts

You may also like:

Related Posts

  • Maximum number of vowels in a Substring of given length
    18 June

    Maximum Number of Vowels in a Substring of Given Length

    Table of ContentsApproach – 1 Generate All Substrings Using substring() MethodApproach – 2 Using Sliding Window Method (Linear Time Solution) In this article, we will look at an interesting problem related to the Strings and [Sliding-Window Algorithm](https://java2blog.com/sliding-window-maximum-java/ “Sliding-Window Algorithm”). The problem is : "Given a String we have to Find the Maximum Number of Vowel […]

  • Find first and last position of element in sorted array
    04 June

    Search for a range Leetcode – Find first and last position of element in sorted array

    Table of ContentsApproach 1 (Using Linear Search)Approach 2 (Using Modified Binary Search-Optimal) In this article, we will look into an interesting problem asked in Coding Interviews related to Searching Algorithms. The problem is: Given a Sorted Array, we need to find the first and last position of an element in Sorted array. This problem is […]

  • 30 April

    Convert Postfix to Infix in Java

    Learn about how to convert Postfix to Infix in java.

  • Prefix to postfix in java
    30 April

    Convert Prefix to Postfix in Java

    Learn about how to convert Prefix to Postfix in java.

  • Data structures in java
    16 April

    Data Structures in java

    Table of ContentsArray Declare and initialize array in javaAdvantages of arrayDisadvantages of array ExampleArray practice programsStackStack implementation using ArrayStack implementation using LinkedListImplementationPractice ProgramsQueueQueue implementation using arrayQueue implementation using LinkedListImplementationLinkedListImplementationLinkedList Practice ProgramsBinary treeImplementationBinary tree practice programsBinary Search treeImplementationBinary search tree Practice programsTrieImplementationHeapImplementationGraphImplementation Inbuild data structures in javaStringHashMapLinkedHashMapArrayListLinkedListHashSet In this post, we will see about various data […]

  • 29 November

    Top 100+ Java coding interview questions

    Table of ContentsStringQuestion 1 : How to reverse a String in java? Can you write a program without using any java inbuilt methods?Question 2 : Write a java program to check if two Strings are anagram in java?Question 3 : Write a program to check if String has all unique characters in java?Question 4 : […]

Leave a Reply

Your email address will not be published. Required fields are marked *

Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.