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.
solution without using hash tables with time complexity o(n)
- akkaiah.j July 07, 2014Here we need to find two elements whose sum is equal to half of total sum.
solution:
initially i would check whether the sum of total elements in array is even or not,then i would check whether the sum of first and second largest elements is greater than half of total sum or not.If these cases are satisfied(total sum -even and second case),i will check for elements which are equal or greater than 1/4 of total sum and less than 1/2 of total sum.After finding these elements(i may get at a maximum of 4 elements of these kind),i will check for elements corresponding to these elements whose sum is equal to 1/2 of total sum