Minimum Domino Rotations For Equal Row In a row of dominoes, tops[i] and bottoms[i] represent the top and bottom halves of the ith domino. (A domino is a tile with two numbers from 1 to 6 - one o...

Maximum Number of Tasks You Can Assign You have n tasks and m workers. Each task has a strength requirement stored in a 0-indexed integer array tasks, with the ith task requiring tasks[i] strengt...

Find Numbers with Even Number of Digits Given an array nums of integers, return how many of them contain an even number of digits.   Example 1: **Input:** nums = [12,345,2,6,7896] **Output:**...

Count Subarrays Where Max Element Appears at Least K Times You are given an integer array nums and a positive integer k. Return the number of subarrays where the maximum element of *nums appears...

Count Subarrays With Score Less Than K The score of an array is defined as the product of its sum and its length. For example, the score of [1, 2, 3, 4, 5] is (1 + 2 + 3 + 4 + 5) * 5 = 75. Giv...

Count Subarrays of Length Three With a Condition Given an integer array nums, return the number of subarrays of length 3 such that the sum of the first and third numbers equals exactly half of th...

Count Subarrays With Fixed Bounds You are given an integer array nums and two integers minK and maxK. A fixed-bound subarray of nums is a subarray that satisfies the following conditions: The *...

Count of Interesting Subarrays You are given a 0-indexed integer array nums, an integer modulo, and an integer k. Your task is to find the count of subarrays that are interesting. A subarray nu...

Count Complete Subarrays in an Array You are given an array nums consisting of positive integers. We call a subarray of an array complete if the following condition is satisfied: The number of ...

Count Largest Group You are given an integer n. Each number from 1 to n is grouped according to the sum of its digits. Return the number of groups that have the largest size.   Example 1: *...