What does this cipher mean? 0(m+n)?

Oh i see, that stuff about how we cant compare objects directly. Thanks.

Where is 'guess switching' operation?

Yeh, i didnt need to construct an object for this, i could simply use array indices @_@

I like this one.

Fails in some random cases, here - i tried to Run few times in fork https://imgur.com/a/jLynhi8

Sorry, since most solutions here are based on sorting and thus mutating, could you elaborate please? What would the best practice here be? And what is 0(n log n) algo as opposed to 0(n)?

Could you share please? XD

It will even throw an error if not an array. @_@

This solution (if console.log removed - since it somehow interferes with test cases limiting them to 4 instead of 201 intended) times out at 1011 (a)
As did mine before I hardcoded 1011.

Is there any way to solve this with recursion approach without hardcoding this edge case?

This solutions starts counting from the left and the one below from the right xD

omfg and here i was agonizing over .every solution