**Shortest Palindrome**; 215. Kth Largest Element in an Array; 216. Combination Sum III; 217. Contains Duplicate; ... **Lexicographically Smallest** Equivalent String; 1062. Longest Repeating Substring; 1063. Number of Valid Subarrays; ... **LeetCode** 995. **Minimum** Number of K Consecutive Bit Flips (hard) **LeetCode** 1040. Moving Stones Until Consecutive II. When next **palindrome** is found, check if the length of that **palindrome** is less than smallPalin. If yes, store that word in smallPalin. If length of next **palindrome** is greater than bigPalin. If yes, store that word in bigPalin. At the end, if count is equal to 0, then there is no **palindrome**. Else, display the **smallest** and biggest **palindrome**. On the other hand, now your job is to find the **lexicographically smallest** permutation of [1, 2, ... n] could refer to the given secret signature in the input. Example 1: Input: "I" Output: [1,2] Explanation: [1,2] is the only legal initial spectial string can construct secret signature "I", where the number 1 and 2 construct an increasing.

**Leetcode**1328 for free。Unlock prime for

**Leetcode**1328. ... Given a

**palindromic**string

**palindrome**, replace exactly one character by any lowercase English letter so that the string becomes the

**lexicographically smallest**possible string that isn't a

**palindrome**. After doing so, return the final string.. 132

**Palindrome**Partitioning II - Hard Problem: Given a string s, partition s such that every substring of the partition is a

**palindrome**. Return the minimum cuts needed for a

**palindrome**partitioning of s. For example, given s = "aab", Return 1 since the

**palindrome**partitioning ["aa","b"] could be produced using 1 cut. Thoughts:. 0106. Construct Binary Tree from Inorder and Postorder Traversal. 0107. Binary Tree Level Order Traversal II. 0108. Convert Sorted Array to Binary Search Tree.