Fill Diagonals of Matrix | Dataford Interview Questions

Fill the diagonals of an n by n matrix with ones.

Given a positive integer n, return an n x n matrix containing zeros everywhere except the main diagonal and the anti-diagonal, which must contain ones. When both diagonals intersect, the shared cell remains one.

Input: integer n. Output: a list of n lists, each containing n integers.

Constraints

1 <= n <= 1000
The output must contain exactly n rows and n columns
Each output value must be either 0 or 1

Function Signature

def fill_diagonals(n):

Your question is Fill Diagonals of Matrix. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Fill the diagonals of an n by n matrix with ones.

Input: integer n. Output: a list of n lists, each containing n integers.

Constraints

1 <= n <= 1000
The output must contain exactly n rows and n columns
Each output value must be either 0 or 1

Function Signature

def fill_diagonals(n):

Your question is Fill Diagonals of Matrix. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.