Deviopath › JavaScript

N-Queens Count

Hard · Recursion

Place n chess queens on an n x n board so that no two queens attack each other (no two share a row, a column or a diagonal).

Write a function totalNQueens that returns how many different ways this can be done. n is between 1 and 8.

Next: Trapping Rain Water