Candidatei-me online. O processo levou 4 semanas. Fui entrevistado pela Bloomberg (New York, NY) em jan. de 2015
Entrevista
I began the application process by first submitting my resume online. Afterwards, a recruiter reached out to me to setup a quick technical phone call. The call asked some general technical questions about data structures and then a longer programming problem. I then got a follow-up email, asking if I'd be free on a given day to come into the office for some additional interviewing. This half-day interview on-site consisted of two interviews, back-to-back. Asked technical question.
Perguntas de entrevista [1]
Pergunta 1
Given the heads of two linked lists that eventually merge, how can you determine at which node they merge
Fiz uma entrevista na empresa Bloomberg (New York, NY).
Entrevista
First round was a phone interview with a developer in the company. I was asked to login to a web app which was a programming environment. The screen was shared as the phone was on speakerphone. .
Perguntas de entrevista [1]
Pergunta 1
Output the each digit of the number "356243234" backwards and individually without using the string library.
Candidatei-me por meio de recrutador(a). O processo levou 1 semana. Fui entrevistado pela Bloomberg em out. de 2015
Entrevista
Pretty straightforward. A technical phone interview followed by an on-site interview. For technical phone interview: Brush up algorithms, data structures. Practicing on HackerRank or similar sites (InterviewCake, Codility) may also help.
Perguntas de entrevista [2]
Pergunta 1
Q: Asked about my background, experience, interests... past two internships, If I'm a backend/frontend developer.
Q: For the technical round, the question was how do you validate a string is valid/has parenthesis balanced? For example, "{}", "{}(){}[]", "[{(abcbc)}]", "abcd" are all balanced strings, whereas "{a", "{(})", "{a]", etc. are not.