Me postulé a través de una recomendación de un empleado. Acudí a una entrevista en LiveRamp
Entrevista
1. Codility coding challenge. Thought I did poorly since my solution did not satisfy time complexity. However, apparently I did well enough to go onto the next round.
2. 30-minute phone interview: 1 technical question that took almost the entire interview, then behavioral questions. Thought I didn't do that well either on the technical part, but I think my communication with the interviewer saved me.
3. 60-minute phone interview: half behavioral, half technical. Technical questions started easy and got more challenging. This is the last round and I am waiting to hear back from LiveRamp!
Both interviewers were very, very nice.
Preguntas de entrevista [1]
Pregunta 1
Frog question for the coding challenge. It was a more difficult version of the one on Codility though. Also questions about data structure and optimization.
Acudí a una entrevista en LiveRamp (Bangalore Rural)
Entrevista
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.
Me postulé en línea. El proceso tomó 1 semana. Acudí a una entrevista en LiveRamp (San Jose, CA) en dic 2016
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
Me postulé a través de una facultad o universidad. El proceso tomó 2 semanas. Acudí a una entrevista en LiveRamp (San Francisco, CA) en nov 2016
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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?
