Cody

# Problem 1383. Count letters occurence in text, specific to words with a given length.

Solution 2154972

Submitted on 9 Mar 2020
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   Fail
txt = 'Hello World, from MATLAB' ; nl = 5 ; counts_correct = [0 0 0 1 1 0 0 1 0 0 0 3 0 0 2 0 0 1 0 0 0 0 1 0 0 0]; assert(isequal(nlWords_getCounts(txt, nl),counts_correct))

Assertion failed.

2   Fail
txt = 'UPPER converts any lowercase characters in the string str to the corresponding uppercase characters and leaves all other characters unchanged.' nl = 9 ; counts_correct = [3 0 3 1 5 0 1 1 0 0 0 1 0 2 1 2 0 2 2 0 2 0 1 0 0 0]; assert(isequal(nlWords_getCounts(txt, nl),counts_correct))

txt = 'UPPER converts any lowercase characters in the string str to the corresponding uppercase characters and leaves all other characters unchanged.'

Assertion failed.

3   Fail
txt = 'UPPER converts any lowercase characters in the string str to the corresponding uppercase characters and leaves all other characters unchanged.' nl = 10 ; counts_correct = [6 0 6 0 3 0 0 3 0 0 0 0 0 0 0 0 0 6 3 3 0 0 0 0 0 0]; assert(isequal(nlWords_getCounts(txt, nl),counts_correct))

txt = 'UPPER converts any lowercase characters in the string str to the corresponding uppercase characters and leaves all other characters unchanged.'

Assertion failed.