Algorithm Grid Placement | Dataford Interview Questions

I don't remember exactly, but given an N by N grid representing a farm with cows on it, write a function that would place the cows on the grid to satisfy some requirements.

For this exercise, place exactly one cow in every row and column, with no two cows sharing a diagonal. Return one valid grid, or an empty grid when placement is impossible.

Use def solve_cows(n):. Return an n x n matrix of 0 and 1, where 1 represents a cow.

Constraints

1 <= n <= 14
The output must contain exactly n rows and n columns when a solution exists
Each cell must be either 0 or 1
Return an empty list when no valid placement exists

Function Signature

def solve_cows(n):

Your question is Algorithm Grid Placement. 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