Front End :
Core Engineering (Java/C++):
Developer Tester Teams: D developers, T testers, N team size:
1) Number of ways a team of size N can be arranged where number of developers sitting together are <D; same with T. Its a circular table.
2) Maximum/Minimum sliding window based question
3) Closest Pair; Given lists of x and y coordinates; find the points that are closest; I went with a divide and conquer approach