At the beginning the read my resume and after that, they sent me an email to have an initial interview with me, I enjoyed it, later they sent me an email with a code exercise to solve and was not difficult, then they called me for a code exam with them about algorithms and software engineering. They also checked my github's repositories.
Interview questions [1]
Question 1
I think the one related with strings in data structures were more difficult.
I applied online. The process took 4 weeks. I interviewed at Ooyala (Mountain View, CA) in Jan 2014
Interview
Was contacted by one of their tech recruiters and she then went onto schedule me a HR interview. HR interview went fine and I was told that they would have three rounds of technical interviews. I was really impressed by the interview process as a whole because my recruiter was really prompt at getting back to me after each round.
After each round, she got back to me telling me that the interview went well. Finally after the three rounds of technical interview, I was told that she would get back to me soon. Later, the next day, my recruiter called me up and told me that they had decided to give me an offer.
More importantly, all the engineers who interviewed me were really nice and totally gave a positive outlook to the company.
Interview questions [1]
Question 1
I believe that I must respect the company and its impressive interview process by not giving away explicit details about their interview questions. But either way, I certainly believe that if you have taken a good data-structures level course from a school with a good CS program, then you should probably be good to go.
I applied through university. The process took 2 weeks. I interviewed at Ooyala (Mountain View, CA) in Feb 2012
Interview
I submitted my resume at a career fair. Two weeks later, I was invited for an onsite interview that lasted for an hour. About fifteen minutes after the interview, I received an offer on the spot.
Interview questions [2]
Question 1
Write a function to validate the integrity of a binary search tree.