Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,870 questions

51,793 answers

573 users

How to check whether each substring range (L to R) from an array of substring ranges is a palindrome in Python

1 Answer

0 votes
def is_palindrome(s: str, left: int, right: int) -> bool:
    while left < right:
        if s[left] != s[right]:
            return False
        left += 1
        right -= 1
        
    return True

def check_ranges_for_palindrome(s: str, ranges: list[list[int]]) -> None:
    for start, end in ranges:
        substring = s[start:end + 1]
        result = "Palindrome" if is_palindrome(s, start, end) else "Not palindrome"
        print(f"{substring}: {result}")


s = "abcddcbeebc"
ranges = [
    [2, 5],
    [5, 10],
    [3, 7]
]

check_ranges_for_palindrome(s, ranges)



'''
run:

cddc: Palindrome
cbeebc: Palindrome
ddcbe: Not palindrome

'''

 



answered Nov 16, 2025 by avibootz

Related questions

...