3265. Count Almost Equal Pairs I
3265. Count Almost Equal Pairs I
Description
You are given an array nums
consisting of positive integers.
3265. Count Almost Equal Pairs I
You are given an array nums
consisting of positive integers.
3264. Final Array State After K Multiplication Operations I
You are given an integer array nums
, an integer k
, and an integer multiplier
.
3261. Count Substrings That Satisfy K-Constraint II
You are given a binary string s
and an integer k
.
3260. Find the Largest Palindrome Divisible by K
You are given two positive integers n
and k
.
3259. Maximum Energy Boost From Two Drinks
You are given two integer arrays energyDrinkA
and energyDrinkB
of the same length n
by a futuristic sports scientist. These arrays represent the energy boosts per hour provided by two different energy drinks, A and B, respectively.
3258. Count Substrings That Satisfy K-Constraint I
You are given a binary string s
and an integer k
.
3257. Maximum Value Sum by Placing Three Rooks II
You are given a m x n
2D array board
representing a chessboard, where board[i][j]
represents the value of the cell (i, j)
.
3255. Find the Power of K-Size Subarrays II
You are given an array of integers nums
of length n
and a positive integer k
.
3254. Find the Power of K-Size Subarrays I
You are given an array of integers nums
of length n
and a positive integer k
.
3235. Check if the Rectangle Corner Is Reachable
You are given two positive integers xCorner
and yCorner
, and a 2D array circles
, where circles[i] = [xi, yi, ri] denotes a circle with center at (xi, yi) and radius ri.