Cody

# Problem 27. Pangrams!

Solution 1894875

Submitted on 8 Aug 2019 by Todd Snow
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 = 'The quick brown fox jumps over a lazy dog'; y_correct = true; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20 n = 21 n = 22 n = 23 n = 24 n = 25 n = 26 tf = logical 1

2   Pass
x = 'The quick brown fox jumped over a lazy dog'; y_correct = false; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20 n = 21 n = 22 n = 23 n = 24 n = 25

3   Pass
x = 'Pack my box with five dozen liquor jugs'; y_correct = true; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20 n = 21 n = 22 n = 23 n = 24 n = 25 n = 26 tf = logical 1

4   Pass
x = 'Pack my box with four dozen liquor jugs'; y_correct = false; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20 n = 21 n = 22 n = 23 n = 24 n = 25

5   Pass
x = 'Sphinx of black quartz, judge my vow'; y_correct = true; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20 n = 21 n = 22 n = 23 n = 24 n = 25 n = 26 tf = logical 1

6   Pass
x = 'Sphinx of black onyx, judge my vow'; y_correct = false; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20 n = 21 n = 22

7   Pass
x = 'Wonderful watermelon, bringer of life.'; y_correct = false; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15

8   Pass
x = 'Dastardly dumpling, harbinger of doom!'; y_correct = false; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18

9   Pass
x = 'AbcDE FgHiJKl mmoPQrstuV Wxyz'; y_correct = false; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20 n = 21 n = 22 n = 23 n = 24 n = 25

10   Pass
x = 'With quiz game Cody for MATLAB, expect perverse junk.'; y_correct = true; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20 n = 21 n = 22 n = 23 n = 24 n = 25 n = 26 tf = logical 1

11   Pass
x = 'Punctuation marks like @#\$%^</&>*?!!, when used in cartoons to stand in for swearing, are called "grawlix".'; y_correct = false; assert(isequal(isPangram(x),y_correct))

n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 n = 11 n = 12 n = 13 n = 14 n = 15 n = 16 n = 17 n = 18 n = 19 n = 20