3258. Count Substrings That Satisfy K-Constraint I
You are given a binary string
sand an integerk.A binary string satisfies the k-constraint if either of the following conditions holds:
- The number of
0‘s in the string is at mostk.- The number of
1‘s in the string is at mostk.Return an integer denoting the number of substrings of
sthat satisfy the k-constraint.
3257. Maximum Value Sum by Placing Three Rooks II
You are given a
m x n2D arrayboardrepresenting a chessboard, whereboard[i][j]represents the value of the cell(i, j).Rooks in the same row or column attack each other. You need to place three rooks on the chessboard such that the rooks do not attack each other.
Return the maximum sum of the cell values on which the rooks are placed.
3256. Maximum Value Sum by Placing Three Rooks I
You are given a
m x n2D arrayboardrepresenting a chessboard, whereboard[i][j]represents the value of the cell(i, j).Rooks in the same row or column attack each other. You need to place three rooks on the chessboard such that the rooks do not attack each other.
Return the maximum sum of the cell values on which the rooks are placed.
3255. Find the Power of K-Size Subarrays II
You are given an array of integers
numsof lengthnand a positive integerk.The power of an array is defined as:
- Its maximum element if all of its elements are consecutive and sorted in ascending order.
- -1 otherwise.
You need to find the power of all subarrays of
numsof sizek.Return an integer array
resultsof sizen - k + 1, whereresults[i]is the power ofnums[i..(i + k - 1)].
3254. Find the Power of K-Size Subarrays I
You are given an array of integers
numsof lengthnand a positive integerk.The power of an array is defined as:
- Its maximum element if all of its elements are consecutive and sorted in ascending order.
- -1 otherwise.
You need to find the power of all subarrays of
numsof sizek.Return an integer array
resultsof sizen - k + 1, whereresults[i]is the power ofnums[i..(i + k - 1)].