CTC Offered:
Base Pay: 21,00,000 Rs.
New Hire Equity: Approx 11000 vested over 4 years
Joining Bonus: 3,50,000 Rs.
Round 1(45 min DSA):
Question:
You and your friends discuss a pattern of number your teacher has written on blackboard after class. Return false if there is any contradiction between you and your friends, in sequencing of numbers, else return true.
For e.g Suppose 4 friends write a sequence of numbers
Friend 1: 1, 3, 4, 2
Friend 2: 3, 4, 9, 10
Friend 3: 11, 49, 13, 3
Friend 4: 19, 3, 13, 4
Ans. False, there is contradiction
Round 2(45 min DSA + 15 min HR):
Question:
Suppose you have given a task to schedule meetings in your office. You have to merge any meeting if they coincides, apart there is a DND interval in which you can't schedule any meeting. If any meeting has time overlapping with DND you have to break it.
You have to do it in
Time Complexity: O(n*log(n))
Space Complexity: O(1)
For e.g
Meeting : [[1, 4], [3, 5], [9, 12], [7, 10]]
DND: [3, 5]
Ans. [[1, 3], [7, 12]]
Round 3(45 min DSA + 15 min HR):
There were 4 questions based on follow up, which I don't remember
Difficulty ranged from Easy to Hard.
It was an oncampus opportunity from Google at my College.