Python:for n = 7,
sequence = [53, 29, 87, 99, 7, 7, 24, 9, (67, 84, 38, 86, 87, 12, 0), =87=, 28, 16, (55, 13, 86, 57, 34, 31, 89), =55=, 85, 75, 52, 93, 96, 44, 59, 56, 5, 32, 17, 22, (79, 30, 84, 52, 64, 53, 94), =30=, 85, 0, 3, 81, 98, 23, 49, 87, 48]
test says 3 should equal 1
but we have 3 matches:
[67, 84, 38, 86, 87, 12, 0] 87
[55, 13, 86, 57, 34, 31, 89] 55
[79, 30, 84, 52, 64, 53, 94] 30
What I am doing wrong ?

the only no-itertools solution )

Easy task, terrible instructions.

Hint: dont waste your time on it

how stupid is this logic.
after 2 undo and 2 redo x should equal 50.
why it is not like this?

How to round it in JS ??

Same for me

I think yes, it should be optimized a bit

yes, it gives same answer as Dijkstra, but 10 times faster

Python: Random tests: 616 of 616 passed. Fixed tests 2 of 10 passed. How stupid is this 🤯 ?

This comment has been deleted.

shitty tests

I could not reproduce this issuie (maybe you know how to do it? ), but I slightly adjusted that function.