Questions regarding Algorithms used for development.
Software Development Engineer In Test Sdet Interview Questions
3,717 software development engineer in test sdet interview questions shared by candidates
The algorithm question was a raise the bar question and I felt it especially hard because brain got tired after a full day of talking.
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.
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.
Be careful when you use str.Split(' '); because it may generate empty strings.
The algorithum question
Difference between calloc() and malloc() synopsys-rd-interview-questions 0 of 0 votes 13 Answers What are the differences between new (in C++) & malloc (in).
Well, I try to use non-recursive method to generate the permutations of a given string, but I forget that I only have 10min to write the code.
c) WAP to Print last n lines of a big log file.
Viewing 1251 - 1260 interview questions