Achieve Internet Interview Question


Country: India




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

instead of the next pointer of the last node in a double linked list pointing to NULL and the prev pointer of the head node pointing to NULL, change it this way :-

next pointer of the last node should point to head
prev pointer of the head node should point to the last node

That should do it i guess

- TheMitraBoy April 21, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

You mean you have a circular linked list and want to emulate behavior of doubly-linked?

push, pop and traverse would work the same way except that instead of checking for node->next == NULL (to find the tail) you'd check for node->next == head.

To traverse backwards, go forward a full circle until you hit newnode->next = node.

Alternatively, maintain 2 circular lists, with same payloads, one for the forward links and one for the back links.

- Anonymous April 22, 2012 | Flag Reply


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