1314151617181920212223242526272829303132333435363738394041424344454647484950515253545556

import java.util.*;

class Solution {
    // Function to find max occurring character
    public char getMaxOccurringChar(String s) {
        // Convert to char array and sort
        char[] arr = s.toCharArray();
        Arrays.sort(arr);

        // Variables to store result
        int maxFreq = 1, currFreq = 1;
        char maxChar = arr[0];

        // Traverse the sorted array
        for (int i = 1; i < arr.length; i++) {
            // If same char, increase count
            if (arr[i] == arr[i - 1]) {
                currFreq++;
            } 
            else {
                // If frequency greater, update result
                if (currFreq > maxFreq) {
                    maxFreq = currFreq;
                    maxChar = arr[i - 1];
                }
                currFreq = 1;
            }
        }

        // Final check for last character
        if (currFreq > maxFreq) {
            maxFreq = currFreq;
            maxChar = arr[arr.length - 1];
        }

        // Return result
        return maxChar;
    }
}

public class Main {
    public static void main(String[] args) {
        // Input string
        String s = "samplestring";

        // Create object of Solution
        Solution obj = new Solution();

        // Call function
        char ans = obj.getMaxOccurringChar(s);

        // Print result
        System.out.println("Max occurring character: " + ans);
    }
}

12345678910111213141516171819202122232425262728293031323334353637383940414243

class Solution:
    # Function to find max occurring character
    def getMaxOccurringChar(self, s: str) -> str:
        # Sort the string
        arr = sorted(s)

        # Variables to store result
        maxFreq, currFreq = 1, 1
        maxChar = arr[0]

        # Traverse the sorted string
        for i in range(1, len(arr)):
            # If same char, increase count
            if arr[i] == arr[i - 1]:
                currFreq += 1
            else:
                # If frequency greater, update result
                if currFreq > maxFreq:
                    maxFreq = currFreq
                    maxChar = arr[i - 1]
                currFreq = 1

        # Final check for last character
        if currFreq > maxFreq:
            maxFreq = currFreq
            maxChar = arr[-1]

        # Return result
        return maxChar


# Input string
s = "samplestring"

# Create object of Solution
obj = Solution()

# Call function
ans = obj.getMaxOccurringChar(s)

# Print result
print("Max occurring character:", ans)