Cody

# Problem 2139. most frequent character

Solution 1372508

Submitted on 7 Dec 2017 by Michael Cappello
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
x = 'purusa'; y_correct = 'u'; assert(isequal(frequent_character(x),y_correct))

n = 0 0 0 0 0 L = 5 x = 'u'

2   Pass
x = 'rama'; y_correct = 'a'; assert(isequal(frequent_character(x),y_correct))

n = 0 0 0 L = 1 x = 'a'

3   Pass
x = 'extemporaneous'; y_correct = 'e'; assert(isequal(frequent_character(x),y_correct))

n = 0 0 0 0 0 0 0 0 0 0 0 L = 2 x = 'e'

4   Pass
x = 'Thisisasentencewrittenasalongwordwithnospaces.'; y_correct = 's'; assert(isequal(frequent_character(x),y_correct))

n = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 L = 14 x = 's'

5   Pass
x = 'Jabberwocky'; y_correct = 'b'; assert(isequal(frequent_character(x),y_correct))

n = 0 0 0 0 0 0 0 0 0 0 L = 2 x = 'b'

6   Pass
x = 'inimical'; y_correct = 'i'; assert(isequal(frequent_character(x),y_correct))

n = 0 0 0 0 0 0 L = 3 x = 'i'

7   Pass
x = 'nine-million'; y_correct = 'i'; assert(isequal(frequent_character(x),y_correct))

n = 0 0 0 0 0 0 0 L = 3 x = 'i'