Candidatei-me por meio de recrutador(a). Fui entrevistado pela Rothesay (Londres, Inglaterra) em abr. de 2024
Entrevista
It was quick and fast response.
Well organised and professional.
Enjoyed the very first and second rounds. And the 3rd round is relatively down. The claim that they recruit good developers and do not care about the language. But I guess at the end it does play a critical part especially at the end of selection process.
Candidatei-me por meio de uma agência de recrutamento. O processo levou 4 semanas. Fui entrevistado pela Rothesay em nov. de 2024
Entrevista
First stage, 3 online Codility tests. Next stage, 1 Zoom Codility test. Next stage, 3 Zoom Codility tests. Bearly a single question about my experience and no other technical questions, just one totally unrepresentative, time-pressured coding exercise after another. Unless they actually sit around racing through contrived coding exercises all day this was a total waste of their time and mine. Or maybe this one-dimensional recruitment policy is a true reflection of one-dimensional work at a one-dimensional company.
Perguntas de entrevista [1]
Pergunta 1
They didn't ask me anything beyond a cursory "what are you looking for" before diving into the next Codility tests.
Candidatei-me online. O processo levou 3 meses. Fui entrevistado pela Rothesay em ago. de 2024
Entrevista
Codility
2 virtial rounds solving leetcode type problems
Onsite consisting of two leetcode interviews and one pen on paper interview with a business problem that basically reduces to a leetcode problem. Discussing your experience and projects you've worked on in detail during the onsite
Another final onsite where you talk to CTO, tech recruiter, HR and a non business person. The CTO and tech recruiter may ask pretty much the same questions
Perguntas de entrevista [1]
Pergunta 1
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.
