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.

💻 Awesome Tech Resources:
  • Looking for ⚒️ tech jobs? Go to our job portal.
  • Looking for tech events? Go to tech events 🗓️ Calendar.️

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.

Related Posts

  • Data structures in java
    16 April

    Data Structures in java

    In this post, we will see about various data structures in java. Data structure is a way of storing and organizing data. Data structure provide a way to process and store data efficiently. For example: 💻 Awesome Tech Resources: Looking for ⚒️ tech jobs? Go to our job portal. Looking for tech events? Go to […]

  • 29 November

    Top 100+ Java coding interview questions

    I have been posting data structure and coding interview questions on various topics such as Array, Queue, Stack, Binary tree, LinkedList, String, Number, ArrayList, etc. So I am consolidating a list of java coding interview questions to create an index post. I will keep adding links to this post whenever I will add new java […]

  • 18 April

    Minimum Number of Jumps to reach last Index

    If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to find Minimum Number of Jumps to reach last Index. Problem Given an array A of positive integers possibly zeroes, every index indicating the maximum length of a jump that can […]

  • 28 March

    Sort an array of 0s, 1s and 2s

    If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to sort an array of 0s, 1s and 2s.We have already seen a post on sort 0s and 1s in an array. Problem Given an array containing zeroes, ones and twos […]

  • 04 March

    Check if it is possible to reach end of given Array by Jumping

    If you want to practice data structure and algorithm programs, you can go through Java coding interview questions.   Problem Given an array with positive integers as elements indicating the maximum length of a jump which can be made from any position in the array. Check if it is possible to have a jumps combination […]

  • 17 February

    Check if Array Elements are Consecutive

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to check if array elements are consecutive. Problem Given an array, we need to check if array contains consecutive elements. For example: Input: array[] = {5, 3, 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.