Build an Alphabet Pyramid

Question

Today we're going to build a pyramid out of letters! Here's an example letter pyramid for the first 5 letters:

Write the first 5 letters with a space between, first ascending and then descending.
```
A B C D E D C B A
```
Do the same thing for the first four letters on the line above, but with two extra leading spaces:
```
  A B C D C B A
A B C D E D C B A
```

Repeat the same step until the last line is just 'A'

        A 
      A B A
    A B C B A
  A B C D C B A
A B C D E D C B A

Repeat steps two and three going down instead of going up:

        A 
      A B A
    A B C B A
  A B C D C B A
A B C D E D C B A
  A B C D C B A
    A B C B A
      A B A
        A

This same pattern can be extended up to 26 characters. Your challenge is to write a program or function that takes an integer as input, and produces the corresponding letter pyramid. You can choose to use uppercase or lowercase characters. You may always assume that the input will be an integer in [1, 26], and the output may be any reasonable format for a 2d string. For example, a string with newlines in it, an array of characters, printing to a file, etc. Each line may have trailing spaces on it, and you may optionally output one trailing newline.

Here are some example inputs/outputs:

1:

A

2:

  A
A B A
  A

3:

    A
  A B A
A B C B A
  A B A
    A

5:
        A 
      A B A
    A B C B A
  A B C D C B A
A B C D E D C B A
  A B C D C B A
    A B C B A
      A B A
        A 

13:


                        A
                      A B A
                    A B C B A
                  A B C D C B A
                A B C D E D C B A
              A B C D E F E D C B A
            A B C D E F G F E D C B A
          A B C D E F G H G F E D C B A
        A B C D E F G H I H G F E D C B A
      A B C D E F G H I J I H G F E D C B A
    A B C D E F G H I J K J I H G F E D C B A
  A B C D E F G H I J K L K J I H G F E D C B A
A B C D E F G H I J K L M L K J I H G F E D C B A
  A B C D E F G H I J K L K J I H G F E D C B A
    A B C D E F G H I J K J I H G F E D C B A
      A B C D E F G H I J I H G F E D C B A
        A B C D E F G H I H G F E D C B A
          A B C D E F G H G F E D C B A
            A B C D E F G F E D C B A
              A B C D E F E D C B A
                A B C D E D C B A
                  A B C D C B A
                    A B C B A
                      A B A
                        A


26:

                                                  A
                                                A B A
                                              A B C B A
                                            A B C D C B A
                                          A B C D E D C B A
                                        A B C D E F E D C B A
                                      A B C D E F G F E D C B A
                                    A B C D E F G H G F E D C B A
                                  A B C D E F G H I H G F E D C B A
                                A B C D E F G H I J I H G F E D C B A
                              A B C D E F G H I J K J I H G F E D C B A
                            A B C D E F G H I J K L K J I H G F E D C B A
                          A B C D E F G H I J K L M L K J I H G F E D C B A
                        A B C D E F G H I J K L M N M L K J I H G F E D C B A
                      A B C D E F G H I J K L M N O N M L K J I H G F E D C B A
                    A B C D E F G H I J K L M N O P O N M L K J I H G F E D C B A
                  A B C D E F G H I J K L M N O P Q P O N M L K J I H G F E D C B A
                A B C D E F G H I J K L M N O P Q R Q P O N M L K J I H G F E D C B A
              A B C D E F G H I J K L M N O P Q R S R Q P O N M L K J I H G F E D C B A
            A B C D E F G H I J K L M N O P Q R S T S R Q P O N M L K J I H G F E D C B A
          A B C D E F G H I J K L M N O P Q R S T U T S R Q P O N M L K J I H G F E D C B A
        A B C D E F G H I J K L M N O P Q R S T U V U T S R Q P O N M L K J I H G F E D C B A
      A B C D E F G H I J K L M N O P Q R S T U V W V U T S R Q P O N M L K J I H G F E D C B A
    A B C D E F G H I J K L M N O P Q R S T U V W X W V U T S R Q P O N M L K J I H G F E D C B A
  A B C D E F G H I J K L M N O P Q R S T U V W X Y X W V U T S R Q P O N M L K J I H G F E D C B A
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Y X W V U T S R Q P O N M L K J I H G F E D C B A
  A B C D E F G H I J K L M N O P Q R S T U V W X Y X W V U T S R Q P O N M L K J I H G F E D C B A
    A B C D E F G H I J K L M N O P Q R S T U V W X W V U T S R Q P O N M L K J I H G F E D C B A
      A B C D E F G H I J K L M N O P Q R S T U V W V U T S R Q P O N M L K J I H G F E D C B A
        A B C D E F G H I J K L M N O P Q R S T U V U T S R Q P O N M L K J I H G F E D C B A
          A B C D E F G H I J K L M N O P Q R S T U T S R Q P O N M L K J I H G F E D C B A
            A B C D E F G H I J K L M N O P Q R S T S R Q P O N M L K J I H G F E D C B A
              A B C D E F G H I J K L M N O P Q R S R Q P O N M L K J I H G F E D C B A
                A B C D E F G H I J K L M N O P Q R Q P O N M L K J I H G F E D C B A
                  A B C D E F G H I J K L M N O P Q P O N M L K J I H G F E D C B A
                    A B C D E F G H I J K L M N O P O N M L K J I H G F E D C B A
                      A B C D E F G H I J K L M N O N M L K J I H G F E D C B A
                        A B C D E F G H I J K L M N M L K J I H G F E D C B A
                          A B C D E F G H I J K L M L K J I H G F E D C B A
                            A B C D E F G H I J K L K J I H G F E D C B A
                              A B C D E F G H I J K J I H G F E D C B A
                                A B C D E F G H I J I H G F E D C B A
                                  A B C D E F G H I H G F E D C B A
                                    A B C D E F G H G F E D C B A
                                      A B C D E F G F E D C B A
                                        A B C D E F E D C B A
                                          A B C D E D C B A
                                            A B C D C B A
                                              A B C B A
                                                A B A
                                                  A

As always, this is code-golf so standard loopholes apply and the shortest answer in bytes wins!

Related - same challenge with slightly different chars, no spaces, no input — Sp3000, Commented Nov 23, 2016 at 1:42
Scrolling this page produces a neat optical illusion for the 26 output. — cobaltduck, Commented Nov 23, 2016 at 19:45

cure · Accepted Answer · 2016-11-25 00:47:22Z

7

Python, 184 174 169 bytes

R=range
def g(a):
 def f(x,y,z):
  for i in R(x,y,z):print "  "*(i-1)," ".join([chr(65+j) for j in R((a-i))]+[chr(65+(a-i-2)-j) for j in R((a-i-1))])
 f(a,0,-1);f(2,a,1)

Edit: saved 5 bytes thanks to @nedla2004

edited Nov 25, 2016 at 0:47

answered Nov 23, 2016 at 1:40

cure

1,7511 gold badge9 silver badges8 bronze badges

\$\begingroup\$ I see a two things that can be changed. 1.) You can putg on three lines. 2.) Assign range to a variable. You can see both of these here. (Note: Before def f(x,y,z): there is a space, before the for loop there is a tab. \$\endgroup\$
– nedla2004
Commented Nov 23, 2016 at 2:05
\$\begingroup\$ Aren't there 3 ranges that you can replace? \$\endgroup\$
– nedla2004
Commented Nov 23, 2016 at 2:09
\$\begingroup\$ You can save 4 bytes by turning R((a-i)) into R(a-i) and R((a-i-1)) into R(a-i-1), can't you? \$\endgroup\$
– L3viathan
Commented Nov 23, 2016 at 14:13
\$\begingroup\$ There are 2 spaces that can be removed from before the for loops inside the list comprehension. \$\endgroup\$
– Yytsi
Commented Nov 24, 2016 at 4:54
\$\begingroup\$ An useless whitespace after print. \$\endgroup\$
– Yytsi
Commented Nov 25, 2016 at 16:28

| Show 1 more comment

Adnan · Accepted Answer · 2016-11-23 07:52:06Z

6

05AB1E, 13 bytes

Code:

A.ps£û€û€S».c

Explanation:

A.p             # Push all prefixes of the alphabet.
   s£           # Only get the first input elements.
     û          # Palindromize, turns ['a', 'ab', 'abc'] -> ['a', 'ab', 'abc', 'ab', 'a']
      €û        # Palindromize each, turns ['a', 'ab', 'abc', 'ab', 'a']
                  into... ['a', 'aba', 'abcba', 'aba', 'a']
        €S      # Split each element.
          »     # Gridify, joins the arrays be newlines and the arrays in the arrays 
                  by spaces.
           .c   # Centralize, aligning the text to the center.

Uses the CP-1252 encoding. Try it online!

edited Nov 23, 2016 at 7:52

answered Nov 23, 2016 at 7:26

Adnan

44.5k6 gold badges82 silver badges246 bronze badges

\$\begingroup\$ So this is what "centralized" stands for in info.txt! Nice solution by the way. \$\endgroup\$
– Osable
Commented Nov 23, 2016 at 7:42
\$\begingroup\$ @Osable Yep, it also works for strings with newlines in it (rather than only arrays). \$\endgroup\$
– Adnan
Commented Nov 23, 2016 at 7:48

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

MATL, 25 24 bytes

Zv&+64+G-t64>*1&!t0*hTec

Try it online!

Longer alternatives:

1Y20hiZv&+G-t0>*1&!t0*hTe) (26 bytes)
Zv&+64+G-t64>*l2&Y"tZyP:o*c (27 bytes)

Explanation

         % Implicit input 
Zv       % Symmetric range. For input 3 it gives [1 2 3 2 1]
&+       % Matrix of all pairwise additions. For input 3 it gives a 5×5 matrix
64+G     % Add 64 and subtract input. This gives the desired ASCII codes in the
         % central rhombus 
t64>*    % Make values less than 65 equal to 0. This affects entries outside the
         % central rhombus 
1&!      % Permute second and third dimensions. Transforms the 5×5 matrix into
         % a 5×1×5 array
t0*      % Push a copy of that array with all entries equal to 0
h        % Concatenate along the second dimension. Gives a 5×2×5 array
Te       % Collapse the second and third dimensions. Gives a 5×10 matrix
c        % Convert to char. Char zero is displayed as space
         % Implicit display

DJMcMayhem · Accepted Answer · 2016-11-23 01:02:00Z

4

V, 45 bytes

i¬A[À|lDybA"Ó./& 
òÄó¨á© á úe± 
>>.YGp{òd

Try it online!

This ended up being way less golfy than I had hoped, so I'm not going to post an explanation yet. Hopefully I can whittle it down some more first. As usual, here is a hexdump:

0000000: 69ac 415b 1bc0 7c6c 4479 6241 1f12 221b  i.A[..|lDybA..".
0000010: d32e 2f26 200a f2c4 f3a8 e1a9 20e1 20fa  ../& ....... . .
0000020: 65b1 200a 3e3e 2e59 4770 7bf2 64         e. .>>.YGp{.d

answered Nov 23, 2016 at 1:02

DJMcMayhem

59.4k17 gold badges195 silver badges348 bronze badges

Add a comment |

Conor O'Brien · Accepted Answer · 2016-11-23 03:17:00Z

J, 34 bytes

(' ',u:65+i.26){~0>.]-[:+/~|@i:@<:

Takes the number as input and returns a 2D character array.

Explanation

(' ',u:65+i.26){~0>.]-[:+/~|@i:@<:  input y
                                <:  y - 1
                             i:     "steps" -- i:2 -> -2 1 0 1 2
                           |        absolute value
                        +/~         addition table
                      [:            join right two tines into a conjunction
                    ]-              y - this table
                 0>.                max(0, that)
(' ',u:65+i.26)                     the alphabet preceded by a space
               {~                   index

Decomposed test case

   n =: 5
   <: n
4
   i: <: n
_4 _3 _2 _1 0 1 2 3 4
   | i: <: n
4 3 2 1 0 1 2 3 4
   +/~ | i: <: n
8 7 6 5 4 5 6 7 8
7 6 5 4 3 4 5 6 7
6 5 4 3 2 3 4 5 6
5 4 3 2 1 2 3 4 5
4 3 2 1 0 1 2 3 4
5 4 3 2 1 2 3 4 5
6 5 4 3 2 3 4 5 6
7 6 5 4 3 4 5 6 7
8 7 6 5 4 5 6 7 8
   n - +/~ | i: <: n
_3 _2 _1 0 1 0 _1 _2 _3
_2 _1  0 1 2 1  0 _1 _2
_1  0  1 2 3 2  1  0 _1
 0  1  2 3 4 3  2  1  0
 1  2  3 4 5 4  3  2  1
 0  1  2 3 4 3  2  1  0
_1  0  1 2 3 2  1  0 _1
_2 _1  0 1 2 1  0 _1 _2
_3 _2 _1 0 1 0 _1 _2 _3
   0 >. n - +/~ | i: <: n
0 0 0 0 1 0 0 0 0
0 0 0 1 2 1 0 0 0
0 0 1 2 3 2 1 0 0
0 1 2 3 4 3 2 1 0
1 2 3 4 5 4 3 2 1
0 1 2 3 4 3 2 1 0
0 0 1 2 3 2 1 0 0
0 0 0 1 2 1 0 0 0
0 0 0 0 1 0 0 0 0
   u:65
A
   i.26
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
   65+i.26
65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90
   u:65+i.26
ABCDEFGHIJKLMNOPQRSTUVWXYZ
   ' ',u:65+i.26
 ABCDEFGHIJKLMNOPQRSTUVWXYZ
   (' ',u:65+i.26) {~ 0 >. n - +/~ | i: <: n
    A
   ABA
  ABCBA
 ABCDCBA
ABCDEDCBA
 ABCDCBA
  ABCBA
   ABA
    A

Let's try this with input 5.

Test cases

   f =: (' ',u:65+i.26){~0>.]-[:+/~|@i:@<:
   f 1
A
   f 2
 A
ABA
 A
   f 3
  A
 ABA
ABCBA
 ABA
  A
   f 4
   A
  ABA
 ABCBA
ABCDCBA
 ABCBA
  ABA
   A
   f 5
    A
   ABA
  ABCBA
 ABCDCBA
ABCDEDCBA
 ABCDCBA
  ABCBA
   ABA
    A
   f 26
                         A
                        ABA
                       ABCBA
                      ABCDCBA
                     ABCDEDCBA
                    ABCDEFEDCBA
                   ABCDEFGFEDCBA
                  ABCDEFGHGFEDCBA
                 ABCDEFGHIHGFEDCBA
                ABCDEFGHIJIHGFEDCBA
               ABCDEFGHIJKJIHGFEDCBA
              ABCDEFGHIJKLKJIHGFEDCBA
             ABCDEFGHIJKLMLKJIHGFEDCBA
            ABCDEFGHIJKLMNMLKJIHGFEDCBA
           ABCDEFGHIJKLMNONMLKJIHGFEDCBA
          ABCDEFGHIJKLMNOPONMLKJIHGFEDCBA
         ABCDEFGHIJKLMNOPQPONMLKJIHGFEDCBA
        ABCDEFGHIJKLMNOPQRQPONMLKJIHGFEDCBA
       ABCDEFGHIJKLMNOPQRSRQPONMLKJIHGFEDCBA
      ABCDEFGHIJKLMNOPQRSTSRQPONMLKJIHGFEDCBA
     ABCDEFGHIJKLMNOPQRSTUTSRQPONMLKJIHGFEDCBA
    ABCDEFGHIJKLMNOPQRSTUVUTSRQPONMLKJIHGFEDCBA
   ABCDEFGHIJKLMNOPQRSTUVWVUTSRQPONMLKJIHGFEDCBA
  ABCDEFGHIJKLMNOPQRSTUVWXWVUTSRQPONMLKJIHGFEDCBA
 ABCDEFGHIJKLMNOPQRSTUVWXYXWVUTSRQPONMLKJIHGFEDCBA
ABCDEFGHIJKLMNOPQRSTUVWXYZYXWVUTSRQPONMLKJIHGFEDCBA
 ABCDEFGHIJKLMNOPQRSTUVWXYXWVUTSRQPONMLKJIHGFEDCBA
  ABCDEFGHIJKLMNOPQRSTUVWXWVUTSRQPONMLKJIHGFEDCBA
   ABCDEFGHIJKLMNOPQRSTUVWVUTSRQPONMLKJIHGFEDCBA
    ABCDEFGHIJKLMNOPQRSTUVUTSRQPONMLKJIHGFEDCBA
     ABCDEFGHIJKLMNOPQRSTUTSRQPONMLKJIHGFEDCBA
      ABCDEFGHIJKLMNOPQRSTSRQPONMLKJIHGFEDCBA
       ABCDEFGHIJKLMNOPQRSRQPONMLKJIHGFEDCBA
        ABCDEFGHIJKLMNOPQRQPONMLKJIHGFEDCBA
         ABCDEFGHIJKLMNOPQPONMLKJIHGFEDCBA
          ABCDEFGHIJKLMNOPONMLKJIHGFEDCBA
           ABCDEFGHIJKLMNONMLKJIHGFEDCBA
            ABCDEFGHIJKLMNMLKJIHGFEDCBA
             ABCDEFGHIJKLMLKJIHGFEDCBA
              ABCDEFGHIJKLKJIHGFEDCBA
               ABCDEFGHIJKJIHGFEDCBA
                ABCDEFGHIJIHGFEDCBA
                 ABCDEFGHIHGFEDCBA
                  ABCDEFGHGFEDCBA
                   ABCDEFGFEDCBA
                    ABCDEFEDCBA
                     ABCDEDCBA
                      ABCDCBA
                       ABCBA
                        ABA
                         A

Are you sure the lack if spaces in the output is OK? All other answers output this with spaces. I've asked just in case (since this would make it quite a bit easier in MATLAB too. :) — Stewie Griffin, Commented Nov 23, 2016 at 8:27
@DrMcMoylex I misread the challenge, I thought returning a 2D char array with the letters was sufficient. Working on a fix rn — Conor O'Brien, Commented Nov 23, 2016 at 17:35

Jonathan Allan · Accepted Answer · 2016-11-23 14:54:53Z

Jelly, 13 bytes

RØAḣUz⁶ŒBṚŒḄG

TryItOnline!

How?

RØAḣUz⁶ŒBṚŒḄG - Main link: n         e.g. 3
R             - range                     [1,2,3]
 ØA           - uppercase alphabet yield  "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
   ḣ          - head                      ["A","AB","ABC"]
    U         - upend (vectorises)        ["A","BA","CBA"]
     z        - transpose with filler...
      ⁶       -     space character       ["ABC"," AB","  A"]
       ŒB     - bounce (vectorises)       ["ABCBA"," ABA ","  A  "]
         Ṛ    - reverse                   ["  A  "," ABA ","ABCBA"]
          ŒḄ  - bounce (flat)             ["  A  "," ABA ","ABCBA"," ABA ","  A  "]
            G - grid format (join each with spaces and join with line feeds)
                                              A    
                                            A B A  
                                          A B C B A
                                            A B A  
                                              A

Community · Accepted Answer · 2020-06-17 09:04:33Z

3

Pyke, 12 bytes

FhGR<Q{s
)OX

Try it here!

Disable warnings for specified output

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 23, 2016 at 12:32

Blue

28.6k8 gold badges51 silver badges100 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

3

Python, 158 154 140 139 bytes

r=range
s=int(raw_input())
a=map(chr,range(65,91))
for i in r(0,s)+r(0,s-1)[::-1]:
 print (' '.join(a[:i+1]+a[:i][::-1])).center(s*4-2,' '))

This is my first post so be gentle! I made heavy use of [::-1] to reverse strings, so maybe there's some optimization to be had there. Comments welcome.

EDITS:

Thanks @Rod for the pointer to the helpful link to the Python code golf topic and also for reminding me that the letters need spaces between them. Also thanks @wec for the general tips about removing spaces.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 23, 2016 at 10:09

Jeremy Pedersen

312 bronze badges

\$\begingroup\$ You can remove spaces on either side of your operators (e. g. ` = ` becomes =), after commas, and before the opening parenthesis in the print statement. Python indentation can be any level as long as it's consistent, so you can save 3 characters by independenting your print statement only one space instead of four. Those are the easy savings I can see. \$\endgroup\$
– wec
Commented Nov 23, 2016 at 12:41
\$\begingroup\$ Welcome c: , we have this nice topic with lots of python tips (including a shorter alternative to generate the alphabet). Also since you are using z just one time, you don't need to use a variable, just put the s*2-1 directly in the center function. Just one detail, the output need to have spaces between the letters, a ' '.join right after the print should be enough (but you need to rework the s*2-1 to get the right value). \$\endgroup\$
– Rod
Commented Nov 23, 2016 at 13:27
\$\begingroup\$ also, the default starting value for range and for [:] is 0, so you don need to put it explicitly \$\endgroup\$
– Rod
Commented Nov 23, 2016 at 13:43

Add a comment |

paldir · Accepted Answer · 2016-11-23 12:23:29Z

C#, 266 263 262 261 245 238 235 232 bytes

Golfed:

List<string> F(int n){int i=0;var l=new List<string>();for(;i<n;i++){var h="";for(var c='A';c<'B'+i;c++)h+=" "+c;l.Add(new string(' ',(n-i+1)*2)+h+" "+string.Concat(h.Remove(i*2).Reverse()));}for(i-=2;i>=0;i--)l.Add(l[i]);return l;}

Ungolfed with comments:

    List<string> F(int n)
    {
        int i = 0;
        var l = new List<string>(); //collection of lines

        for (; i < n; i++)
        {
            var h = ""; //half of line

            //adding letters to first half of line
            for (var c = 'A'; c < 'B' + i; c++)
                h += " " + c;

            //adding leading spaces + half of line + reversed half of line to list
            l.Add(new string(' ', (n - i + 1)*2) + h + " " + string.Concat(h.Remove(i*2).Reverse()));
        }

        //adding lines in descending order
        for (i -= 2; i >= 0; i--)
            l.Add(l[i]);

        return l;
    }

Try it: http://rextester.com/WIL67940

Returns list of strings. Each string contains one output line.

I did that for fun and training. I realize that winning any of code-golf with C# is out of range.

EDIT1: Changed string interpolation to + operator.

EDIT2: c <= 'A' + i => c < 'B' + i

EDIT3: Swapped char with var.

EDIT4: Changed return type from void to List.

EDIT5: Removal of unnecessary variable.

EDIT6: New way of separating line halves.

EDIT7: @Kaspar Kjeldsen, thank you.

You can shave off a character by replacing string h=""; with var h=""; — Kaspar Kjeldsen, Commented Nov 23, 2016 at 12:20
Can get shorter still! rextester.com/JLUL92950 string[] F(int n){int i=0;var q=2*n-1;var l=new string[q];for(;i<n;i++){var h="";for(var c='A';c<'B'+i;c++)h+=" "+c;l[q-i-1]=l[i]=new string(' ',(n-i+1)*2)+h+ " "+string.Concat(h.Remove(i*2).Reverse());}return l;} — Kaspar Kjeldsen, Commented Nov 23, 2016 at 12:51

Community · Accepted Answer · 2020-06-17 09:04:33Z

2

C, 124 123 bytes

Saving 1 byte thanks to Mukul Kumar

~~Currently cant get my head to transform the double loop into a single one, will leave it like this for the moment.~~ Actually, this is larger

for(l=0;l<4*n*(4*n+1);++l){
  i=l/(4*n+1)-2*n;
  j=l%(4*n+1)-2*n;

So i just let the nested loop.

i,j,k;f(n){for(i=-2*n-1;++i<2*n;){for(j=-2*n-1;++j<=2*n;k=abs(i/2)+abs(j/2),putchar(j-2*n?k>=n||i%2||j%2?32:65+n+~k:10));}}

Uses the Manhattan norm to get the diamond shape.

Ungolfed:

i,j,k;
f(n){
 for(i=-2*n-1;++i<2*n;){
  for(j=-2*n-1;++j<=2*n;
   k=abs(i/2)+abs(j/2),
   putchar(j-2*n?k>=n||i%2||j%2?32:65+n+~k:10)
  );
 }
}

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 23, 2016 at 10:44

Karl Napf

4,42313 silver badges31 bronze badges

\$\begingroup\$ You can reduce one byte by replacingj==2*n withj-2*n and exchanging the ? () values with :() value \$\endgroup\$
– Mukul Kumar
Commented Nov 23, 2016 at 12:18

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Brain-Flak, 630 + 3 = 633 bytes

This requires the -A flag to run

Try it Online

(({})){(({}[()])<({}<({}<>)><>)<>(({}<>)<(({}[({})()])<{({}[()]<({}<(((((()()()()){}){}){}))>)>)}{}(({}<((((((()()()()){}){}){}){}()<>)<>)>)<{({}[()]<((()({}<(((((()()()()){}){}){}<>)<>)>)<>)<>)>)}{}({}<(((((()()()()){}){}){}<>)<>)>)((((()()()()){}){}){})>){(({})[()]<(({}((((()()()()){}){}){}){}<>)<>)(((((()()()()){}){}){}<>)<>)>)}{}>){({}[()]<<>(((((()()()()){}){}){}))<>>)}{}(((()()()()()){}<>)<>)>)>)}{}{}{}([]){((({}[()])<{({}[()]<({}<({}<>)<>>)>)}{}>)<{({}[()]<<>({}<>)>)}{}>)}{}((()()()()()){})<>{}([]){((({}[()])<{({}[()]<({}<({}<>)<>>)>)}{}>)<{({}[()]<<>({}<>)>)}{}>)}{}{{}({}[(()()()()()){}])}{}([]){{}({}<>)<>([])}{}<>

This is not a great golf but this challenge is quite difficult in Brain-Flak

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Pyth, 23 bytes

V+SQt_SQp*dy-QNt_pjd<GN

Try it online

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 23, 2016 at 3:25

Cameron McCluskie

3461 silver badge4 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Ruby, 137 115 100 84 bytes

->n{e=->s{s+s.reverse[1..-1]};e[(0..n-1).map{|i|"  "*(n-i)+e[[*?A..?Z][0..i]*' ']}]}

Thanks to manatwork for the comments.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 23, 2016 at 9:29

G B

22.5k1 gold badge20 silver badges53 bronze badges

\$\begingroup\$ Nice first answer. For ways to improve it, take a look at Tips for golfing in Ruby. First of all, kernigh's tip regarding functions. BTW, 0..n-1 → 0...n. \$\endgroup\$
– manatwork
Commented Nov 23, 2016 at 9:35
1

\$\begingroup\$ If you reverse the ternary logic you can use a single character relational operator: n>0?…:"". \$\endgroup\$
– manatwork
Commented Nov 23, 2016 at 9:42
1

\$\begingroup\$ “Your challenge is to write a program or function”. Better make it an anonymous lambda – that can take its parameter directly as integer. \$\endgroup\$
– manatwork
Commented Nov 23, 2016 at 10:30

Add a comment |

MercyBeaucou · Accepted Answer · 2016-11-24 04:01:12Z

1

Befunge 93, 175 bytes

Try it online!

Probably not very well golfed. Oh well. This was hard enough with befunge:

&:00p"B"\- :13v
v,: _v#`"@"<p5<
v," "<v`+*9<
>" ",: 35g7^
v47"v"_>1+ v
>p#  0^:>- v
v"A"g53<1v<
>+00g-` |53
v">",+91<p+
>74p35g:v11
_v# -g00<+^ _@#:
1>59*:91v> v
^p+199p8>#+ <

Good luck figuring out how it works! I barely know.

answered Nov 24, 2016 at 4:01

MercyBeaucou

3,06112 silver badges30 bronze badges

\$\begingroup\$ Nice use of a run-time code modification. \$\endgroup\$
– James Holderness
Commented Nov 24, 2016 at 12:52

Add a comment |

Neil · Accepted Answer · 2016-11-24 17:19:31Z

1

Batch, 269 bytes

@echo off
set/an=%1-1
set a=ABCDEFGHIJKLMNOPQRSTUVWXYZ                         
for /l %%i in (-%n%,1,%n%)do set i=%%i&call:l
exit/b
:l
set s=
for /l %%j in (-%n%,1,%n%)do set j=%%j&call:c
echo%s%
exit/b
:c
set/aj=n-%i:-=%-%j:-=%
call set s= %%a:~%j%,1%%%s%

Line 2 ends in 25 spaces; this means that when the alphabet index goes negative those squares simply remain blank.

answered Nov 24, 2016 at 17:19

Neil

174k12 gold badges73 silver badges277 bronze badges

Add a comment |

Stefan · Accepted Answer · 2016-11-25 13:19:30Z

C#, 199 bytes

q=>{Action<int>L=x=>{var s="";var k=0;for(;k<x;)s+=(char)('A'+k++)+" ";for(--k;--k>=0;)s+=(char)('A'+k)+" ";Console.WriteLine(new string(' ',(q-x)*2)+s);};var i=0;for(;i<q;)L(++i);for(;i>1;)L(--i);};

As always, C# is not much of a golfing language, but I prefer "readable" code much more than esoteric Code. Also I just did this for fun :)

Here's an ungolfed version, so you can easily understand what I did:

Action<int> C = q => 
{
    Action<int> L = x => 
    {
        var s = "";
        var k = 0;
        for (; k < x;)
            s += (char)('A' + k++) + " ";
        for (--k; --k >= 0;)
            s += (char)('A' + k) + " ";
        Console.WriteLine(new string(' ', (q - x) * 2) + s);
    };
    var i = 0;
    for (; i < q;)
        L(++i);
    for (; i > 1;)
        L(--i);
};

(I think this could be optimized a lot though..)

Community · Accepted Answer · 2020-06-17 09:04:33Z

Java, 213 bytes

void p(int n){int i=1,s=1,f,c;while(i>0){f=(n+1-i)*2;System.out.printf("%"+f+"s","");c=65;for(;c<64+i;)System.out.printf("%c ",c++);for(;c>64;)System.out.printf("%c ",c--);System.out.println();if(i==n)s=-1;i+=s;}}

Ungolfed:

void p(int n) {
    int i = 1, s = 1, f, c;
    while (i > 0) {
        f = (n + 1 - i) * 2;
        System.out.printf("%" + f + "s", "");
        c = 65;
        for (; c < 64 + i; ) System.out.printf("%c ", c++);
        for (; c > 64; ) System.out.printf("%c ", c--);
        System.out.println();
        if (i == n) s = -1;
        i += s;
    }
}

t-clausen.dk · Accepted Answer · 2022-02-02 13:51:17Z

1

TSQL, 261 236 bytes

DECLARE @i INT =5;

WITH C as(SELECT number z,abs(@i+~number)f 
FROM spt_values WHERE'P'=type)SELECT
top(@i*2-1)space(f*2)+v+stuff(reverse(v),1,3,'')FROM(SELECT*,(SELECT
top(@i-f)char(65+z)+' 'FROM c
for xml path(''),type).value('.','varchar(52)')v FROM c)d

Fiddle

edited Feb 2, 2022 at 13:51

answered Nov 23, 2016 at 10:48

t-clausen.dk

3,76412 silver badges16 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Java, 394 Bytes

I normally do C#, but it's good to mix it up...

Golfed:

String P(int n){String a="ABCDEFGHIJKLMNOPQRSTUVWXYZ",o="",k="",s="";int i=0,j=0,l=0;java.util.List<String>b=new java.util.ArrayList<String>();for(i=1;i<=n;i++){k="";s=a.substring(0,i);l=s.length();for(j=0;j<l;j++)k+=s.toCharArray()[j]+" ";while(k.length()<n+n)k=" "+k;if(i>1)for(j=l-2;j>=0;j--)k+=s.toCharArray()[j]+" ";k+="\r\n";b.add(k);o+=k;}for(i=b.size()-2;i>=0;i--)o+=b.get(i);return o;}

Ungolfed:

public String P(int n)
{
    String a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ", o ="", k="",s="";
    int i =0, j=0, l=0;
    java.util.List<String> b = new java.util.ArrayList<String>();
    for (i = 1; i <= n; i++) {
        k = "";
        s = a.substring(0, i);
        l = s.length();
        
        for (j = 0; j < l; j++)
            k += s.toCharArray()[j] + " ";
        
        while(k.length() < n + n)
            k= " " + k;
        
        if(i > 1)
            for (j = l-2; j >= 0; j--)
                k += s.toCharArray()[j] + " ";           
                    
        k += "\r\n";
        b.add(k);
        o += k;
     }
    
    for (i = b.size()-2; i >= 0; i--)
        o += b.get(i);
               
    return o;
}

Test:

BuildAnAlphabetPyramid b = new BuildAnAlphabetPyramid();
System.out.println(b.P(5));
System.out.println(b.P(26));

        A 
      A B A 
    A B C B A 
  A B C D C B A 
A B C D E D C B A 
  A B C D C B A 
    A B C B A     
      A B A 
        A 

                                                  A 
                                                A B A 
                                              A B C B A 
                                            A B C D C B A 
                                          A B C D E D C B A 
                                        A B C D E F E D C B A 
                                      A B C D E F G F E D C B A 
                                    A B C D E F G H G F E D C B A 
                                  A B C D E F G H I H G F E D C B A 
                                A B C D E F G H I J I H G F E D C B A 
                              A B C D E F G H I J K J I H G F E D C B A 
                            A B C D E F G H I J K L K J I H G F E D C B A 
                          A B C D E F G H I J K L M L K J I H G F E D C B A 
                        A B C D E F G H I J K L M N M L K J I H G F E D C B A 
                      A B C D E F G H I J K L M N O N M L K J I H G F E D C B A 
                    A B C D E F G H I J K L M N O P O N M L K J I H G F E D C B A 
                  A B C D E F G H I J K L M N O P Q P O N M L K J I H G F E D C B A 
                A B C D E F G H I J K L M N O P Q R Q P O N M L K J I H G F E D C B A 
              A B C D E F G H I J K L M N O P Q R S R Q P O N M L K J I H G F E D C B A 
            A B C D E F G H I J K L M N O P Q R S T S R Q P O N M L K J I H G F E D C B A 
          A B C D E F G H I J K L M N O P Q R S T U T S R Q P O N M L K J I H G F E D C B A 
        A B C D E F G H I J K L M N O P Q R S T U V U T S R Q P O N M L K J I H G F E D C B A 
      A B C D E F G H I J K L M N O P Q R S T U V W V U T S R Q P O N M L K J I H G F E D C B A 
    A B C D E F G H I J K L M N O P Q R S T U V W X W V U T S R Q P O N M L K J I H G F E D C B A 
  A B C D E F G H I J K L M N O P Q R S T U V W X Y X W V U T S R Q P O N M L K J I H G F E D C B A 
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Y X W V U T S R Q P O N M L K J I H G F E D C B A 
  A B C D E F G H I J K L M N O P Q R S T U V W X Y X W V U T S R Q P O N M L K J I H G F E D C B A 
    A B C D E F G H I J K L M N O P Q R S T U V W X W V U T S R Q P O N M L K J I H G F E D C B A 
      A B C D E F G H I J K L M N O P Q R S T U V W V U T S R Q P O N M L K J I H G F E D C B A 
        A B C D E F G H I J K L M N O P Q R S T U V U T S R Q P O N M L K J I H G F E D C B A 
          A B C D E F G H I J K L M N O P Q R S T U T S R Q P O N M L K J I H G F E D C B A 
            A B C D E F G H I J K L M N O P Q R S T S R Q P O N M L K J I H G F E D C B A 
              A B C D E F G H I J K L M N O P Q R S R Q P O N M L K J I H G F E D C B A 
                A B C D E F G H I J K L M N O P Q R Q P O N M L K J I H G F E D C B A 
                  A B C D E F G H I J K L M N O P Q P O N M L K J I H G F E D C B A 
                    A B C D E F G H I J K L M N O P O N M L K J I H G F E D C B A 
                      A B C D E F G H I J K L M N O N M L K J I H G F E D C B A 
                        A B C D E F G H I J K L M N M L K J I H G F E D C B A 
                          A B C D E F G H I J K L M L K J I H G F E D C B A 
                            A B C D E F G H I J K L K J I H G F E D C B A 
                              A B C D E F G H I J K J I H G F E D C B A 
                                A B C D E F G H I J I H G F E D C B A 
                                  A B C D E F G H I H G F E D C B A 
                                    A B C D E F G H G F E D C B A 
                                      A B C D E F G F E D C B A 
                                        A B C D E F E D C B A 
                                          A B C D E D C B A 
                                            A B C D C B A 
                                              A B C B A 
                                                A B A 
                                                  A

Jonathan Carroll · Accepted Answer · 2016-11-24 03:01:32Z

0

R, 100 97 87 bytes

x=scan();z=LETTERS;for(i in c(1:x,x:2-1))cat(rep(" ",x-i+1),z[1:i],if(i>1)z[i:2-1],"\n")

4:
#>         A 
#>       A B A 
#>     A B C B A 
#>   A B C D C B A 
#>     A B C B A 
#>       A B A 
#>         A

( Update: scan() for input; abused (x-1):1 == x:2-1. )

Not too shabby for one of the keyword languages by the looks of it (those special-character ones are always going to be better).

edited Nov 24, 2016 at 3:01

answered Nov 24, 2016 at 0:49

Jonathan Carroll

3411 silver badge8 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

PHP, 122 116 bytes

for($i=1-$n=$argv[1];$i<$n;)echo str_pad("",$a=abs($i++)),$s=join(range(A,chr(64+$n-$a))),substr(strrev($s),1),"\n";

is there a shorter way?

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 24, 2016 at 10:18

Titus

14.8k1 gold badge24 silver badges41 bronze badges

Add a comment |

Neil · Accepted Answer · 2016-11-24 16:53:47Z

0

JavaScript (ES6), 121 bytes

n=>[...Array(n+n--)].map((_,i,a)=>a.map((_,j)=>(j=10+n-g(i)-g(j))>9?(10-j).toString(36):` `,g=i=>i<n?n-i:i-n).join` `).join`\n`

Where \n represents the literal newline character. Outputs in lower case.

answered Nov 24, 2016 at 16:53

Neil

174k12 gold badges73 silver badges277 bronze badges

Add a comment |

hakr14 · Accepted Answer · 2022-02-02 21:41:58Z

Canvas, 8 bytes

Ｚｍ［］／ ＊┼

Try it here!

Explanation:

Zm[]/ *+ | Full code (chars replaced with ASCII alternatives for monospace)
---------+---------------------------------------------------------------------
Z        | Push uppercase alphabet
 m       | Mold to length (i.e. first <input> chars)
  []     | Prefixes
    /    | Antidiagonal (put spaces before each line/entry)
     _*  | Put a space between each character (space underlined for visibility)
       + | Quad-palindromize with 1 overlap

Dom Hastings · Accepted Answer · 2022-02-08 20:34:20Z

0

Perl 5 + `-pa -M5.10.0`, 79 bytes

@A=A..Z;$\=$s.$/.$\,say$s="  "x--$F[0]."@A[0..--$_,reverse 0..--$_]"for 1..$_}{

Try it online!

Perl 5 + `-pl`, 88 bytes

A slightly longer approach, but utilises ANSI escape codes and draws the letters in a spiral, starting with 9 o'clock, moving clockwise.

$l=A;$\x=($_-1);//,(map$\.="$l$_"x$',".[A ",". ","....","..[A.."),$\.=$l++.$"while$_--}{

Try it online!

edited Feb 8, 2022 at 20:34

answered Feb 2, 2022 at 21:09

Dom Hastings

24.3k4 gold badges55 silver badges92 bronze badges

Add a comment |

naffetS · Accepted Answer · 2022-06-04 02:30:39Z

0

Vyxal `C`, 8 bytes

kA¦Ẏ∞ʁvṄ

Try it Online!

How?

kA¦Ẏ∞ʁvṄ
kA       # Push the uppercase alphabet
  ¦      # Prefixes
   Ẏ     # Get the first input items
    ∞    # Palindromise this list
     ʁ   # Palindromise each in this list
      vṄ # Join each on spaces
         # C flag centers and joins on newlines

edited Jun 4, 2022 at 2:30

answered Jun 2, 2022 at 20:51

naffetS

12.8k2 gold badges20 silver badges53 bronze badges

Add a comment |

Stack Exchange Network

Build an Alphabet Pyramid

25 Answers 25

Python, 184 174 169 bytes

05AB1E, 13 bytes

MATL, 25 24 bytes

Explanation

V, 45 bytes

J, 34 bytes

Explanation

Decomposed test case

Test cases

Jelly, 13 bytes

How?

Pyke, 12 bytes

Python, 158 154 140 139 bytes

C#, 266 263 262 261 245 238 235 232 bytes

C, 124 123 bytes

Brain-Flak, 630 + 3 = 633 bytes

Pyth, 23 bytes

Ruby, 137 115 100 84 bytes

Befunge 93, 175 bytes

Batch, 269 bytes

C#, 199 bytes

Java, 213 bytes

TSQL, 261 236 bytes

Java, 394 Bytes

R, 100 97 87 bytes

PHP, 122 116 bytes

JavaScript (ES6), 121 bytes

Canvas, 8 bytes

Explanation:

Perl 5 + `-pa -M5.10.0`, 79 bytes

Perl 5 + `-pl`, 88 bytes

Vyxal `C`, 8 bytes

How?

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
ascii-art
alphabet
or ask your own question.

Linked

Hot Network Questions

Build an Alphabet Pyramid

25 Answers 25

Python, 184 174 169 bytes

05AB1E, 13 bytes

MATL, 25 24 bytes

Explanation

V, 45 bytes

J, 34 bytes

Explanation

Decomposed test case

Test cases

Jelly, 13 bytes

How?

Pyke, 12 bytes

Python, 158 154 140 139 bytes

C#, 266 263 262 261 245 238 235 232 bytes

C, 124 123 bytes

Brain-Flak, 630 + 3 = 633 bytes

Pyth, 23 bytes

Ruby, 137 115 100 84 bytes

Befunge 93, 175 bytes

Batch, 269 bytes

C#, 199 bytes

Java, 213 bytes

TSQL, 261 236 bytes

Java, 394 Bytes

R, 100 97 87 bytes

PHP, 122 116 bytes

JavaScript (ES6), 121 bytes

Canvas, 8 bytes

Explanation:

Perl 5 + -pa -M5.10.0, 79 bytes

Perl 5 + -pl, 88 bytes

Vyxal C, 8 bytes

How?

Your Answer

Sign up or log in

Post as a guest

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

Linked

Related

Hot Network Questions

Perl 5 + `-pa -M5.10.0`, 79 bytes

Perl 5 + `-pl`, 88 bytes

Vyxal `C`, 8 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
ascii-art
alphabet
or ask your own question.