I applied online. The process took 4 weeks. I interviewed at Ooyala (Guadalajara, Jalisco) in Feb 2016
Interview
First I did a hacker rank test. I did one interview on phone call and finally I did an interview at the offices. The test really were cool and hard, I enjoyed them.
Interview questions [1]
Question 1
Solve a hacker rank test with four questions. For example, an lexical analyzer for parenthesis.
I applied online. The process took 4 weeks. I interviewed at Ooyala (Guadalajara, Jalisco)
Interview
The process took longer than expected. One online automated test, two online tests with Ooyala engineers, one onsite test (~5 hours) and several phone screenings with the recruiter and the manager of the team I was selected to join. The onsite test wasn't to evaluate my problem solving capabilities only, but also my time management and effort management.
6
Ooyala response
10y
Welcome to Ooyala! Looking forward to meeting you in person.
I applied through a recruiter. The process took 4 days. I interviewed at Ooyala (Santa Clara, CA) in Oct 2015
Interview
I was contacted by a recruiter and the process from then to the finish was 4 days long. I had 2 phone screens, first one with the team lead and the second with another engineer on the team. Fairly easy in difficulty, not too bad. I was called on site the following day for about 5 rounds of interviews that lasted from the morning till 4pm. Everyone here was pretty laid back and relax. The work environment looked awesome and so does the general community of Ooyala. Most of the in person interviews were not so bad, however there were some difficult ones. The recruiter was really nice and so were the employees at Ooyala, the entire process was neat. Unfortunately, they said that I was in the middle of a hire and no hire so they decided not to hire.
Interview questions [5]
Question 1
Given an unsorted list of integers, from 1 to N, find the duplicate number. (There is only one duplicate)
There are 2 input files given, with no relation to one another. One file is encrypted with some mapping that is unknown while the other is a book written by Shakespeare. Write an algorithm that finds the map that decrypts the the encrypted file. Some rules to know are that only characters 'a'-'z' and 'A'-'Z' are encrypted, all other characters are left alone. And no two characters have the same encrypted mapping, that is to say that the mapping is one-to-one.
Given an n x m matrix [ [1, 2, 3], [4, 5, 6], [7, 8, 9] ] print out the spiral matrix. That is, return all the elements of this matrix in spiral order.
So sorry it ended up not being perfect match. Please keep in touch as we have an ever changing set of open reqs. Perhaps a future role will be a good match. Thanks for the feedback
Top companies for "Compensation and Benefits" near you