FilesExpand file tree

master

/

1755.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

26 lines (20 loc) · 744 Bytes

master

/

1755.py

Copy path

Top

File metadata and controls

• Code
• Blame

26 lines (20 loc) · 744 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

26

# Palindrome Reorder

# Given a string, your task is to reorder its letters in such a way that it becomes a palindrome (i.e., it reads the same forwards and backwards).

# If there are no solutions, print "NO SOLUTION"

s = input()

# Loop through the array and keep track of which characters have a pair and which are single (have no pair)

pairs = []

single = []

for char in s:

if char in single:

single.remove(char)

pairs.append(char)

else:

single.append(char)

# Construct the palindrome by sandwiching the single elements between the pair elements

res = ''.join(pairs) + ''.join(single) + ''.join(pairs)[::-1]

# Check if it is a palindrome

if res == res[::-1]:

print(res)

else:

print("NO SOLUTION")