Given a string, return the character that appears the maximum number of times in the string. The string will contain only ASCII characters, from the ranges ('a'-z',A-Z,0'-9'), and cas matters. If there is a tie in the maximum number of times a character appears in the string, return the character that appears first in the string. For example, given the string text abbbaacc, both a and b occur 3 times in text. Since a occurs earlier, a is the answer.
Function Description
Complete the function in the editor below. The function must return the character that appears first in the string.
maximumOccurring Character has the following parameter text: the string to be operated upon
Constraints
10 < and equal lenath of text All characters are alphanumeric, in the ranges ('a'-z',A-Z,0-9')

The function in Python, is as follows:

def (mystring):

kount = [0] * 256

maxKount = -1

chr = ''

for i in mystring:

 kount[ord(i)]+=1;

for i in mystring:

 if maxKount < kount[ord(i)]:

 maxKount = kount[ord(i)]

 chr = i

return chr

Explanation:

This defines the function

def (mystring):

This creates a list of 256 characters (the number of ascii characters); the list is then initialized to 0

kount = [0] * 256

This initializes the maximum count to -1

maxKount = -1

This initializes the string with maximum number of occurrence to an empty character

chr = ''

This iterates through the string and gets the occurrence of each character

for i in mystring:

 kount[ord(i)]+=1;

This iterates through the string, compares the occurrence of each string with maxKount and return the character with the highest

for i in mystring:

 if maxKount < kount[ord(i)]:

 maxKount = kount[ord(i)]

 chr = i

return chr

the correct answer is a) her connection with a character

this is correct on edgnuity : )