Problema
Instead of stars, this right triangle uses the alphabet. Row i (counting from 1) holds the first i uppercase English letters in order, written next to each other with no spaces: row 1 is A, row 2 is AB, row 3 is ABC. Turning a position into a letter is a matter of adding it to the character code of A.
Implement alphabet_triangle(n).
Input
n: The number of rows (at most 26, one per letter).
Output
Return the rows from top to bottom.
Restricciones
0 ≤ n ≤ 26
Ejemplos
Entrada:
n = 4
Salida esperada:
expected = ["A", "AB", "ABC", "ABCD"]
Entrada:
long long n = 4;
Salida esperada:
std::vector<std::string> expected = {"A", "AB", "ABC", "ABCD"};
Entrada:
long n = 4;
Salida esperada:
string[] expected = new string[] {"A", "AB", "ABC", "ABCD"};
Explicación
Each row adds the next letter: ["A", "AB", "ABC", "ABCD"].
Entrada:
n = 1
Salida esperada:
expected = ["A"]
Entrada:
long long n = 1;
Salida esperada:
std::vector<std::string> expected = {"A"};
Entrada:
long n = 1;
Salida esperada:
string[] expected = new string[] {"A"};
Explicación
Only A: ["A"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Position j in a row (from 0) is the letter j places after A.
Pista 2
Most languages let you add an integer to a character code and turn it back into a character.
Pista 3
Row i is just row i − 1 with one more letter.
Complejidad esperada
O(n^2) time, O(n^2) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.