Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. ...

Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. ...

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 list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words ...

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 ...

partitioning of s. Example: 这道题是让找到把原字符串拆分成回文串的最小切割 ...

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 ...