Skip to content
Related Articles

Related Articles

Improve Article

Minimize number of boxes by putting small box inside bigger one

  • Difficulty Level : Medium
  • Last Updated : 18 May, 2021

Given an array size[] of box sizes, our task is to find the number of boxes left at the end, after putting the smaller-sized box into a bigger one. 
Note: Only one small box can fit inside one box.
Examples: 

Input: size[] = {1, 2, 3} 
Output: 1 
Explanation: 
Here, box of size 1 can fit inside box of size 2 and the box of size 2 can fit inside box of size 3. So at last we have only one box of size 3.

Input: size[] = {1, 2, 2, 3, 7, 4, 2, 1} 
Output: 3 
Explanation: 
Put the box of size 1, 2, 3, 4 and 7 together and for the second box put 1 and 2 together. At last 2 is left which will not fit inside anyone. So we have 3 boxes left. 

Approach: The idea is to follow the steps given below:



  • Sort the given array size[] in increasing order and check if the current box size is greater than the next box size. If yes then decrease the initial box number.
  • Otherwise, if the current box size is equal to next box size, then check if the current box can fit inside next to next box size. If yes then move the current box pointing variable, else move next pointing variable further.

Below is the implementation of the above approach: 

C++




// C++ implementation to minimize the
// number of the box by putting small
// box inside the bigger one
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to minimize the count
void minBox(int arr[], int n)
{
    // Initial number of box
    int box = n;
 
    // Sort array of box size
    // in increasing order
    sort(arr, arr + n);
 
    int curr_box = 0, next_box = 1;
    while (curr_box < n && next_box < n) {
 
        // check is current box size
        // is smaller than next box size
        if (arr[curr_box] < arr[next_box]) {
 
            // Decrement box count
            // Increment current box count
            // Increment next box count
            box--;
            curr_box++;
            next_box++;
        }
 
        // Check if both box
        // have same size
        else if (arr[curr_box] == arr[next_box])
            next_box++;
    }
 
    // Print the result
    cout << box << endl;
}
 
// Driver code
int main()
{
    int size[] = { 1, 2, 3 };
    int n = sizeof(size) / sizeof(size[0]);
    minBox(size, n);
    return 0;
}
Java



// Java implementation to minimize the
// number of the box by putting small
// box inside the bigger one
import java.util.Arrays;
 
class GFG{
     
// Function to minimize the count
public static void minBox(int arr[], int n)
{
     
    // Initial number of box
    int box = n;
 
    // Sort array of box size
    // in increasing order
    Arrays.sort(arr);
 
    int curr_box = 0, next_box = 1;
    while (curr_box < n && next_box < n)
    {
         
        // Check is current box size
        // is smaller than next box size
        if (arr[curr_box] < arr[next_box])
        {
             
            // Decrement box count
            // Increment current box count
            // Increment next box count
            box--;
            curr_box++;
            next_box++;
        }
 
        // Check if both box
        // have same size
        else if (arr[curr_box] ==
                 arr[next_box])
            next_box++;
    }
 
    // Print the result
    System.out.println(box);
}
 
// Driver code
public static void main(String args[])
{
    int []size = { 1, 2, 3 };
    int n = size.length;
     
    minBox(size, n);
}
}
 
// This code is contributed by SoumikMondal
Python3



# Python3 implementation to minimize the
# number of the box by putting small
# box inside the bigger one
 
# Function to minimize the count
def minBox(arr, n):
     
    # Initial number of box
    box = n
 
    # Sort array of box size
    # in increasing order
    arr.sort()
 
    curr_box, next_box = 0, 1
    while (curr_box < n and next_box < n):
 
        # Check is current box size
        # is smaller than next box size
        if (arr[curr_box] < arr[next_box]):
 
            # Decrement box count
            # Increment current box count
            # Increment next box count
            box = box - 1
            curr_box = curr_box + 1
            next_box = next_box + 1
 
        # Check if both box
        # have same size
        elif (arr[curr_box] == arr[next_box]):
            next_box = next_box + 1
 
    # Print the result
    print(box)
 
# Driver code
size = [ 1, 2, 3 ]
n = len(size)
 
minBox(size, n)
 
# This code is contributed by divyeshrabadiya07
C#



// C# implementation to minimize the
// number of the box by putting small
// box inside the bigger one
using System;
 
class GFG{
     
// Function to minimize the count
public static void minBox(int []arr, int n)
{
     
    // Initial number of box
    int box = n;
 
    // Sort array of box size
    // in increasing order
    Array.Sort(arr);
 
    int curr_box = 0, next_box = 1;
    while (curr_box < n && next_box < n)
    {
         
        // Check is current box size
        // is smaller than next box size
        if (arr[curr_box] < arr[next_box])
        {
             
            // Decrement box count
            // Increment current box count
            // Increment next box count
            box--;
            curr_box++;
            next_box++;
        }
 
        // Check if both box
        // have same size
        else if (arr[curr_box] ==
                 arr[next_box])
            next_box++;
    }
 
    // Print the result
    Console.WriteLine(box);
}
 
// Driver code
public static void Main(String []args)
{
    int []size = { 1, 2, 3 };
    int n = size.Length;
     
    minBox(size, n);
}
}
 
// This code is contributed by Amit Katiyar
Javascript



<script>
 
// javascript implementation to minimize the
// number of the box by putting small
// box inside the bigger one
 
      
// Function to minimize the count
function minBox(arr,  n)
{
      
    // Initial number of box
    var box = n;
  
    // Sort array of box size
    // in increasing order
    arr.sort();
  
    var curr_box = 0, next_box = 1;
    while (curr_box < n && next_box < n)
    {
          
        // Check is current box size
        // is smaller than next box size
        if (arr[curr_box] < arr[next_box])
        {
              
            // Decrement box count
            // Increment current box count
            // Increment next box count
            box--;
            curr_box++;
            next_box++;
        }
  
        // Check if both box
        // have same size
        else if (arr[curr_box] ==
                 arr[next_box])
            next_box++;
    }
  
    // Print the result
    document.write(box);
}
  
// Driver code
 
    var size = [ 1, 2, 3 ];
    var n = size.length;
      
    minBox(size, n);
     
</script>
Output
1
Time Complexity: O(N*logN) as Arrays.sort() method is used.
Auxiliary Space: O(1)
Approach: The key observation in the problem is that the minimum number of boxes is same as the maximum frequency of any element in the array. Because the rest of the elements are adjusted into one another.  Below is the illustration with the help of steps:
  • Create a Hash-map to store the frequency of the elements.
  • Finally, after maintaining the frequency return the maximum frequency of the element.
Below is the implementation of the above approach:
Java



// Java implementation of the
// above approach
 
import java.util.*;
 
public class Boxes {
   
    // Function to count the boxes
    // at the end
    int countBoxes(int[] A) {
       
        // Default value if
        // array is empty
        int count = -1;
        int n = A.length;
       
         // Map to store frequencies
        Map<Integer, Integer> map =
          new HashMap<>();
       
        // Loop to iterate over the
        // elements of the array
        for (int i=0; i<n; i++) {
            int key = A[i];
            map.put(key,
              map.getOrDefault(key, 0) + 1);
            int val = map.get(key);
           
            // Condition to get the maximum
            // value of the key
            if (val > count) count = val;
        }
        return count;
    }
     
    // Driver Code
    public static void main(
                  String[] args)
    {
        int[] a = {8, 15, 1, 10, 5, 1};
        Boxes obj = new Boxes();
       
        // Function Call
        int minBoxes = obj.countBoxes(a);
          System.out.println(minBoxes);
    }
}
Output
2
Time Complexity: O(N)
Auxiliary Space: O(N)



My Personal Notes
arrow_drop_up
Previous
Maximum number of envelopes that can be put inside other bigger envelopes
Next

Number of visible boxes after putting one inside another
Recommended Articles
Page :
Number of visible boxes after putting one inside another
16, Nov 17
Color N boxes using M colors such that K boxes have different color from the box on its left
21, Jan 19
Maximum number of envelopes that can be put inside other bigger envelopes
10, Aug 20
Color all boxes in line such that every M consecutive boxes are unique
01, Oct 19
Elements before which no element is bigger in array
13, Dec 16
Number of ways to select K small even number from left of each element in given Array
23, Jun 21
Count the number of ways to fill K boxes with N distinct items
29, Apr 20
Minimum number of stacks possible using boxes of given capacities
14, Feb 19
Find the number of boxes to be removed
24, Oct 18
Dial's Algorithm (Optimized Dijkstra for small range weights)
11, Apr 16
Remove duplicates from an array of small primes
11, Jul 16
Smallest element repeated exactly ‘k’ times (not limited to small range)
30, Aug 17
kth smallest/largest in a small range unsorted array
02, Nov 18
Minimum capacity of small arrays needed to contain all element of the given array
10, May 20
Frequency of each element of an array of small ranged values
02, Dec 18
Minimum boxes required to carry all gifts
09, Nov 18
Minimum time required to transport all the boxes from source to the destination under the given constraints
24, Apr 19
Maximize the diamonds by choosing different colour diamonds from adjacent boxes
23, Jul 21
Minimize the maximum minimum difference after one removal from array
28, Dec 18
Minimize sum of adjacent difference with removal of one element from array
02, Mar 19
Minimize maximum difference between any pair of array elements by exactly one removal
11, Jun 21
Minimize remaining array element by repeatedly replacing pairs by half of one more than their sum
09, Nov 20
Minimize segments required to be removed such that at least one segment intersects with all remaining segments
14, Feb 21
Minimize cost to reach end of an array by two forward jumps or one backward jump in each move
19, Feb 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
a_phenomenal
@a_phenomenal
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox