Google Phone Screening L4
Summary
I had a phone screening interview with Google for an L4 role, which involved a coding problem about finding free days among a list of blockers with a follow-up about k-availability.
Full Experience
I had a phone screening for an L4 role. The interviewer asked the following question: Q: you are give list of struct blocker; struct { int id; int start; int end; }; and D as range of days for 1 to D; you need to return list of days between 1 to D on which every one is free.
ex : {[1,2,3],[2,5,6]} and D = 6 , first is id, second is start last is end;
your ans = {1,4} cause both person are available on day 1 and 4;
there was one follow up for this return all days where person >= k are avialable.
Interview Questions (1)
Find Days When All Individuals Are Free with K-Availability Follow-up
You are given a list of struct blocker:
struct {
int id;
int start;
int end;
};
and D as a range of days from 1 to D. You need to return a list of days between 1 and D on which every individual is free.
Example:
Input: blockers = {[1,2,3],[2,5,6]}, D = 6 (where the first number is id, second is start day, last is end day).
Output: {1,4} because both persons are available on day 1 and day 4.
Follow-up: Return all days where person >= k are available.