Skip to content

Practice Final Array State After K Multiplication Operations I

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#3264
LeetCode Problem

Final Array State After K Multiplication Operations I

ArrayMathHeap (Priority Queue)Simulation

Problem Statement

Given nums, k, and multiplier, perform k operations. Each time, select the first occurrence of the smallest current value and replace it with that value multiplied by multiplier. Return the resulting array.

Source: Final Array State After K Multiplication Operations I on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [2,1,3,5,6], k = 5, multiplier = 2
Output
[8,4,6,5,6]

# Example 2

Input
nums = [1,2], k = 3, multiplier = 4
Output
[16,8]

Constraints

1 <= nums.length <= 100
1 <= nums[i] <= 100
1 <= k <= 10
1 <= multiplier <= 5

Related LeetCode Problems

Practice more problems similar to Final Array State After K Multiplication Operations I.

1 Two Sum Easy2 Add Two Numbers Medium4 Median of Two Sorted Arrays Hard7 Reverse Integer Medium9 Palindrome Number Easy
← Previous Count Substrings That Satisfy K-Constraint IINext → Count Almost Equal Pairs I

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free