|
- Problem - 101059E - Codeforces
We call (x1, x2, x3, x4) quadruple a palindromic quadruple of string S if it satisfies the following criteria : Sx1 = Sx4 and Sx2 = Sx3 where x1 < x2 < x3 < x4
- Palindrome queries | Practice Problems - HackerEarth
You are given a string S that contains n lowercase alphabets There are Q queries of the form [L, R] Your task is to determine if every character in the range [L, R] can be arranged in such a manner that a palindromic substring for that range can be formed
- Palindrome Substring Queries - GeeksforGeeks
The idea is to use Manacher's Algorithm to preprocess the input string and compute the length of the longest palindromic substring centered at each position By inserting separators (like #) between characters, the algorithm uniformly handles even and odd length palindromes
- Palindromic Substrings - LeetCode
Palindromic Substrings - Given a string s, return the number of palindromic substrings in it A string is a palindrome when it reads the same backward as forward
- F - Palindrome Query - AtCoder
Follow the instructions in the problem statement and print the answers to the queries, separated by newlines Initially, S = S = abcbacb For the first query, the string formed by the 1 1 -st through 5 5 -th characters of S S is abcba, which is a palindrome Thus, print Yes
- Palindrome operations on a string - Stack Overflow
You are given a string S initially and some Q queries For each query you will have 2 integers L and R For each query, you have to perform the following operations: Arrange the letters from L to R
- Palindrome substring queries - Tpoint Tech - Java
Our task is to determine whether the substrings specified by these query indices are palindromes or not In this method, we iterate through each query individually and examine whether the specified substring is a palindrome
- Palindrome and Queries - Toph
You'll be given an array A A of N N strings containing lowercase English letters only and Q Q queries In each query, you have to find the length of the longest palindromic substring which appears in at least L L strings and at most R R strings If there is no such palindromic substring, print 0
|
|
|