Problem 44468. Diagonal Pattern

• Created by Shaul Salomon
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Cody Challenge

• 12 Problems
• 496 Finishers

Tough Stuff

• 19 Problems
• 7 Finishers

Like (3)

Difficulty:

(862)

Rate

• Solve Later   
• Add To GroupÂ

For a positive integer n, return an nXn matrix mat such that the value of each element in row i and column j is given according to the following rules:

• i - j, if i > j
• j - i, if i < j
• 0, if i equals j

If n is not a positive integer, mat should be an empty matrix.

Examples:

Input:  n   = 4
Output: mat = [0  1  2  3
               1  0  1  2
               2  1  0  1
               3  2  1  0]

Input:  n   = -2
Output: mat = []

Input:  n   = 2.5
Output: mat = []

Solve

Solution Stats

48.9% Correct | 51.1% Incorrect

• 317 Solutions
• 148 Solvers

Last Solution submitted on Apr 10, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers148

Suggested Problems

• Make a random, non-repeating vector.

  9980 Solvers

• Replace multiples of 5 with NaN

  449 Solvers

• Determine the number of odd integers in a vector

  755 Solvers

• 03 - Matrix Variables 2

  597 Solvers

• Mersenne Primes vs. All Primes

  723 Solvers

More from this Author25

• Eye Squared

  228 Solvers

• Diagonal Pattern

  461 Solvers

• Vector push

  397 Solvers

• Separate even from odd numbers in a vector - without loops

  390 Solvers

• Capitilize the first letter of every word in a string

  116 Solvers