2698. Find the Punishment Number of an Integer
Given a positive integer
n, return the punishment number ofn.The punishment number of
nis defined as the sum of the squares of all integersisuch that:
1 <= i <= n- The decimal representation of
i * ican be partitioned into contiguous substrings such that the sum of the integer values of these substrings equalsi.
2697. Lexicographically Smallest Palindrome
You are given a string
sconsisting of lowercase English letters, and you are allowed to perform operations on it. In one operation, you can replace a character inswith another lowercase English letter.Your task is to make
sa palindrome with the minimum number of operations possible. If there are multiple palindromes that can be made using the minimum number of operations, make the lexicographically smallest one.A string
ais lexicographically smaller than a stringb(of the same length) if in the first position whereaandbdiffer, stringahas a letter that appears earlier in the alphabet than the corresponding letter inb.Return the resulting palindrome string.
2696. Minimum String Length After Removing Substrings
You are given a string
sconsisting only of uppercase English letters.You can apply some operations to this string where, in one operation, you can remove any occurrence of one of the substrings
"AB"or"CD"froms.Return the minimum possible length of the resulting string that you can obtain.
Note that the string concatenates after removing the substring and could produce new
"AB"or"CD"substrings.