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 the array has exactly 0 or 1 duplicate then it can be found in O(N) time and O(1) space complexity if it is an array of char or int.
- sundarrajanvyas June 22, 2015Step1 : Sum the array .If it is char array convert to ascii no and sum the array up.
Step 2: XOR the array and compare this value with sum from step 1.
if (sum from step1 == sum from step2) {
return no duplicates
}
else {
return ascii (step1 - step2)/2;
}