Alphabet Rangoli in Python - HackerRank Solution

Problem Statement :

You are given an integer, N. Your task is to print an alphabet rangoli of size N. (Rangoli is a form of Indian folk art based on creation of patterns.)

Different sizes of alphabet rangoli are shown below:


#size 3


----c----

--c-b-c--

c-b-a-b-c

--c-b-c--

----c----


#size 5


--------e--------

------e-d-e------

----e-d-c-d-e----

--e-d-c-b-c-d-e--

e-d-c-b-a-b-c-d-e

--e-d-c-b-c-d-e--

----e-d-c-d-e----

------e-d-e------

--------e--------


#size 10


------------------j------------------

----------------j-i-j----------------

--------------j-i-h-i-j--------------

------------j-i-h-g-h-i-j------------

----------j-i-h-g-f-g-h-i-j----------

--------j-i-h-g-f-e-f-g-h-i-j--------

------j-i-h-g-f-e-d-e-f-g-h-i-j------

----j-i-h-g-f-e-d-c-d-e-f-g-h-i-j----

--j-i-h-g-f-e-d-c-b-c-d-e-f-g-h-i-j--

j-i-h-g-f-e-d-c-b-a-b-c-d-e-f-g-h-i-j

--j-i-h-g-f-e-d-c-b-c-d-e-f-g-h-i-j--

----j-i-h-g-f-e-d-c-d-e-f-g-h-i-j----

------j-i-h-g-f-e-d-e-f-g-h-i-j------

--------j-i-h-g-f-e-f-g-h-i-j--------

----------j-i-h-g-f-g-h-i-j----------

------------j-i-h-g-h-i-j------------

--------------j-i-h-i-j--------------

----------------j-i-j----------------

------------------j------------------

The center of the rangoli has the first alphabet letter a, and the boundary has the Nth alphabet letter (in alphabetical order).


Input Format:

Only one line of input containing N, the size of the rangoli.


Constraints:

0<N<27


Output Format:

Print the alphabet rangoli in the format explained above.


Solution:

n=int(input())
for i in range(n-1,-1,-1):
    for j in range(i):
        print(end="--")
    for j in range(n-1,i,-1):
        print(chr(j+97),end="-")
    for j in range(i,n):
        if j != n-1:
            print(chr(j+97),end="-")
        else:
            print(chr(j+97),end="")
    for j in range(2*i):
        print(end="-")
    print()
for i in range(1,n):
    for j in range(i):
        print(end="--")
    for j in range(n-1,i,-1):
        print(chr(j+97),end="-")
    for j in range(i,n):
        if j != n-1:
            print(chr(j+97),end="-")
        else:
            print(chr(j+97),end="")
    for j in range(2*i):
        print(end="-")
    print()



Disclaimer:- 

The above hole problem statement is given by hackerrank.com but the solution is generated by the Hackerranksolution.site authority if any of the queries regarding this post or website fill the following contact form thank you.
Next Post Previous Post
No Comment
Add Comment
comment url