We use 2 pointers, increment pointer (p1) by 1 and the (p2) by 2. When the p2 reaches the end of the list then p1 is on the middle element of the list.

Helpful Answer?

Yes | No

Inappropriate?

To comment on this question, Sign In with Facebook or Sign Up

You might also be interested in: Interview Questions, Research Associate Interview Questions, Evalueserve Interview

Evalueserve Overview

Edit

Website www.evalueserve.com

HQ Gurgaon, India

Industry

Market Research & Polling Services

Size

3,000+ Employees

Interviews by Company

Salaries by Company

Tags are like keywords that help categorize interview questions that have something in common.

About Us | Feedback | Help

Glassdoor ® is a registered trademark of Glassdoor, Inc.

Overview

Salaries

Reviews

Interviews

Photos

Jobs

Connections

15 Interview Reviews |

Interview Question for Research Associate at Evalueserve:

How would you traverse a linked list with n objects in such a way that you reach the middle of the list in less than n iterations?

Answers & Comments (1)

Flag this {0} as inappropriate

Thank you!

Oops!