A GPS style nearest distance question
Sdet Interview Questions
4,403 sdet interview questions shared by candidates
Lowest common ancestor of two given nodes within a binary tree.
Lots of IQ questions like why are manholes round?
Manipulate linked lists, iteratively and recursively
How would you test a stack of variable Max size?
Discuss how a queue works and how to add and remove items from the queue.
how to test a certain electric device.
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.
Given a 32-bit integer, return a list of all bit positions of that integer that are set to 1.
None
Viewing 1371 - 1380 interview questions