31
\$\begingroup\$

The Challenge

Your task is to create a program or function that outputs the following with no input:

a
bb
ccc
dddd
eeeee
ffffff
ggggggg
hhhhhhhh
iiiiiiiii
jjjjjjjjjj
kkkkkkkkkkk
llllllllllll
mmmmmmmmmmmmm
nnnnnnnnnnnnnn
ooooooooooooooo
pppppppppppppppp
qqqqqqqqqqqqqqqqq
rrrrrrrrrrrrrrrrrr
sssssssssssssssssss
tttttttttttttttttttt
uuuuuuuuuuuuuuuuuuuuu
vvvvvvvvvvvvvvvvvvvvvv
wwwwwwwwwwwwwwwwwwwwwww
xxxxxxxxxxxxxxxxxxxxxxxx
yyyyyyyyyyyyyyyyyyyyyyyyy
zzzzzzzzzzzzzzzzzzzzzzzzzz

Scoring

This is , so the shortest answer in each language wins.

\$\endgroup\$
  • 4
    \$\begingroup\$ Output as list of lines? \$\endgroup\$ – totallyhuman Nov 8 '17 at 22:19
  • 5
    \$\begingroup\$ Can we use the uppercase alphabet instead? \$\endgroup\$ – Uriel Nov 8 '17 at 22:20
  • 9
    \$\begingroup\$ I was missing alphabet challenges! (but don't let Leaky Nun know) \$\endgroup\$ – Luis Mendo Nov 8 '17 at 22:32
  • 9
    \$\begingroup\$ I worked very hard checking if it was a dupe and apparently it isn't \$\endgroup\$ – Blue Nov 8 '17 at 22:35
  • 4
    \$\begingroup\$ @totallyhuman that's up to you. \$\endgroup\$ – SpookyGengar Nov 8 '17 at 23:31

96 Answers 96

1 2 3
4
0
\$\begingroup\$

Whitespace, 127 bytes

Because the syntax is entirely in whitespace characters, each character is prefixed with S, T, or L (for Space, Tab, and Linefeed, respectively).

S S S T	L
L
S S L
S L
S S L
S S S S T	T	S S S S S L
T	S S S L
S S T	L
S L
S T	L
S S S L
T	S S S T	L
T	S S T	S L
S L
T	S T	S L
S L
T	L
S L
T	L
L
S S T	S L
S L
L
S L
L
S S S T	S T	S L
T	L
S S S S S T	L
T	S S S S L
S S S S T	T	S T	T	L
T	S S T	L
T	T	L
L
L
L

Try the whitespace-only version online!

| improve this answer | |
\$\endgroup\$
0
\$\begingroup\$

Julia, 42 36 bytes

[println(l^(l-'`')) for l∈'a':'z']

| improve this answer | |
\$\endgroup\$
0
\$\begingroup\$

K4, 13 bytes

(1+!26)#'.Q.a

Output:

q)k)(1+!26)#'.Q.a
,"a"
"bb"
"ccc"
"dddd"
"eeeee"
"ffffff"
"ggggggg"
"hhhhhhhh"
"iiiiiiiii"
"jjjjjjjjjj"
"kkkkkkkkkkk"
"llllllllllll"
"mmmmmmmmmmmmm"
"nnnnnnnnnnnnnn"
"ooooooooooooooo"
"pppppppppppppppp"
"qqqqqqqqqqqqqqqqq"
"rrrrrrrrrrrrrrrrrr"
"sssssssssssssssssss"
"tttttttttttttttttttt"
"uuuuuuuuuuuuuuuuuuuuu"
"vvvvvvvvvvvvvvvvvvvvvv"
"wwwwwwwwwwwwwwwwwwwwwww"
"xxxxxxxxxxxxxxxxxxxxxxxx"
"yyyyyyyyyyyyyyyyyyyyyyyyy"
"zzzzzzzzzzzzzzzzzzzzzzzzzz"
| improve this answer | |
\$\endgroup\$
0
\$\begingroup\$

Dart, 81 bytes

List.generate(26,(i)=>''.padRight(i+1,String.fromCharCode(i+97))).forEach(print);

Try it online!

| improve this answer | |
\$\endgroup\$
0
\$\begingroup\$

Pyth, 9 8 bytes

m*dhxGdG

Try it online!

m*dhxGdG
m      G  Map through the alphabet, with current letter as variable 'd'
   hxGd   Index of d in alphabet, + 1
 *d       Repeat current letter ↑ that many times.

VUG*hN@GN

In English; utilizing G as a auto-initialised variable of the alphabet:
Loop through list of 0-25:
print (i++ * letter at index i)

| improve this answer | |
\$\endgroup\$
0
\$\begingroup\$

Rockstar, 51 bytes

X's0
while X-26
build X up
cast X+96 into C
say C*X

Try it here (Code will need to be pasted in)

| improve this answer | |
\$\endgroup\$
1 2 3
4

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.