All challenges
Easy 0 solved 0% acceptance

Alphabet Triangle

Print a right triangle of letters where row i spells the first i letters of the alphabet.

What you'll learn

  • Turn a number into a letter by offsetting from 'A'
  • Build rows of growing length
  • Return a pattern as a list of rows

Problem

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.

Constraints

0 ≤ n ≤ 26

Examples

Example 1
Input:
n = 4

Expected output:
expected = ["A", "AB", "ABC", "ABCD"]
Input:
long long n = 4;

Expected output:
std::vector<std::string> expected = {"A", "AB", "ABC", "ABCD"};
Input:
long n = 4;

Expected output:
string[] expected = new string[] {"A", "AB", "ABC", "ABCD"};

Explanation

Each row adds the next letter: ["A", "AB", "ABC", "ABCD"].

Example 2
Input:
n = 1

Expected output:
expected = ["A"]
Input:
long long n = 1;

Expected output:
std::vector<std::string> expected = {"A"};
Input:
long n = 1;

Expected output:
string[] expected = new string[] {"A"};

Explanation

Only A: ["A"].

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Position j in a row (from 0) is the letter j places after A.

Hint 2

Most languages let you add an integer to a character code and turn it back into a character.

Hint 3

Row i is just row i − 1 with one more letter.

Expected complexity

O(n^2) time, O(n^2) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.