Nice. Similar to mine, but slightly more efficient. Wise use of the for loop. I chose a while loop, which required one more variable than is necessary with the for loop.

And your solution just looks cleaner than mine. Less clutter, simpler variable names. Nice work.

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 ?