Given a strings, we make queries on substrings ofs. For each queryqueries i left, right, k , we mayrearrangethe substrings left , ..., s right , and then chooseup tokof them to replace with any lower ...
2021-08-02 10:23 0 125 推荐指数：
Given a string s, we make queries on substrings of s. For each query queries[i] = [left, right, k], we may rearrange the substring s[left], ..., s ...
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. ...
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. ...
[i] + words[j] is a palindrome. Example 1:Given wor ...
Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you ...
Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest ...
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan ...
Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome ...
