LeetCode 2171: Removing Minimum Number of Magic Beans Solution

Master LeetCode problem 2171 (Removing Minimum Number of Magic Beans), 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.

2171. Removing Minimum Number of Magic Beans

Medium

Array Greedy Sorting Enumeration Prefix Sum

Problem Explanation

Explanation:

To solve this problem, we need to find the minimum number of magic beans to remove in order to make the number of beans in each non-empty bag equal. We can achieve this by finding the average number of beans in all bags and then calculating the excess or deficit beans in each bag with respect to this average.

We can iterate through the bags to calculate the total number of beans and the number of bags with excess or deficit beans. We then remove beans from bags with excess beans and distribute them among bags with deficit beans until all bags have an equal number of beans.

Calculate the total number of beans and the average number of beans per bag.
Iterate through the bags to determine the excess or deficit beans in each bag.
Remove beans from bags with excess beans and distribute them to bags with deficit beans.
Repeat the process until all bags have an equal number of beans.

Solution Code

class Solution {
    public int minOperations(int[] beans) {
        int totalBeans = 0;
        int n = beans.length;
        for (int bean : beans) {
            totalBeans += bean;
        }
        
        int avgBeans = totalBeans / n;
        int count = 0;
        
        for (int bean : beans) {
            if (bean > avgBeans) {
                count += bean - avgBeans;
            }
        }
        
        return count;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2171 (Removing Minimum Number of Magic Beans)?

This page provides optimized solutions for LeetCode problem 2171 (Removing Minimum Number of Magic Beans) 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 2171 (Removing Minimum Number of Magic Beans)?

The time complexity for LeetCode 2171 (Removing Minimum Number of Magic Beans) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2171 on DevExCode?

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

Back to LeetCode Solutions