Original subtitles

Hi, ladies and gentlemen.

And in this exercise, what we are going to do.

Is to proceed from the previous one, OK, making just minor and small modifications, but just making

sure that everything was clear to you after the previous exercise and the program is going to be like

about 90 95 percent the same.

Okay, you're going to write a program that will read a file name from the user.

And then the program should create a frequency appearances array for lowercase letters, a up to Z and

print the first character that appeared most of the times.

OK, so we are going to create a frequency appearances array.

Count how many times each of the elements appears and find the lowercase letter that appeared most of

the times and then print the actual character.

And also, these parentheses for the first is basically if you have like two characters, two lowercase

scalar characters that, let's say, appear like 10 times each.

OK, which is the most of the times that any lowercase character appeared.

OK, but you have two of them.

So which one of them should you print?

We will print the first one in the lexical graphical representation.

OK, so if you have Letter B Il ten times in letter E 10 times, so we'll print that B appeared most

of the times.

OK, so very, very minor modifications through the previous program, but that's necessary for you

to do them OK on your own and then compare with the results, because that's only how you will learn

and practice and make sure that you understood all the concepts and everything that we spoke about so

far.

OK, so good luck, guys.

My name is Vlad and I'll see you in the solutions deal then.

Bye bye.