The code defines a lapindrome as a string that remains the same when its two halves are reversed or identical when the middle character is removed for odd length strings. It splits the string, sorts the characters of each half, compares them and returns true if they are equal lapindromes or false if not. It then prompts the user for a string and checks if it is a lapindrome.

1. PYTHON PROGRAMMING

2. A )Anil is a business man having different business,
among them he also owns a cloth store. Due to
pandemic his sales are very dull ,to increase the sales
and attract the customers he introduced a scheme
“Lucky Winner” for first 500 customers whose
purchases more than 2000rps from their stores will be
given a lottery ticket .Help Anil to Generate 500 random
lottery tickets and pick two lucky tickets from it as a
winner.
Note: you must adhere to the following conditions:
The lottery number must be 5 digits long.
All 500 ticket number must be unique

3. Algorithm:
 Create an empty list called “tickets” to store lottery ticket
numbers.
 While length of tickets list is less than 500.
 Generate a random 5-digited number, append it to the list.
 While checking if it’s unique.
 Continue iteration until the length of tickets less than 500.
 Shuffle the list to randomize the order of the tickets.
 Select two tickets at random from the list as the winner.
 Print the winning ticket numbers.

4. Code:
import random
tickets=set()
while len(tickets)<500:
ticket=random.randint(10000,99999)
phone_no=random.randint(1000000000,9999999999)
tickets.add(ticket)
winners=random.sample(tickets,2)
print("lottery tickets:")
for ticket in tickets:
print(ticket)
print("winners:")
for winner in winners:
print(winner)
print(“phone no: “,phone_no)

5. Flowchart:
START
Tickets=[ ]
Len(tickets)<50
0
Select random
integers ,range
of 10,000 to
99,999

6. Iterate until
len(tickets)<5
00
Select 2 random
tickets as winners
Print
winners
STOP

7. B) Lapindrome is defined as a string which when
split in the middle, gives two halves having the
same characters and same frequency of each
character. If there are odd number of characters
in the string, we ignore the middle character and
check for lapindrome. For example gaga is a
lapindrome, since the two halves ga and ga have
the same characters with same frequency.

8. Algorithm:
• Define lapindrome
• If length of string is even, split into two equal halves i.e “s1”
and “s2”.
• Else split the string into two halves i.e “s1” and “s2” by
ignoring the middle character.
• Join sorted s1 and s2
• If s1 is equal to s2.
• Return true, else return false.

9. Code:
def is_lapindrome(x):
n=len(x)
if n%2==0:
s1=s[ :n//2]
s2=s[n//2: ]
else:
s1=s[ :n//2]
s2=s[n//2+1: ]
s1=''.join(sorted(s1))
s2=''.join(sorted(s2))

10. if s1==s2:
return true
else:
return false
x=("enter a string: ")
if is_lapindrome(x):
print(x,"is a lapindrome")
else:
print(x,"is not lapindrome")

11. Flowchart:
START
X=(‘ ’)
N=len(x)
If n%2==0:
YES NO

12. S1=s[n//2:]
S2=s[:n//2]
S1=s[:n//2]
S2=s[n//2+1:]
S1=‘ ’.join(sorted(s1))
S2=‘ ’.join(sorted(s2))
If
s1==
s2:

13. YES NO
Return
true
Return
False
END

14. THANK YOU