Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 4 semanas. Acudí a una entrevista en LiveRamp
Entrevista
I submitted my name at a college internship fair, and got an email from a recruiter a couple of weeks later. I emailed them my resume and heard back with an offer for an online interview a few days later. I completed the one hour long online interview, mostly on algorithm questions, and heard back a few days later to set up a phone interview. After the phone interview, I received an email saying they had decided not to move forward with my candidacy.
Preguntas de entrevista [1]
Pregunta 1
How do you implement BFS on a graph if there's no clear lexicographic ordering of the nodes?
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.
Envié una solicitud electrónica. El proceso duró 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.
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 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?
