Candidatei-me por meio de recrutador(a). O processo levou 3 semanas. Fui entrevistado pela LiveRamp em nov. de 2015
Entrevista
Completed a coding challenge and a phone interview. Both were algorithmic in nature, but an intro to algorithms class covers the necessary material to ace the questions. The coding challenge was about an hour and a half, and my solution involved the use of a bitmap/boolean array. The phone interview went over some characteristics of BFS and DFS.
Perguntas de entrevista [1]
Pergunta 1
On some directed graph G with O(inf) vertices, find the shortest path P from some vertex A to some other vertex X. Say the length of this path is O(r) and each vertex has O(k) edges out. Find this shortest path using O(rk) space. What is the runtime of your solution?
"The interview process starts with a hiring manager call, followed by the first technical interview, then a second technical interview, and concludes with a final hiring manager discussion covering various topics."
Perguntas de entrevista [1]
Pergunta 1
Average Leetcode Question and its expansion on top of that
Fiz uma entrevista na empresa LiveRamp (San Francisco, CA).
Entrevista
straightforward when i was there. phone screen and an onsite. the on site is whiteboarding algorithms. there is also system design and behavioral sessions. they respond quickly afterward. great team.
leetcode questions. you will be good if you spend time on solving coding problems. self intro and follow up questions.
leetcode questions. you will be good if you spend time on solving coding problems. self intro and follow up questions.
Perguntas de entrevista [1]
Pergunta 1
leetcode questions. you will be good if you spend time on solving coding problems. self intro and follow up questions