Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

3832. Minimum Cost to Reach Every Position

My accepted Python solution to LeetCode problem 3832, Minimum Cost to Reach Every Position, running in 3ms.

  • Difficulty: Easy
  • Python
  • Runtime 3ms
  • Memory 17.3MB

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 3ms, memory 17.3MB, accepted 2026-01-02.

python
class Solution:
    def minCosts(self, cost: List[int]) -> List[int]:
        n = len(cost)
        result = [0] * n
        min_cost = float('inf')
        
        for i in range(n):
            min_cost = min(min_cost, cost[i])
            result[i] = min_cost
        
        return result

Source