1. bishop on 8x8 chessboard: min moves to target or -1. BFS (bishops can move multi-square diagonally, so each move = pick a diagonal direction). 2. reverse a number handling overflow. java int overflow on Math.abs(Integer.MIN_VALUE). use long. 3. AP detection in an array via hashmap. 3 in 1 round. tight

Loading...

Something went wrong while trying to load the full version of this site. Try hard-refreshing this page to fix the error.

Goldman strats - 3 short problems

1.