The developers at AWS IAM are designing a new checksum logic for an authentication module. The checksum is calculated as an array hash where hash[i] = secretKey[i] % param[i]. There are n parameters for the checksum, where the ith parameter is represented by param[i]. The secret key consists of n values, with the ith value denoted as secretKey[i].
A good secret key is one that results in more distinct values in the hash array.
Given the array param of size n, determine the maximum number of possible distinct values in the hash array by selecting an appropriate secretKey.
Complete the function findHash in the editor.
findHash has the following parameter:
int param[n]: the different parameters needed for the checksum logic
Returns
int: the maximum number of distinct elements possible in hash.
param = [1, 2, 4] return = 3
secretKey = [1, 3, 2], resulting in the hash array [0, 1, 2], which consists of 3 distinct elements.param = [1, 1, 1] return = 1
secretKey = [1, 2, 3], we get hash = [0, 0, 0], resulting in only one unique value, which is 0. Therefore, the answer is 1.1 ≤ n ≤ 2 * 10^51 ≤ param[i] ≤ 10^9
- Count Promotional PeriodsOA · Seen Jun 2026
- Find Maximum Total Amount (SDE I, Fungible :)Seen Jun 2026
- Get Minimum AmountOA · Seen Jun 2026
- Find Minimum CostOA · Seen Jun 2026
- Get Smallest Base SegmentOA · Seen Jun 2026
- Maximum Non-Adjacent House ValueONSITE INTERVIEW · Seen Jun 2026
- Running Delivery Time MediansONSITE INTERVIEW · Seen Jun 2026
- Select Least Resource TasksOA · Seen Jun 2026
public int findHash(int[] param) {
// write your code here
}