Algorithm · SoFi · Easy
Given a string, determine which character occurs the greatest number of times. When two or more characters share the highest count, choose the lexicographically earliest one. Example Input: bbaadd Output: a The characters a, b, and d each occur twice, so a is returned because it is lexicographically smallest.
Checking your access…