Interviewed in summer 2014. Their process was straightforward - two phone rounds. Was asked background question related to my resume and coding questions. The communication was slow from HR end but both the interviewers were easy to talk to.
J'ai postulé en personne. J'ai passé un entretien chez Yahoo
Entretien
I had 2 interviews on campus after meeting a recruiter in a job fair. My gpa was actually lower than their standards but they gave me an interview anyways. They asked me resume questions as well as give me an opportunity to explain why my gpa was low (3.4). Afterwords they asked me simple questions like reversing a linked list, and then asked me questions like what other offers do you have? I was then given the 2nd interview immediately afterwards, to which they asked 3 programming questions, like parsing a regular expression given a string, and designing monopoly and how to determine if a list has no duplicates.
Questions d'entretien [1]
Question 1
Design Monopoly.
Given 2 strings, figure out if one is a reg expression of the other.
examples:
Y-hoo, Yahoo -True
Y*o, Yahoo -> True
**hoo ->Yahoo True
ya-* -> yahoo True
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 semaine. J'ai passé un entretien chez Yahoo (Waterloo, ON)
Entretien
Applied from the University job portal, the interview was set up a week after my application was submitted. The interview consisted of two 30 minute interviews back-to-back with different Software Engineers. First interview was behavioural and basic questions on front end development, and the interview ended with a quick coding question. The second interview was more focused on technical experience, a couple quick questions about projects and past experience and then the majority of the interview was on a coding problem. Overall, good experience.
Questions d'entretien [1]
Question 1
Q1: Given an amount of money m, determine the amount of quarters, dimes, nickels and pennies are needed to get m.
Q2: Design a class for an arbitrary tree, and then given nodes s and t in the tree, find a path from s to t.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Yahoo (Waterloo, ON) en juin 2016
Entretien
There were two back to back in person interviews with 2 different people. One was a rapid fire style technical interview (ie. what is polymorphism?), and the second was an algorithm question.
Questions d'entretien [1]
Question 1
What is the difference between a hash table and a hash set in C?
