Given a set of people, one of them is a celebrity. You have a 2D array which describes which people know each other, that is [N, M] is true if N knows M. The celebrity will not know anyone (except them self) and everyone will know the celebrity. Find an order N algorithm to find the celebrity.
Would I give up my current permanent, long time job for a temp position?
1. Given a array of integers find the index which partitions the array to two with high numbers and low numbers. For example [5, -1, 3, 8,6] the index 3 will partition the array to [5,-1,3] and [8,6] all the numbers in the second partition are greater than first. The solution has to work in O(n).
Do you have passport
what are you looking for in terms of salary?
Why should Deloitte invest in you?
What areas would I be interested in?
Tell me about a time you went above and beyond for a customer?
How many times do you have to flip a coin to have a greater than 50% chance of getting 2H in a row?
1st round HR: basic behavioral questions 2nd tech screen: data structures and an algorithm question that most people should have learned in their algorithms class 3rd tech screen: a simpler algorithm design question, then a really weird data structure question.
Viewing 2671 - 2680 interview questions