Problema
Use a board whose top-left square is white. Rows and columns start at 0 at the top left. Adjacent squares alternate colors. Return empty text for a position outside the board.
Implement chess_square_color(column, row).
Input
column: The column, counted from the left starting at 0.
row: The row, counted from the top starting at 0.
Output
Return white, black, or an empty string for invalid coordinates.
Restricciones
−10 ≤ column, row ≤ 20. Valid board coordinates are 0 through 7.
Ejemplos
Entrada:
column = 2
row = 3
Salida esperada:
expected = "black"
Entrada:
long long column = 2;
long long row = 3;
Salida esperada:
std::string expected = "black";
Entrada:
long column = 2;
long row = 3;
Salida esperada:
string expected = "black";
Explicación
Five steps from the white corner change color an odd number of times.
Entrada:
column = 8
row = 0
Salida esperada:
expected = ""
Entrada:
long long column = 8;
long long row = 0;
Salida esperada:
std::string expected = "";
Entrada:
long column = 8;
long row = 0;
Salida esperada:
string expected = "";
Explicación
Column 8 is outside the valid range 0 through 7.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Square color alternates with moves across rows and columns, so only the coordinate pattern matters.
Pista 2
A parity check on row and column can tell you which color to return.
Pista 3
Return empty text immediately when either coordinate is outside the 0 to 7 board range.
Complejidad esperada
O(1) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.