Checkpoint: follow the path

Implement int firstRepeat(int[][] grid, int row, int col): each cell holds 10*row + col. Starting at (row, col), jump to the cell it names; return the code of the first cell visited twice, or -1 if a jump leaves the grid. Cap steps at 2 × cell count. This is a traced walk: maintain the visited knowledge, one jump per iteration.