S&P Capital IQ


Interview Question

Software Engineer Interview

In an nxn grid of ones and zeros, turn all squares in a

  manhattan distance of k from any 1 into 1s, yielding an algorythm of complexity O(n2).

Add Answers or Comments

To comment on this, Sign In or Sign Up.