Cody

# Problem 44469. Diagonal Pattern

Solution 1542709

Submitted on 29 May 2018 by amir cohen
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
filetext = fileread('diagonalPattern.m'); assert(isempty(strfind(filetext, 'regexp')),'regexp hacks are forbidden')

2   Pass
n = 1; mat_correct = 0; assert(isequal(diagonalPattern(n),mat_correct))

mat = 0

3   Pass
n = -1; mat_correct = []; assert(isequal(diagonalPattern(n),mat_correct))

mat = []

4   Pass
n = 1.5; mat_correct = []; assert(isequal(diagonalPattern(n),mat_correct))

mat = []

5   Pass
n = 4; mat_correct = [0 1 2 3 1 0 1 2 2 1 0 1 3 2 1 0]; assert(isequal(diagonalPattern(n),mat_correct))

mat = 0 1 2 3 mat = 0 1 2 3 1 0 1 2 mat = 0 1 2 3 1 0 1 2 2 1 0 1 mat = 0 1 2 3 1 0 1 2 2 1 0 1 3 2 1 0

6   Pass
n = 5; mat_correct = [0 1 2 3 4 1 0 1 2 3 2 1 0 1 2 3 2 1 0 1 4 3 2 1 0]; assert(isequal(diagonalPattern(n),mat_correct))

mat = 0 1 2 3 4 mat = 0 1 2 3 4 1 0 1 2 3 mat = 0 1 2 3 4 1 0 1 2 3 2 1 0 1 2 mat = 0 1 2 3 4 1 0 1 2 3 2 1 0 1 2 3 2 1 0 1 mat = 0 1 2 3 4 1 0 1 2 3 2 1 0 1 2 3 2 1 0 1 4 3 2 1 0