Generate a vector that contains terms that follows a pyramid pattern up to the nth row:
1
2 2
3 3 3
4 4 4 4
....
So if n = 3, then return the vector
[1 2 2 3 3 3]
And if n = 5, then return
[1 2 2 3 3 3 4 4 4 4 5 5 5 5 5]
Avoid using for/while loops.

Solution Stats

140 Solutions

66 Solvers

Last Solution submitted on Mar 31, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments
Loading...