I was there at 5am today and yes, I got the server errors for a while too. My part 2 solution was similar to yours - just remove each element in turn and test. Not very efficient but I have the day job and an evening event so this is the only time I have to do the puzzle!
Do you know how you would solve this more efficiently ? In pseudo code or English I mean? ( I have roughly the same logic you did in this one, just slower aha )
i think you could do a dynamic program where the state is (index in sequence, allowed to remove, is increasing). you have to check if the subsequence of everything up till before the last index is safe, and whether the last gap is good. if it's not, try removing the last or second-to-last index (if you're allowed to).
I was there at 5am today and yes, I got the server errors for a while too. My part 2 solution was similar to yours - just remove each element in turn and test. Not very efficient but I have the day job and an evening event so this is the only time I have to do the puzzle!
Do you know how you would solve this more efficiently ? In pseudo code or English I mean? ( I have roughly the same logic you did in this one, just slower aha )
i think you could do a dynamic program where the state is (index in sequence, allowed to remove, is increasing). you have to check if the subsequence of everything up till before the last index is safe, and whether the last gap is good. if it's not, try removing the last or second-to-last index (if you're allowed to).