All challenges
Easy 0 solved 0% acceptance

Floyd's Triangle

Build Floyd's triangle: the counting numbers written in rows of length 1, 2, 3 and so on.

What you'll learn

  • Keep a counter that lives outside the inner loop
  • Join numbers with a separator
  • Build rows of growing length

Problem

Floyd's triangle fills rows of growing length with consecutive integers starting at 1: row 1 holds 1, row 2 holds 2 3, row 3 holds 4 5 6, and so on. Row i (counting from 1) holds i numbers, and the first number of each row continues right after the last number of the row above.

Implement floyds_triangle(n).

Input

n: The number of rows.

Output

Return the rows from top to bottom. Inside a row, the numbers are written in decimal and separated by exactly one space, with no leading or trailing spaces.

Constraints

0 ≤ n ≤ 100

Examples

Example 1
Input:
n = 4

Expected output:
expected = ["1", "2 3", "4 5 6", "7 8 9 10"]
Input:
long long n = 4;

Expected output:
std::vector<std::string> expected = {"1", "2 3", "4 5 6", "7 8 9 10"};
Input:
long n = 4;

Expected output:
string[] expected = new string[] {"1", "2 3", "4 5 6", "7 8 9 10"};

Explanation

The numbers 1 to 10 fill rows of length 1, 2, 3, 4: ["1", "2 3", "4 5 6", "7 8 9 10"].

Example 2
Input:
n = 1

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

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

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

Explanation

Only the first row: ["1"].

How to approach it

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

Hint 1

Keep one counter that starts at 1 and never resets between rows.

Hint 2

Row i takes the next i values of that counter.

Hint 3

Join the numbers with single spaces so nothing trails at the end.

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.