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.
1st Approach: Using sorting and then iterating over the array to see which element has an even count.
- skd August 27, 2014Time: O(n lg n)
Space: O(1)
2nd Approach: Use a hashmap to keep a count of the number of times a number occurs. Then iterate over the hashmap to find which number has occured even number of times.
Time: O(n)
Space: O(n) (Worst case: could be if all the elements appear once except one that occurs twice which leads to a space requirement of O(n))
However an approach which could give the correct result in O(n) time and O(1) space is the one i guess is required in this case.