# N-Rooks

You’ve got an integer `n`

representing a chessboard of size `n`

x `n`

. Return the number of ways you can place `n`

rooks, such that no two rooks attack each other.

Two ways are considered different if in one of the ways, some cell of the chessboard is occupied, and in the other way, the cell is not occupied.

Note: two rooks are attacking each other if they are either on the same row or on the same column.

https://binarysearch.com/problems/N-Rooks

## Examples

### Example 1

**Input**

- n =
`3`

**Output**

- answer =
`6`

**Explanation**

Here are the different chessboard configurations, where `X`

is a rook.

```
X O O
O X O
O O X
X O O
O O X
O X O
O X O
X O O
O O X
O X O
O O X
X O O
O O X
O X O
X O O
O O X
X O O
O X O
```

## Leave a comment