FastPrepFastPrep
Problem Brief

Lock Code

OA

You are given an array of integers codeSequence of length n and an integer maxValue. A locking system allows you to modify any number in the array to any integer less than or equal to maxValue at a cost of 1 per change.

Two numbers are co-prime if their greatest common divisor (GCD) is 1. To unlock the repository, you need to select a number from the array that is co-prime with all other numbers in the array.

The lock's code is calculated as the maximum possible value of: selected number - total modification cost

Your task is to determine the lock code by selecting an optimal number from the array after modifications that is co-prime with all other numbers in the array.

Function Description

Complete the function decryptCodeLock in the editor with the following parameters:

  1. int codeSequence[n]: the array presented by the code lock
  2. int maxValue: the maximum possible value for any element in the array

Returns

int: the lock code

FastPrep's sincere 🌸thanks🌸 go to our exceptional friend for their meaningful, valued contribution!

1Example 1

Input
codeSequence = [3, 2, 4], maxValue = 6
Output
4
Explanation

Optimally:

  • Change the element at the third position to 5 at the cost of 1 unit: codeSequence' = [3, 2, 5].
  • Choose the element 5 since it is co-prime with both 2 and 3.
  • Calculate lock code = selected number - cost = 5 - 1 = 4.

    • Return 4 as the answer.

    2Example 2

    Input
    codeSequence = [1, 2, 3], maxValue = 6
    Output
    4
    Explanation

    Optimally, change the second and third elements to 5 and 6 at a cost of 2 units, resulting in [1, 5, 6]. The number 6 is coprime with both 1 and 5. The lock's code is 6 - 2 (cost) = 4.

    3Example 3

    Input
    codeSequence = [2, 4, 6, 8], maxValue = 8
    Output
    6
    Explanation

    Optimally, change the third element to 7 at a cost of 1 unit, resulting in [2, 4, 7, 8]. The number 7 is coprime with 2, 4, and 8. The lock's code is 7 - 1 (cost) = 6.

    Constraints

    Limits and guarantees your solution can rely on.

    • 1 ≤ n ≤ 10^3
    • 1 ≤ maxValue ≤ 10^9
    • 1 ≤ codeSequence[i] ≤ maxValue
    public int decryptCodeLock(int[] codeSequence, int maxValue) {
  // write your code here
}
    Input

    codeSequence

    [3, 2, 4]

    maxValue

    6

    Output

    4

    Sign in to submit your solution.