3130. Find All Possible Stable Binary Arrays II
3130. Find All Possible Stable Binary Arrays II
Description
You are given 3 positive integers zero, one, and limit.
3130. Find All Possible Stable Binary Arrays II
You are given 3 positive integers zero, one, and limit.
3129. Find All Possible Stable Binary Arrays I
You are given 3 positive integers zero, one, and limit.
3127. Make a Square with the Same Color
You are given a 2D matrix grid of size 3 x 3 consisting only of characters 'B' and 'W'. Character 'W' represents the white color, and character 'B' represents the black color.
3123. Find Edges in Shortest Paths
You are given an undirected weighted graph of n nodes numbered from 0 to n - 1. The graph consists of m edges represented by a 2D array edges, where edges[i] = [ai, bi, wi] indicates that there is an edge between nodes ai and bi with weight wi.
3122. Minimum Number of Operations to Satisfy Conditions
You are given a 2D matrix grid of size m 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 cell grid[i][j] is:
3121. Count the Number of Special Characters II
You are given a string word. A letterc is called special if it appears both in lowercase and uppercase in word, and every lowercase occurrence of c appears before the first uppercase occurrence of c.
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 in word.
3116. Kth Smallest Amount With Single Denomination Combination
You are given an integer array coins representing coins of different denominations and an integer k.