2100 - 2199
2154 - Keep Multiplying Found Values by Two (Easy)
Problem Link
https://leetcode.com/problems/keep-multiplying-found-values-by-two/
Problem Statement
You are given an array of integers nums. You are also given an integer original which is the first number that needs to be searched for in nums.
You then do the following steps:
- If
originalis found innums, multiply it by two (i.e., setoriginal = 2 * original). - Otherwise, stop the process.
- Repeat this process with the new number as long as you keep finding the number.
Return the final value of original.
Example 1:
Input: nums = [5,3,6,1,12], original = 3
Output: 24
Explanation:
- 3 is found in nums. 3 is multiplied by 2 to obtain 6.
- 6 is found in nums. 6 is multiplied by 2 to obtain 12.
- 12 is found in nums. 12 is multiplied by 2 to obtain 24.
- 24 is not found in nums. Thus, 24 is returned.Example 2:
Input: nums = [2,7,9], original = 4
Output: 4
Explanation:
- 4 is not found in nums. Thus, 4 is returned.Constraints:
1 <= nums.length <= 10001 <= nums[i], original <= 1000
Approach 1: Simulation with Set
class Solution {
public:
int findFinalValue(vector<int>& nums, int original) {
set<int> s(nums.begin(), nums.end());
while (s.count(original)) original *= 2;
return original;
}
};2151 - Maximum Good People Based on Statements
Maximize the number of good people by enumerating assignments and checking each good person's statements for consistency.
2155 - All Divisions With the Highest Score of a Binary Array
Find all best binary-array split points by tracking zeroes on the left and ones on the right.