is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
* Not a bug free, this is the very basic implementation to show my approach to the problem, you have to modify the source when additional cases are added.
* Typecasting the input value to float is not decent to the eyes o_O so please do improve them if you want to use it.
The approach can be breakdown by the following:
* collect the busy schedule/s
* calculate the "available schedule" based on the given busy schedule.
* find the available time intervals between each person using the "available schedules" data.
Output:
- jan.michael.gardose October 22, 2018Alice, Bob => [(0.0, 9.0), (12.0, 13.0), (17.0, 24.0), ]
Bob, Mallory => []
Alice, Bob, Eve=> [(0.0, 9.0), (12.0, 12.5), (18.0, 24.0), ]