Palindromic Questions
Print all the palindromic numbers from 1 to 500 in Python:
for num in range(1, 501): if str(num) == str(num)[::-1]: print(num)
- Write a Python function to check if a given string is a palindrome or not.
def is_palindrome(string):
return string == string[::-1]
- Write a Python function to check if a given integer is a palindrome or not.
def is_palindrome(number):
return str(number) == str(number)[::-1]
- Write a Python function to count the number of palindromic substrings in a given string.
def count_palindromic_substrings(string):
count = 0
for i in range(len(string)):
for j in range(i+1, len(string)+1):
if string[i:j] == string[i:j][::-1]:
count += 1
return count
- Write a Python function to find the longest palindromic substring in a given string.
def longest_palindromic_substring(string):
max_len = 0
longest_substr = ''
for i in range(len(string)):
for j in range(i+1, len(string)+1):
substr = string[i:j]
if substr == substr[::-1] and len(substr) > max_len:
max_len = len(substr)
longest_substr = substr return longest_substrngest_substr
- Write a Python function to remove all the palindromic substrings from a given string.
def remove_palindromic_substrings(string):
new_string = ""
for i in range(len(string)):
for j in range(i+1, len(string)+1):
if string[i:j] != string[i:j][::-1]:
new_string += string[i:j]
return new_string
- Write a Python function to find the smallest palindromic number greater than a given number.
def next_palindrome(number):
number += 1
while not is_palindrome(number):
number += 1 return numberber
- Write a Python function to find the largest palindromic number less than a given number.
def previous_palindrome(number):
number -= 1
while not is_palindrome(number):
number -= 1
return number
- Write a Python function to find all the palindromic primes less than a given number.
def is_prime(number):
if number < 2:
return False
for i in range(2, int(number**0.5) + 1):
if number % i == 0:
return False
return True
def palindromic_primes_less_than(number):
palindromic_primes = []
for i in range(2, number):
if is_palindrome(i) and is_prime(i):
palindromic_primes.append(i) return palindromic_primesrimes
- Write a Python function to find the nth palindromic prime number.
def nth_palindromic_prime(n):
count = 0
number = 2
while True:
if is_palindrome(number) and is_prime(number):
count += 1
if count == n:
return number
number += 1
- Write a Python program to print all the palindromic numbers between two given numbers.
def palindromic_numbers_between(start, end):
palindromes = []
for number in range(start, end+1):
if is_palindrome(number):
palindromes.append(number)
11. Write Python program to print all palindromic prime numbers between two given numbers:
def is_prime(number):
if number < 2:
return False
for i in range(2, int(number**0.5) + 1):
if number % i == 0:
return False
return True
def is_palindrome(number):
return str(number) == str(number)[::-1]
def palindromic_primes_between(start, end):
palindromic_primes = []
for number in range(start, end+1):
if is_palindrome(number) and is_prime(number):
palindromic_primes.append(number)
return palindromic_primes
# Example usage
print(palindromic_primes_between(2, 1000))