-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 75
#2017
##ApplicationDeveloper
##Off-Campus
1st round:
-
find middle element of a dynamic array ( basically a linked list).
-
Two lighthouses on different island. rpm of first light house is n minutes and second is m minutes. both flashes each other at 0th min then after what time the meet again. solve and apply oops concept.
2nd round:
-
Discussion on many web technologies and many networking core topics like protocols, OSI and tcp/ip suit, how internet works and routing, domains, DNS, server technologies.
-
Design your own database and explain all data structures and design patterns you will use.
3rd round:
-
Discussion on projects.
-
Core OS concepts mostly semaphores (with implementation), locking techniques and dead locks.
-
Find length of the largest region in Boolean Matrix and discussion on complexity.
-
Implement git diff algorithm.
4th round.
1.Given N points on the plane, what is an efficient algorithm to find all the sets of 3 or more co-linear points. (Proper implementation).