NetApp Interview Question Software Engineer / Developers
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
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.
Hash Table :
- JD February 22, 20101> O(1) avg case insertion , deletion & retrieval if load factor is very small .
2> load factor small implies huge size of the table .
3> We cannot print elements in order .
4> If too many collisions occur T.C becomes O(n) for dictionary Operations .
5> Good Hash Functions are difficult to design .
Binary Search Tree :
1> O(logn) T.C for insertion / deletion / search in case of a balanced tree ( AVL or RB )
2> S.C = O(n)
3> Inorder Walk produces the list in ascending order .