There were 5 problems that need to be solved in 90 min . Questions were 1 LC easy 3 LC medium 1 LC hard level . I was able to solve 4 questions  . 

DS/ALGO question were asked . 

1 ) Given a binary array  and a number k, we need to find length of  longest subarray of ‘1’s possible by changing at most k ‘0’s.

2) Print the matrix in spiral order . 

Solved both question  in 1 hour . 

1) Approach for designing API rate limiter 
2) Maximum subarray sum (approach and code)
3) Maximum subarray product(approach and code)
4) Asked about threads in depth .
5)  Write a program using threads .(forgot the complete question)

I was able to solved first three question , had little idea about working of threads and writing code using threads.