Candidatei-me online. Fiz uma entrevista na empresa LiveRamp.
Entrevista
Online test then 30 minute phone interview. The phone interview was difficult for me because I haven't learned very much about graphs yet in school, but will most likely be very solvable for someone with more experience with graphs.
Fiz uma entrevista na empresa 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.
Candidatei-me online. O processo levou 1 semana. Fui entrevistado pela LiveRamp (San Jose, CA) em dez. de 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.
Perguntas de entrevista [1]
Pergunta 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.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 semanas. Fui entrevistado pela LiveRamp (San Francisco, CA) em nov. de 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.
Perguntas de entrevista [1]
Pergunta 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?
