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.
1. Keep a new counter count=0
- goutham.vidya.pradhan April 19, 20172. Initialize two variables i = 0 and j = size of array - 1
3. Increment count if an occurrence of element is found at position j or i
4. Increment i and decrement j.
5. Repeat step 3 - 4 and exit as soon as i > j
Take care of edge case when i == j, this occurs when array length is odd. in this case increment count only once.
Worst case time complexity is O(N/2) which is less than O(N). Space complexity O(1)