Position : L4
Experience : 3 Years

Round : Phone Screening

Problem 1 :Given one struct of time interval with using that i have to return in bool that are they overlapping 2 intervals or not.
struct TimeInterval{
int id ;
int startTime;
int endTime;
};
bool overlapping( TimeInterva t1, TimeInterva t2){}

this problem i completed in 8-10 minutes with dryrun of the test cases;

Problem 2 : Given stream of time interval tell that min how many cars will be used to book for all timeintervals;

Given : {{1,3}, {2,5},{6,8},{7,10},{9,10}}
output :
car1 : {1,3},{6,8},{9,10}
car2 : {2,5},{7,10}

taken 2-3 minutes for building the logic in my mind
I explained the algorithm : 5-7 minutes
written the psuedocode : 5 minutes
completed 80% of the code : 10 minutes
Explained Time complexity and Space Complexity : 2-3 minutes
and Times up

Note : Never opt for Indian Interviewer