I have completed my Onsite Interview, I dont know what will be the result but lets share the questions with the community.

Round 1: Backtracking - Number of ways to generate pattern passwords in a phone. Went pretty good.

Round 2: Queue: Minimum end time for all the tasks given that each will take fixed amount to get executed and given fixed number of CPUs.
Follow up was to find the minimum CPUs, I gave a NLogN approach but they wanted linear, times up. Everything was good except follow up complexity

Round 3: Googlyness: very good discussions.

Round 4: From all the subarrays, return the kth smallest subarray sum . Array can be having negative numbers too. Only was able to provide brute force approach.

I think its time to look for other opportunities :(