3122. Minimum Number of Operations to Satisfy Conditions
You are given a 2D matrix
gridof sizem x n. In one operation, you can change the value of any cell to any non-negative number. You need to perform some operations such that each cellgrid[i][j]is:
- Equal to the cell below it, i.e.
grid[i][j] == grid[i + 1][j](if it exists).- Different from the cell to its right, i.e.
grid[i][j] != grid[i][j + 1](if it exists).Return the minimum number of operations needed.
3121. Count the Number of Special Characters II
You are given a string
word. A lettercis called special if it appears both in lowercase and uppercase inword, and every lowercase occurrence ofcappears before the first uppercase occurrence ofc.Return the number of special letters in
word.
3120. Count the Number of Special Characters I
You are given a string
word. A letter is called special if it appears both in lowercase and uppercase inword.Return the number of special letters in
word.