I wasn't shortlisted for an interview for the SDE Intern (2m) role for the Indian office.

The OA consisted of two questions to be solved in 90 minutes.

The opportunity was only for students in their penultimate year. The OA questions were comparatively easier than those asked for the standard SDE intern role.

The first OA question was a simple binary search question, similar to "Koko Eating Bananas" on LeetCode. Given some parcels initially assigned to n delivery boys, there are k additional parcels which you have to divide among the delivery boys such that the maximum number of parcels carried by a delivery boy is minimized.

In the second problem, given an unsorted array of length n, you can select any subarray of size k (1 <= k <= n) and increase all elements in that subarray by x. You can perform this operation as many times as you want (even zero times). Output the minimum sum of all values of x over all operations, such that the final array is non-decreasing.