3301. Maximize the Total Height of Unique Towers
You are given an array
maximumHeight, wheremaximumHeight[i]denotes the maximum height theithtower can be assigned.Your task is to assign a height to each tower so that:
- The height of the
ithtower is a positive integer and does not exceedmaximumHeight[i].- No two towers have the same height.
Return the maximum possible total sum of the tower heights. If it’s not possible to assign heights, return
-1.
3300. Minimum Element After Replacement With Digit Sum
You are given an integer array
nums.You replace each element in
numswith the sum of its digits.Return the minimum element in
numsafter all replacements.
3299. Sum of Consecutive Subsequences
We call an array
arrof lengthnconsecutive if one of the following holds:
arr[i] - arr[i - 1] == 1for all1 <= i < n.arr[i] - arr[i - 1] == -1for all1 <= i < n.The value of an array is the sum of its elements.
For example,
[3, 4, 5]is a consecutive array of value 12 and[9, 8]is another of value 17. While[3, 4, 3]and[8, 6]are not consecutive.Given an array of integers
nums, return the sum of the values of all consecutive non-empty subsequences.Since the answer may be very large, return it modulo
109 + 7.Note that an array of length 1 is also considered consecutive.
3298. Count Substrings That Can Be Rearranged to Contain a String II
You are given two strings
word1andword2.A string
xis called valid ifxcan be rearranged to haveword2as a prefix.Return the total number of valid substrings of
word1.Note that the memory limits in this problem are smaller than usual, so you must implement a solution with a linear runtime complexity.