Я думал тут нет русских) я вместо алгоритма по поиску по этажам, просто гонял лифт туда сюда и конвеером их расфасовывал и + 1 условие на то проверку надо лифту тут открыть двери нет, а так крут)

even simple test case of 121111111 would knock it out but none of them were made to catch simple brute force loops

I agree! But I wrote a universal code for the nxn square. And Yes my code stinks of shit but it works on a local machine.I will do refactoring

It's 2kyu for a reason. You'll need a faster method.

I have tests passed but atempt is timeout WTF

WTF its not working:
new int[0]{}, // G
new int[]{2}, // 1
new int[]{3,3,3}, // 1
new int[]{1}, // 1
new int[0]{}, // 1
new int[0]{}, // 1
new int[0]{}, // 1

not ideal

It's bug. This solution is not clever. For a big numbers.Tiomeout bitch