3352. Count K-Reducible Numbers Less Than N
3352. Count K-Reducible Numbers Less Than N
Description
You are given a binary string s representing a number n in its binary form.
3351. Sum of Good Subsequences
3351. Sum of Good Subsequences
Description
You are given an integer array nums. A good subsequence is defined as a subsequence of nums where the absolute difference between any two consecutive elements in the subsequence is exactly 1.
3350. Adjacent Increasing Subarrays Detection II
3350. Adjacent Increasing Subarrays Detection II
Description
Given an array nums of n integers, your task is to find the maximum value of k for which there exist two adjacent subarrays of length k each, such that both subarrays are strictly increasing. Specifically, check if there are two subarrays of length k starting at indices a and b (a < b), where:
3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K
3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K
Description
You are given an integer k and an integer x. The price of a numbernum is calculated by the count of set bits at positions x, 2x, 3x, etc., in its binary representation, starting from the least significant bit. The following table contains examples of how price is calculated.
2719. Count of Integers
788. Rotated Digits
357. Count Numbers with Unique Digits
357. Count Numbers with Unique Digits
Description
Given an integer n, return the count of all numbers with unique digits, x, where 0 <= x < 10^n.
1067. Digit Count in Range
2999. Count the Number of Powerful Integers
2999. Count the Number of Powerful Integers
Description
You are given three integers start, finish, and limit. You are also given a 0-indexed string s representing a positive integer.
600. Non-negative Integers without Consecutive Ones
600. Non-negative Integers without Consecutive Ones
Description
Given a positive integer n, return the number of the integers in the range [0, n] whose binary representations do not contain consecutive ones.