Given a string S of length N, find the longest palindromic substring in S. Substring of string S: S[ i . . . . j ] where 0 ≤ i ≤ j < len(S). Palindrome string: A string which reads the same backwards.
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. One possible longest palindromic subsequence is "bb". * Definition for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results