LeetCode 3387: Maximize Amount After Two Days of Conversions Solution

Master LeetCode problem 3387 (Maximize Amount After Two Days of Conversions), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

3387. Maximize Amount After Two Days of Conversions

Medium

Array String Depth-First Search Breadth-First Search Graph

Problem Explanation

Explanation

To solve this problem, we need to find the maximum amount of initialCurrency that can be obtained after performing conversions on both days. We can achieve this by simulating the conversions using the provided rates for both days. We will keep track of the maximum amount obtained and return it at the end.

The algorithm involves iterating through the conversion pairs and rates for day 1, converting the initial currency to the target currency using the given rates, and then repeating the process for day 2. Finally, we convert the final currency back to the initial currency using the inverse rates.

Time Complexity: The time complexity of this algorithm is O(n + m) where n is the number of pairs on day 1 and m is the number of pairs on day 2.

Space Complexity: The space complexity is O(n + m) for storing the conversion pairs and rates.

Solution Code

class Solution {
    public double maximizeAmount(String initialCurrency, String[][] pairs1, double[] rates1, String[][] pairs2, double[] rates2) {
        double amount = 1.0;
        Map<String, Double> ratesMap = new HashMap<>();
        
        // Day 1 conversions
        for (int i = 0; i < pairs1.length; i++) {
            ratesMap.put(pairs1[i][1], rates1[i]);
        }
        
        // Convert initial currency to day 1 target currency
        if (ratesMap.containsKey(initialCurrency)) {
            amount *= ratesMap.get(initialCurrency);
        }
        
        // Day 2 conversions
        ratesMap.clear();
        for (int i = 0; i < pairs2.length; i++) {
            ratesMap.put(pairs2[i][1], rates2[i]);
        }
        
        // Convert day 1 target currency to day 2 target currency
        if (ratesMap.containsKey(pairs1[pairs1.length - 1][1])) {
            amount *= ratesMap.get(pairs1[pairs1.length - 1][1]);
        }
        
        // Convert day 2 target currency back to initial currency
        if (ratesMap.containsKey(initialCurrency)) {
            amount /= ratesMap.get(initialCurrency);
        }
        
        return amount;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3387 (Maximize Amount After Two Days of Conversions)?

This page provides optimized solutions for LeetCode problem 3387 (Maximize Amount After Two Days of Conversions) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 3387 (Maximize Amount After Two Days of Conversions)?

The time complexity for LeetCode 3387 (Maximize Amount After Two Days of Conversions) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3387 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 3387 in Java, C++, or Python.

Back to LeetCode Solutions