Algorithm · Uber · Medium
Requirements You receive a rectangular grid whose entries are letters or - characters. Base version (as asked in the interview): every - cell has at least one letter in an orthogonally adjacent cell (Manhattan distance 1). Replace each - with one of its adjacent letters; if several are adjacent, any of them may be used. Clarify with the interviewer what should happen when a - has no adjacent letter (e.g. whether the input guarantees one, or the fill should extend to the…
Checking your access…