LeetCode 2281: Sum of Total Strength of Wizards Solution

Master LeetCode problem 2281 (Sum of Total Strength of Wizards), a hard 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.

2281. Sum of Total Strength of Wizards

Hard

Array Stack Monotonic Stack Prefix Sum

Problem Explanation

Explanation:

To solve this problem, we can iterate through all contiguous subarrays and calculate the total strength for each subarray according to the given formula. We can then sum up all these total strengths to get the final result.

Initialize a variable result to store the total sum of strengths.
Iterate over all possible subarrays:
- For each subarray, calculate the total strength as the product of the minimum strength in the subarray and the sum of all strengths in the subarray.
- Add this total strength to the result.
Return the final result modulo 10^9 + 7 as the answer.

Time Complexity: O(n^2) where n is the number of wizards in the input array. Space Complexity: O(1)

Solution Code

class Solution {
    public int sumOfTotalStrength(int[] strength) {
        int mod = 1000000007;
        long result = 0;
        
        for (int i = 0; i < strength.length; i++) {
            long minStrength = strength[i];
            long sumStrength = 0;
            
            for (int j = i; j < strength.length; j++) {
                minStrength = Math.min(minStrength, strength[j]);
                sumStrength += strength[j];
                
                result = (result + minStrength * sumStrength) % mod;
            }
        }
        
        return (int) result;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2281 (Sum of Total Strength of Wizards)?

This page provides optimized solutions for LeetCode problem 2281 (Sum of Total Strength of Wizards) 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 2281 (Sum of Total Strength of Wizards)?

The time complexity for LeetCode 2281 (Sum of Total Strength of Wizards) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2281 on DevExCode?

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

Back to LeetCode Solutions