Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso LiveRamp nel mese di nov 2016
Colloquio
Received a 2 hours coding challenge via Codility. You are given 3 days to complete the online challenge. Phone Interview followup about 3 weeks later. The interviewer seemed uninterested the entire time and went straight into the technical questions.
Domande di colloquio [1]
Domanda 1
Graphs and Kevin Bacon questions during phone interview.
Ho sostenuto un colloquio presso LiveRamp (Bangalore Rural)
Colloquio
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.
Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso LiveRamp (San Jose, CA) nel mese di dic 2016
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso LiveRamp (San Francisco, CA) nel mese di nov 2016
Colloquio
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.
Domande di colloquio [1]
Domanda 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?
