Problem
Start from the solid right triangle where row i (counting from 1) is i characters wide, and keep only its border. Row i is all stars when i ≤ 2 or i = n (the top tip and the bottom edge). Any other row is a *, then i − 2 spaces, then a *.
Implement hollow_right_triangle(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Every row ends with a star, so there are no trailing spaces.
Constraints
0 ≤ n ≤ 100
Examples
Input:
n = 5
Expected output:
expected = ["*", "**", "* *", "* *", "*****"]
Input:
long long n = 5;
Expected output:
std::vector<std::string> expected = {"*", "**", "* *", "* *", "*****"};
Input:
long n = 5;
Expected output:
string[] expected = new string[] {"*", "**", "* *", "* *", "*****"};
Explanation
Rows 3 and 4 are hollow and row 5 is the full bottom edge: ["*", "**", "* *", "* *", "*****"].
Input:
n = 3
Expected output:
expected = ["*", "**", "***"]
Input:
long long n = 3;
Expected output:
std::vector<std::string> expected = {"*", "**", "***"};
Input:
long n = 3;
Expected output:
string[] expected = new string[] {"*", "**", "***"};
Explanation
Row 3 is the last row, so it is solid: ["*", "**", "***"].
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
A row is solid when it is too short to have an inside, or when it is the last row.
Hint 2
Otherwise the row starts and ends with a star.
Hint 3
The number of spaces between the stars is the row length minus 2.
Expected complexity
O(n^2) time, O(n^2) extra space
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.