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.
if space complexity is not the issue ,u can use Hashset . First insert all the element then for each element search its next or previous if anyone present .If any one present delete both from the HashSet and increase the counter accordingly and search for next element .For each new element make count=0,also make track of max count .complexity O(n) both in space and time
- gowin August 18, 2013