I applied online. I interviewed at AOL (Bellevue, WA) in Jun 2016
Interview
Was hired first as a contract to hire for 6 months before becoming a full time employee, so the interview questions are probably a lot easier compared to a candidate interviewing for a full time position.
1. Contracting company recruiter talk
2. Phone screen from AOL
3. Onsite interview, 3 rounds
Interview questions [1]
Question 1
Relatively simple and easy questions.
Phone interview:
1. Given a positive integer n, implement a function that returns the nth number in the fibonacci sequence
Onsite interview:
1. First the interviewer asked me how to implement a function that checks if a sudoku table is valid or not, but since I worked on this question the night before, he gave me a different one. Given an array of integers, where each integer represents the color of the ball, how can you sort the array so that, red balls are first, then blue ball, then green balls.
2. Cant remember the exact question but it was a recursive solution. Basically you are given a JSON object and you basically want to recurse through each property and print value depending on the value of the property.
3. I cant remember this exactly but it was copying some array in C.
Online only, typeform like questions and answers. not too hard, and plenty room to answer the questions. not sure if they received, etc notes notes notes notes many notes to enter. Just want to look at something
Interview questions [1]
Question 1
Give an example of a time where you experienced a challenge and how you over came it
I applied through university. I interviewed at AOL
Interview
Talked with CTO and senior product manager about previous experience. No tech questions. They talked a lot about how interns works at AOL area 51, what they offer to interns and what they expect from interns.
The First round was behavioral talking to the manager over the phone and discussing your previous project and work experience. It lasted for 30 minutes. The second round was an online coding test via Hackerrank.