Pergunta de entrevista da empresa Rothesay

Codility: one dp question, one implementation question and another question forgot the content but it was fairly easy if you know the fundamentals The 2x leedcode virtual rounds were a dynamic programming problem and a tree problem respectively. If you solve on time you'll get a follow up on the same question Onsite consisted of: 1 greedy-algorithm type problem, 1 graph problem, a pen on paper min heap problem and discussing my experience.