LeetCode 2606: Find the Substring With Maximum Cost Solution

Master LeetCode problem 2606 (Find the Substring With Maximum Cost), 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.

2606. Find the Substring With Maximum Cost

Medium

Array Hash Table String Dynamic Programming

Problem Explanation

Explanation

To solve this problem, we can iterate through all possible substrings of the input string s. For each substring, we calculate the cost by summing the values of the characters in the substring based on the given rules. We keep track of the maximum cost encountered so far and return it as the result.

Algorithm:

Initialize a variable maxCost to store the maximum cost encountered so far.
Iterate through all possible substrings of s.
For each substring, calculate the cost by summing the values of the characters in the substring according to the rules.
Update maxCost if the current cost is greater.
Return maxCost as the result.

Time Complexity: O(n^2) where n is the length of the input string s. Space Complexity: O(1)

Solution Code

class Solution {
    public int getMaxCost(String s, String chars, int[] vals) {
        int maxCost = 0;
        for (int i = 0; i < s.length(); i++) {
            for (int j = i; j < s.length(); j++) {
                int cost = 0;
                for (int k = i; k <= j; k++) {
                    char c = s.charAt(k);
                    int val = chars.indexOf(c) == -1 ? c - 'a' + 1 : vals[chars.indexOf(c)];
                    cost += val;
                }
                maxCost = Math.max(maxCost, cost);
            }
        }
        return maxCost;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2606 (Find the Substring With Maximum Cost)?

This page provides optimized solutions for LeetCode problem 2606 (Find the Substring With Maximum Cost) 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 2606 (Find the Substring With Maximum Cost)?

The time complexity for LeetCode 2606 (Find the Substring With Maximum Cost) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2606 on DevExCode?

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

Back to LeetCode Solutions