Round 1 (Telephonic)
Data Structure
1. Write code to find maximum contiguous sum in an array of integers.
2. Write code to find maximum contiguous product in an array of integers.
3. Given a nested listed of integers, return the sum of all integers reverse weighted by their depth.
When I started taking time for it, question was simplified to find weighted by their depth.
For ex: {{1,1}, 2, {1,1}} should return (1*2+1*2) + (2*1) + (1*2+1*2) = 10
Round 2
Whiteboard Coding Round
1. Given a list of tuples representing intervals, return the range these intervals covered.
For ex: [1,3], [2,5], [8,9] should return 5.
2. There is a list of Points given , let's say:
{0,3}, {0,6}, {0,9}, {1, 8}, {1,5} . Find out 3 points whose distance is minimum from a given Point P {1,3}. Focus was to optimize on time complexity.
Round 3
Whiteboard Coding Round
1. Find out maximum no of collinear points in a plane. Also find out the line formed by them.
Round 4
Design Round
1. There is a set of let's say 10 servers which are receiving thousands of client request per second.
There is a function given isMalicious( String ip) which returns true of an ip is malicious.
Server should drop the ip if it is malicious. Design such a system so that call to function isMalicious() is minimum.
Round 5
Host Manager Round
1. Tell me about yourself
2. Describe about the current project and various question on it like what were the challenges faced etc.
3. What are the steps that you will follow if you are assigned some task.
Round 6
Technical Communication
1. Talk about any interesting project that you have done in your career.
2. Lots of questions on project like how it will work in multithreaded environment, why certain design or technology was adopted. Could we have done something better ? etc. etc.
Data Structure
1. Write code to find maximum contiguous sum in an array of integers.
2. Write code to find maximum contiguous product in an array of integers.
3. Given a nested listed of integers, return the sum of all integers reverse weighted by their depth.
When I started taking time for it, question was simplified to find weighted by their depth.
For ex: {{1,1}, 2, {1,1}} should return (1*2+1*2) + (2*1) + (1*2+1*2) = 10
Round 2
Whiteboard Coding Round
1. Given a list of tuples representing intervals, return the range these intervals covered.
For ex: [1,3], [2,5], [8,9] should return 5.
2. There is a list of Points given , let's say:
{0,3}, {0,6}, {0,9}, {1, 8}, {1,5} . Find out 3 points whose distance is minimum from a given Point P {1,3}. Focus was to optimize on time complexity.
Round 3
Whiteboard Coding Round
1. Find out maximum no of collinear points in a plane. Also find out the line formed by them.
Round 4
Design Round
1. There is a set of let's say 10 servers which are receiving thousands of client request per second.
There is a function given isMalicious( String ip) which returns true of an ip is malicious.
Server should drop the ip if it is malicious. Design such a system so that call to function isMalicious() is minimum.
Round 5
Host Manager Round
1. Tell me about yourself
2. Describe about the current project and various question on it like what were the challenges faced etc.
3. What are the steps that you will follow if you are assigned some task.
Round 6
Technical Communication
1. Talk about any interesting project that you have done in your career.
2. Lots of questions on project like how it will work in multithreaded environment, why certain design or technology was adopted. Could we have done something better ? etc. etc.
