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.
@Will,
- kT January 22, 2013What about if there are negative numbers in the unsorted lists?
The program will then need to cater to that condition as well.
If we can discard printing duplicates as it'll violate the set definition itself here is what I think might work.
Dont increment hash values. Just let them be 1 for +ve numbers for one of the lists. If the same number is found in the other list simply set it to 0.
For -ve numbers hash on the absolute value. But in the hash table set that value as 2 (or something other than 1 and 0).
So if a list had +23 and the other -23, though they'll hash to the same bucket (index) but we'll still be able to determine if we are comparing two different numbers.
Just sharing my thoughts. I might be wrong!
Thanks