Infosys - ZOHO - TCS Coding | Palindrome Number in O(N) | Daily Dose -28 | Tamil | code io

[@harishrajaselvan]

def palindrome(n):
length=len(n)
for i in range(length//2):
if n[i]!=n[len(n)-i-1]:
return False
return True

n=input("Enter number or string to check palindrome: ")
result=palindrome(n)
if result:
print("Palindrome")
else:
print("Not Palindrome")

[@nithishkumark1644]

Nice question da and animation super ✨✨🥳🥳

[@codeio]

Thanks na🥳🥳🥳😅

[@anandhar9329]

Super question 💫💫

[@codeio]

😊😊😊

[@dasaradhsk7004]

Is time complexity O(1)? Shouldn't it be O(N) where N is number of digits?

[@codeio]

Aama bro 😅😅 ... Its corrected...

[@nithishkumark1644]

String aa convert panni check pannalam 😅😅

[@codeio]

Yes absolutely right👏👏👏👍

[@vishwayajith1758]

2 approach panalam 1. String Builder use panalam
2. Linear search start and end variable vachu try panalam
1st iku O(1) varum
2nd iku O(N/2) so O(N) varum

[@codeio]

Awesome bro👏👏👏👍