Me postulé en línea. El proceso tomó 1 día. Acudí a una entrevista en LiveRamp
Entrevista
IMDB 2.0 - Movie DB Table Structure
Your best friend Betty thinks IMDB is too complicated and challenges you to create a simple movie web site. One page will display movies (with movie name, date it was released, and list of actors). Click on an actor and you're taken to the actor page (with actor name, birthday, bio, and list of movies actor has been in). Please outline the relational table structure of the database for this.
Bubble sort is O(n) at best, O(n^2) at worst, and its memory usage is O(1) . Merge sort is always O(n log n), but its memory usage is O(n). Explain which algorithm you would use to implement a function that takes an array of integers and returns the max integer in the collection, assuming that the length of the array is less than 1000. What if the array length is greater than 1000?
Why liveramp?
Otras evaluaciones sobre las entrevistas para el cargo de Software Developer en LiveRamp
"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."
Preguntas de entrevista [1]
Pregunta 1
Average Leetcode Question and its expansion on top of that
Acudí a una entrevista en 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.
Preguntas de entrevista [1]
Pregunta 1
leetcode questions. you will be good if you spend time on solving coding problems. self intro and follow up questions
