Verbalize what you think so that your Interviewer gets an idea of what you think. They may help you with clues. Identify the key to the answer lying in the question. Like in this one we cannot find the total length of linked list without traversing it fully till the end. Then idealize the thought process surrounding it. Such types of questions are sure to be asked, so study data structures very well and then keep on writing it on paper. Once you know the answer they ask for you to write the program on white board. Then tell how all you will be test the program. Think about memory allocations. Think about freeing memory. Put error checks wherever required.

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 In Test (SDET) II 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 In Test (SDET) II at Microsoft:

Find the n the element of a singly linked list without traversing the linked list more than once. Test the program.

Answers & Comments (1)

Flag this {0} as inappropriate

Thank you!

Oops!