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.
Algorithm:
- veluhariharan July 17, 2017All we need is just the max number of people inside the room, not the actual identity of the people in the room
1) Sort the inputs - start and end taken together and also have a marking whether each of them is a start or an end.
2) If there is a time when are two people who are starting and ending at the same time, the end values should come ahead in the sorted list. Assuming that's what the interviewer wants (clarify this with the interviewer)
3) Use a counter and increment or decrement the counter based on whether its a start or an end time
4) Return the max value the counter can ever get to.
5) Do checks for trivial and special condition viz., empty conf room, indefinite meetings, meeting which run beyond the 24 hr clock and the like.
Will think of the code when I get back time. Please feel free to punch holes in my algo!