The test was for 2 hrs and had 3 questions.

1. Given a circular array, find the subarray of a certain length k which has the larget sum.
2. Given an array of points on XY plane, find the largest number of points which lie on a line.
3. Given a NxN matrix, find the maximum of all KxK submatrices in it and store them. Then with respect to another number, find the number of maximums which are larger than t and the maximum which is closest to t