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.
Hi,
- gurha.pallav June 01, 2010The place where you Choose ArrayList over LinkedList are as followed:
1. When you are getting the elements from the ArrayList by index. Which is faster and the complexity is O(1) as it just goes and fetches the element required.
2. When you are always doing insertions from the List at the End, rather than doing insertions and deletions in between the list.
The place where you choose LinkedList over ArrayList is
1. When you are doing lot of insertions and deletions in the List in between. So in the case of LinkedList you just go to that particular location and just change few pointers and your work is done. Whereas in the case of ArrayList after the element is deleted from the ArrayList in between, then the whole list has to be moved to occupy the empty space in case of deletion and to move all the elements in the List one index ahead in case of Insertions.
So, these are the places where you need to choose between ArrayList And LinkedList.
-Pallav