After submitting my resume online, I was given a link to give an online test. The test had 10 questions. The test was basically to check the analytic skills and knowledge about run time complexities.
Fragen im Vorstellungsgespräch [1]
Frage 1
worst case running time to find the element at ith position of an array.
Vorstellungsgespräch absolviert bei LiveRamp (Bangalore Rural)
Vorstellungsgespräch
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.
Ich habe mich online beworben. Der Vorgang dauerte 1 Woche. Vorstellungsgespräch absolviert im Dez. 2016 bei LiveRamp (San Jose, CA)
Vorstellungsgespräch
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.
Fragen im Vorstellungsgespräch [1]
Frage 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.
Ich habe mich über eine Hochschule oder Universität beworben. Der Vorgang dauerte 2 Wochen. Vorstellungsgespräch absolviert im Nov. 2016 bei LiveRamp (San Francisco, CA)
Vorstellungsgespräch
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.
Fragen im Vorstellungsgespräch [1]
Frage 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?
