I was 3 questions.

1. There was array of boxes and array of units per box. We need to find maximum units that truck can load given maxUnits = k.
2. This was similiar to first one. Given k, we need to remove items from a bag such that least different types of elements remain.
3. Given square array, find max sub-array whose every sub-array sum is less than given K.

I could solve first two in 15 minutes but could not solve the last one as I was getting the TLE. Do you I would clear the first round of interview with only 2 correct given they were solved within 15 minutes.