The coding questions were as follows:

You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. Given n, find the total number of full staircase rows that can be formed.

(Even binary search was giving TLE for some test cases; only an O(1) solution could pass all the test cases.)

Given a road where an infinite number of cars can drive. The index of the road starts from 0 to n. There are m cars whose starting and ending indexes are given in the form of two arrays. We have to find the maximum gap where the cars never traveled. (This question also had good time and memory constraints.)