Microsoft Interview Question






Comment hidden because of low score. Click to expand.
0
of 0 vote

Use 2 pointers, A and B and advancing A one node at a time and B two nodes at a time until the last node is reached. If the list is bigger than 2 then if B reaches the last node in its first move then A is at the middle if it reaches the last node in the 2nd move then there is not middle but you have reached the halfway point.

- David Andrews February 28, 2007 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

what if circular linked list?

- likexx November 06, 2007 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

If its a circular linked, you know the first node in the circular list. Check if the 2nd pointer has reached the first node after every traversal.

- Anonymous October 12, 2008 | Flag


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

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.

Learn More

Resume Review

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.

Learn More

Mock Interviews

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.

Learn More