2914. Minimum Number of Changes to Make Binary String Beautiful
You are given a 0-indexed binary string
shaving an even length.A string is beautiful if it’s possible to partition it into one or more substrings such that:
- Each substring has an even length.
- Each substring contains only
1‘s or only0‘s.You can change any character in
sto0or1.Return the minimum number of changes required to make the string
sbeautiful.
2913. Subarrays Distinct Element Sum of Squares I
You are given a 0-indexed integer array
nums.The distinct count of a subarray of
numsis defined as:
- Let
nums[i..j]be a subarray ofnumsconsisting of all the indices fromitojsuch that0 <= i <= j < nums.length. Then the number of distinct values innums[i..j]is called the distinct count ofnums[i..j].Return the sum of the squares of distinct counts of all subarrays of
nums.A subarray is a contiguous non-empty sequence of elements within an array.