Skip to contentSkip to footer

Lead Software Engineer In Test Interview Questions

Salaries
Interviews

5,176 lead software engineer in test interview questions shared by candidates

A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach destination. The rat can move only in two directions: forward and down. In the maze matrix, 0 means the block is dead end and 1 means the block can be used in the path from source to destination. Note that this is a simple version of the typical Maze problem. For example, a more complex version can be that the rat can move in 4 directions and a more complex version can be with limited number of moves.
avatar

Software Development Engineer In Test (SDET)

Interviewed at Microsoft

4★
Aug 2, 2012

A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach destination. The rat can move only in two directions: forward and down. In the maze matrix, 0 means the block is dead end and 1 means the block can be used in the path from source to destination. Note that this is a simple version of the typical Maze problem. For example, a more complex version can be that the rat can move in 4 directions and a more complex version can be with limited number of moves.

One of the difficult question was about solving a puzzle with good algorithm and coding it up as well. I don't recall the puzzle's name now, but the solution involved using linked list (circular), and writing some classes and methods. In the end, testing was also required for this solution.
avatar

Software Development Engineer In Test (SDET)

Interviewed at Microsoft

4★
Nov 19, 2012

One of the difficult question was about solving a puzzle with good algorithm and coding it up as well. I don't recall the puzzle's name now, but the solution involved using linked list (circular), and writing some classes and methods. In the end, testing was also required for this solution.

Create a copy of a singly-linked list. Each node has a value and a next pointer, but also has a pointer to a random node: It can be null, or point to any other node in the list. The solution must take O(n) time and use O(1) space.
avatar

Software Development Engineer In Test (SDET)

Interviewed at Microsoft

4★
Nov 27, 2012

Create a copy of a singly-linked list. Each node has a value and a next pointer, but also has a pointer to a random node: It can be null, or point to any other node in the list. The solution must take O(n) time and use O(1) space.

Viewing 2011 - 2020 interview questions

Glassdoor has 5,176 interview questions and reports from Lead software engineer in test interviews. Prepare for your interview. Get hired. Love your job.