#!process cme OA that shi was horrible
1 messages · Page 1 of 1 (latest)
first you needed to use a heap to push/pop items from the given list
second was just array stuff
third was like a recursive sort of dp prob, wasnt too bad but its just i thought of it in a math approach
i just did that oa. Took me like 30 min to figure out they wanted modulo💀
Also couldnt pass the last test case and I couldn't figure out why
legit wrote out 3 different solutions for dfs, O(n) space dp, and O(1) space dp
actually cooked
actually just realized why now