3130. Find All Possible Stable Binary Arrays II
You are given 3 positive integers
zero,one, andlimit.A binary array
arris called stable if:
- The number of occurrences of 0 in
arris exactlyzero.- The number of occurrences of 1 in
arris exactlyone.- Each subarray of
arrwith a size greater thanlimitmust contain both 0 and 1.Return the total number of stable binary arrays.
Since the answer may be very large, return it modulo
109 + 7.
3129. Find All Possible Stable Binary Arrays I
You are given 3 positive integers
zero,one, andlimit.A binary array
arris called stable if:
- The number of occurrences of 0 in
arris exactlyzero.- The number of occurrences of 1 in
arris exactlyone.- Each subarray of
arrwith a size greater thanlimitmust contain both 0 and 1.Return the total number of stable binary arrays.
Since the answer may be very large, return it modulo
109 + 7.
You are given a 2D boolean matrix
grid.Return an integer that is the number of right triangles that can be made with the 3 elements of
gridsuch that all of them have a value of 1.Note:
- A collection of 3 elements of
gridis a right triangle if one of its elements is in the same row with another element and in the same column with the third element. The 3 elements do not have to be next to each other.
3127. Make a Square with the Same Color
You are given a 2D matrix
gridof size3 x 3consisting only of characters'B'and'W'. Character'W'represents the white color, and character'B'represents the black color.Your task is to change the color of at most one cell so that the matrix has a
2 x 2square where all cells are of the same color.Return
trueif it is possible to create a2 x 2square of the same color, otherwise, returnfalse.