also deals with punctuation and capitalization.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
str1 = 'question';
str2 = 'estion-quay';
str1_f = english2piglatin(str1);
assert(strcmp(str1_f,str2))
|
2 | Pass |
str1 = 'another';
str2 = 'another-ay';
str1_f = english2piglatin(str1);
assert(strcmp(str1_f,str2))
|
3 | Pass |
str1 = 'nix';
str2 = 'ix-nay';
str1_f = english2piglatin(str1);
assert(strcmp(str1_f,str2))
|
4 | Pass |
str1 = 'another one bites the dust';
str2 = 'another-ay one-ay ites-bay e-thay ust-day';
str1_f = english2piglatin(str1);
assert(strcmp(str1_f,str2))
|
5 | Pass |
str1 = 'how much wood would a woodchuck chuck if a woodchuck could chuck wood';
str2 = 'ow-hay uch-may ood-way ould-way a-ay oodchuck-way uck-chay if-ay a-ay oodchuck-way ould-cay uck-chay ood-way';
str1_f = english2piglatin(str1);
assert(strcmp(str1_f,str2))
|
6 | Pass |
str1 = 'peter piper picked a peck of pickle peppers';
str2 = 'eter-pay iper-pay icked-pay a-ay eck-pay of-ay ickle-pay eppers-pay';
str1_f = english2piglatin(str1);
assert(strcmp(str1_f,str2))
|
7 | Pass |
str1 = 'four score';
str2 = 'our-fay ore-scay';
str1_f = english2piglatin(str1);
assert(strcmp(str1_f,str2))
|
Which values occur exactly three times?
3306 Solvers
332 Solvers
Least common multiple of many numbers
159 Solvers
205 Solvers
The sum of the numbers in the vector
341 Solvers