Just traverse through both the lists once, say m and n are the length of the lists, get abs(m-n) say k, traverse k nodes in the bigger list, then keep on traversing one by one in both lists till a node matches. The first node that matches is the convergence point.

Helpful Answer?

Yes | No

Inappropriate?

0 of 2 people found this helpful

Dec 10, 2011

by Ja:

A faster approach is to store all elements of one list in a hashtable, then traverse the other list checking each node to see if it exists in the hashtable - if it does, you've got the convergence point.

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, Software Development Engineer Interview Questions, Microsoft Interview

Microsoft Overview (MSFT)

Microsoft – Redmond – “Dine and shop on campus, and discover some…”

Microsoft – US – “Bellevue Bravern Entrance”

Website www.microsoft.com

HQ Redmond, WA

Industry

Development Tools, Operating Systems & Utilities Software

Size

90,000+ Employees, $62B+ Revenue

Competitors

Apple, Oracle, Google

Microsoft – Why Work for Us?

Amazing things happen here! From gamers to governments, moms to mega-corporations, Microsoft helps customers all over the globe to realize their potential. Many people think Microsoft = software. Yes, we do… — Full Overview

Provided by employer [?]

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

1,272 Interview Reviews |

Interview Question for Software Development Engineer at Microsoft:

Find a convergence point if any in given two linked lists.

Answers & Comments (2)

Flag this {0} as inappropriate

Thank you!

Oops!