5 docs tagged with "Palindrome"

Solve the problem of finding the maximum product of the lengths of two non-intersecting palindromic substrings in a given string.

Given an integer x, return true if x is a palindrome, and false otherwise.

This document provides solutions for the Strictly Palindromic Number problem.

Problem Description

Problem Description