Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

3555. Final Array State After K Multiplication Operations I

My accepted Python solution to LeetCode problem 3555, Final Array State After K Multiplication Operations I, running in 2ms.

  • Difficulty: Easy
  • Python
  • Runtime 2ms
  • Memory 17.2MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 2ms, memory 17.2MB, accepted 2025-12-29.

python
class Solution:
    def getFinalState(self, nums: List[int], k: int, multiplier: int) -> List[int]:
        for _ in range(k):
            # Find the minimum value and its first occurrence index
            min_val = min(nums)
            min_idx = nums.index(min_val)
            # Multiply it
            nums[min_idx] *= multiplier
        return nums

Source