Example $2$ :

Constraints:

$1k$ houses. length $100$

$1$ houses $[$i$]{10}^4$

All the integers of houses are unique.Given the array houses where houses $[$i$]$ is the location of the $i^{th}$ house along a street and an integer $k,$

allocate $k$ mailboxes in the street.

Return the minimum total distance between each house and its nearest mailbox.

The test cases are generated so that the answer fits in a $32-$bit integer.

Example $2$: Alice and Bob take turns playing a game, with Alice starting first.

Initially, there are n stones in a pile. On each player's turn, that player makes a move consisting of removing any

non$-$zero square number of stones in the pile.

Also, if a player cannot make a move, he$/$she loses the game.

Given a positive integer $n,$ return true if and only if Alice wins the game otherwise return false, assuming both

players play optimally.

Example $1$:

Example $2$:

Example $3$: