Given an integer array nums, an integer k, and an integer multiplier:

• Perform k operations on nums.

• In each operation:

  • Find the minimum element x in nums (if there are multiple occurrences of the minimum value, choose the first occurrence).

  • Replace x with x * multiplier.

Return the final state of nums after all k operations.

Constraints:

• $1 <=$ nums.length $<= 100$

• $1 <=$ nums[i] $<= 100$

• $1 <=$ k $<= 10$

• $1 <=$ multiplier $<= 5$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding on how to solve this problem.

Implement your solution in the following coding playground.