very clever. never thought of this.

Read this for more info

For min/max, it's probably not possible to go below O(n), I guess?

If the board has already been solved by the selected player return the index position of the first free space in the board.

This is not tested in fixed tests, and only sometimes appear in the random tests.

thanks! Though I just wanted to speed run some easy kata so my solution is highly unoriginal

Lmao I just saw your solution; good one.

Interesting approach. Not best practice but damn interesting, reminds me of bubble sorting! Very clever though.

reminds me of bubble sort

r

This is an interesting solution.

this reminded me of programing with C. Good job

interesting solution!

Why is this long winded block of code best practice ?

Apparently I was wrong, I changed names, I did not think you could use a keyword as the name of a function, that could lead to bugs or flaws I assume