Skip to main content
  1. LeetCode/

LeetCode 3528: Unit Conversion I

·1 min· ·
LeetCode Bi-Weekly Medium
Wei Yi Chung
Author
Wei Yi Chung
Working at the contributing of open source, distributed systems, and data engineering.
Table of Contents
LeetCode Bi-Weekly Contest 155 - This article is part of a series.
Part 2: This Article

Meta Data
#

Difficulty: medium First Attempt: 2025-04-26

  • Total time: 10:00.00

Intuition
#

Brute-force:
Simply iterate through the conversions list and count the results.

Approach
#

class Solution:
    def baseUnitConversions(self, conversions: List[List[int]]) -> List[int]:
        n = len(conversions)+1
        base = [1]*n
        
        for (start, end, times) in conversions:
            base[end] = (base[start]*times)%(10**9 + 7)
            
        
        return base

Findings
#

NA

Encountered Problems
#

NA

LeetCode Bi-Weekly Contest 155 - This article is part of a series.
Part 2: This Article

Related

LeetCode 3527: Find the Most Common Response
·1 min
LeetCode Bi-Weekly Medium
LeetCode Problem Solving
LeetCode 3513: Number of Unique XOR Triplets I
·2 mins
LeetCode Bi-Weekly Medium Unsolved Bit
LeetCode Problem Solving
LeetCode 2145: Count the Hidden Sequences
·2 mins
LeetCode Daily Medium
LeetCode Problem Solving
LeetCode 2799: Count Complete Subarrays in an Array
·1 min
LeetCode Daily Medium
LeetCode Problem Solving
LeetCode 2381: Shifting Letters II
·2 mins
LeetCode Medium Difference Array
LeetCode Problem Solving
LeetCode 3522: Calculate Score After Performing Instructions
·1 min
LeetCode Weekly Medium
LeetCode Problem Solving