Minimum Moves To Reach Target Score - Leetcode Solution

The Minimum Moves To Reach Target Score problem on LeetCode can be summarized as follows:

Given an array of integers nums (representing a score card), and an integer target representing the target score, return the minimum number of moves required to reach the target score. Each move consists of incrementing any element in the array.

To solve this problem, we can use a simple approach of calculating the sum of the array and then subtracting it from the target. This will give us the total number of moves needed to reach the target score.

Algorithm:

• Calculate the sum of the array using a loop. Let the variable sum hold the value of the sum.
• Calculate the difference between the target and sum. Let diff hold the value of the difference between the target and sum.
• Calculate the number of moves required by dividing the difference by n, the length of the array. Let moves hold the value of the number of moves required.
• If the difference is not divisible by n, then add 1 to moves.
• Return the value of moves.

Let's see the implementation of the above algorithm in Python:

def minMoves(nums, target): sumArray = sum(nums) diff = target - sumArray n = len(nums) moves = diff // n if diff % n != 0: moves += 1 return moves

#Test the function nums = [1,2,3,4,5] target = 15 print(minMoves(nums, target)) #Output: 10

The time complexity of this algorithm is O(n), where n is the length of the array.

1