Interview Question

New Graduate - Software Development Engineer In Test Interview Redmond, WA

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.

Add Answers or Comments

To comment on this, Sign In or Sign Up.