i felt you on the first question, i gave this contests 30 minutes after waking up from a 5 hour sleep and for the first 2 minutes i could not understand what the first question wanted from me lol
Can’t believe it. I solved 3 using recursive dp just doing nums[i] * state + dp(i+1, state * -1) and the other is nums[i] + dp(i+1, -1). Then take best of the two and return best; cache the function as well. I was scrolling through the other solutions in the ranking page and I was like how did no one else do this? Then I realised this is probably not very efficient.😂
How did you do this contest?
Got 3 during the contest, solved #4 within 10 min after the contest
I was never there 👻😶🌫️
i felt you on the first question, i gave this contests 30 minutes after waking up from a 5 hour sleep and for the first 2 minutes i could not understand what the first question wanted from me lol
Can’t believe it. I solved 3 using recursive dp just doing nums[i] * state + dp(i+1, state * -1) and the other is nums[i] + dp(i+1, -1). Then take best of the two and return best; cache the function as well. I was scrolling through the other solutions in the ranking page and I was like how did no one else do this? Then I realised this is probably not very efficient.😂
couldn't do 3
came here for solution
I still have unsolved problems from last year😂 should probably get round to those