We have a quadtree algorithm and we are assuming that the boxes are labeled 0 (top left), 1 (top right), 2 (bottom left), 3 (bottom right) 'n' times. Write a function that when given an array input of n size (ie. [0,0,0,0] or [0,0,0,0,0,0,0,0,0] would be the top left corner) would determine if the corresponding box has at least one side touching at least one of the outermost walls.
Design a remote control.
Half the questions were unexpected because I didn't expect to be interviewed for an SDET position.
None were too difficult or unexpected. One I hadn't seen before was give all the test cases for a function which accepts a rectangle and a line and tests to see if any point of the line is inside the rectangle
How do you design a good product
Since this is only the first interview, everything was easy
Tree with black and white nodes is given. Find a longest path of white nodes in the given tree.
Find the temperature outside a room without going outside the room. No use of technology Either.
They asks from Data structure algorithms to logic puzzles.
Design a keyboard, test a pen
Viewing 3431 - 3440 interview questions