3143. Maximum Points Inside the Square
3143. Maximum Points Inside the Square
Description
You are given a 2D array points
and a string s
where, points[i]
represents the coordinates of point i
, and s[i]
represents the tag of point i
.
3143. Maximum Points Inside the Square
You are given a 2D array points
and a string s
where, points[i]
represents the coordinates of point i
, and s[i]
represents the tag of point i
.
3142. Check if Grid Satisfies Conditions
You are given a 2D matrix grid
of size m x n
. You need to check if each cell grid[i][j]
is:
3139. Minimum Cost to Equalize Array
You are given an integer array nums
and two integers cost1
and cost2
. You are allowed to perform either of the following operations any number of times:
3138. Minimum Length of Anagram Concatenation
You are given a string s
, which is known to be a concatenation of anagrams of some string t
.
3137. Minimum Number of Operations to Make Word K-Periodic
You are given a string word
of size n
, and an integer k
such that k
divides n
.
3134. Find the Median of the Uniqueness Array
You are given an integer array nums
. The uniqueness array of nums
is the sorted array that contains the number of distinct elements of all the subarrays of nums
. In other words, it is a sorted array consisting of distinct(nums[i..j])
, for all 0 <= i <= j < nums.length
.
3132. Find the Integer Added to Array II
You are given two integer arrays nums1
and nums2
.
3131. Find the Integer Added to Array I
You are given two arrays of equal length, nums1
and nums2
.