J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez LiveRamp en nov. 2014
Entretien
Applied online through their website. They sent me an email the next day telling me to do their online quiz and then a day later, they wanted me to schedule a phone interview.
Questions were mostly on graph algorithms
Autres retours d’entretien d’embauche pour un poste comme Software Engineering chez LiveRamp
J'ai passé un entretien chez LiveRamp (Bangalore Rural)
Entretien
It is just a normal usual interview that happen in the India. So u can join as it is easy to make the point more accurate. So we cN join easy and do the need for ur life.
J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez LiveRamp (San Jose, CA) en déc. 2016
Entretien
I applied online through Angellist. And then, I received an email from the HR, who set up the technical interview after applying. About a week later I got a for the technical interview.
Questions d'entretien [1]
Question 1
The first question was on BFS.
The second question was a brain teaser sort of a question. I had to identify which of the two basketball players will win a round if they try once or ten times.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 semaines. J'ai passé un entretien chez LiveRamp (San Francisco, CA) en nov. 2016
Entretien
Codility test followed by a 30-min phone interview. I found the codility test to be harder than the phone interview. I was asked a degrees of separation question during the phone interview. The guy was friendly, and I thought I had done well (explaining BFS, DFS, and some complexities). It was one of my first interviews, so I was a bit nervous. Anyways, I didn't pass the second round.
Questions d'entretien [1]
Question 1
General BFS question: given a random Wikipedia article, how do you find the shortest possible way to reach the liveramp article by clicking the links on the pages? What data structures do you need? What if you had an API that gives you the list of links in a wikipedia article? Space/time complexities? What if you didn't care about time complexity, but wanted to lower space complexity?
