Candidatei-me por meio de recrutador(a). O processo levou 5 dias. Fui entrevistado pela Hibu (Waltham, MA) em jul. de 2013
Entrevista
Very fair interview, basic algorithm questions, java knowledge and SQL. No very tricky questions but comprehensive enough to not feel too easy. Very friendly people and a comfortable environment.
Outras avaliações de entrevista de vagas de Senior Software Engineer da empresa Hibu
Candidatei-me por meio de recrutador(a). O processo levou 1 semana. Fui entrevistado pela Hibu (Bengaluru) em jan. de 2014
Entrevista
I got call from this company for interview. After interview is scheduled, I went for interview. During the first round of interview HR told like your doesn't match with what we are looking.
I can not understand, if my skill is not matching with what is their requirement, how they scheduling the interview. Very bad experience. Wasting of time...
Candidatei-me por meio de recrutador(a). O processo levou 4 semanas. Fui entrevistado pela Hibu (King of Prussia, PA) em out. de 2013
Entrevista
I learned of hibu through a recruiter. He gave the lowdown on what the company was, what the job was, and told me a bit about the hiring manager.
After my resume was submitted (through the recruiter) I had a 30-minute phone screen where I chatted pretty casually with the hiring manager about my experience, what technologies the team works with, etc., and ended up scheduling an in-person interview.
There was a second position for which I'd also phone-screened in similar fashion, so we had interviews lined up for both positions in a 4-hour block. I met with each hiring manager, then two pairs of each manager's employees, who mostly peppered me with technical questions.
One of the hiring managers asked me to code on a whiteboard, and one set of his employees similarly asked me to code on paper.
Perguntas de entrevista [1]
Pergunta 1
I was given a difficult problem in which I had to design an algorithm to meet a certain set of requirements. The challenge here was that it had to meet vert strict requirements of algorithmic complexity of both memory and space--one or the other could be done, but I did not see a way to meet both constraints.