2 main algo questions are dynamic-programming requiring recursive implementations. Similar but different questions, and they need you to do everything from implementing helper classes to writing the actual test case AND printing out result in an expected way. Hard to get 100% right given the time limit (but I did just in time)
Sigiloso
just remb the exit conditions, and on recursive calls remember all the different paths the solution would take.