Data Structures Tutorial

Data Structures Tutorial Asymptotic Notation Structure and Union Array Data Structure Linked list Data Structure Type of Linked list Advantages and Disadvantages of linked list Queue Data Structure Implementation of Queue Stack Data Structure Implementation of Stack Sorting Insertion sort Quick sort Selection sort Heap sort Merge sort Bucket sort Count sort Radix sort Shell sort Tree Traversal of the binary tree Binary search tree Graph Spanning tree Linear Search Binary Search Hashing Collision Resolution Techniques

Misc Topic:

Priority Queue in Data Structure Deque in Data Structure Difference Between Linear And Non Linear Data Structures Queue Operations In Data Structure About Data Structures Data Structures Algorithms Types of Data Structures Big O Notations Introduction to Arrays Introduction to 1D-Arrays Operations on 1D-Arrays Introduction to 2D-Arrays Operations on 2D-Arrays Strings in Data Structures String Operations Application of 2D array Bubble Sort Insertion Sort Sorting Algorithms What is DFS Algorithm What Is Graph Data Structure What is the difference between Tree and Graph What is the difference between DFS and BFS Bucket Sort Dijkstra’s vs Bellman-Ford Algorithm Linear Queue Data Structure in C Stack Using Array Stack Using Linked List Recursion in Fibonacci Stack vs Array What is Skewed Binary Tree Primitive Data Structure in C Dynamic memory allocation of structure in C Application of Stack in Data Structures Binary Tree in Data Structures Heap Data Structure Recursion - Factorial and Fibonacci What is B tree what is B+ tree Huffman tree in Data Structures Insertion Sort vs Bubble Sort Adding one to the number represented an array of digits Bitwise Operators and their Important Tricks Blowfish algorithm Bubble Sort vs Selection Sort Hashing and its Applications Heap Sort vs Merge Sort Insertion Sort vs Selection Sort Merge Conflicts and ways to handle them Difference between Stack and Queue AVL tree in data structure c++ Bubble sort algorithm using Javascript Buffer overflow attack with examples Find out the area between two concentric circles Lowest common ancestor in a binary search tree Number of visible boxes putting one inside another Program to calculate the area of the circumcircle of an equilateral triangle Red-black Tree in Data Structures Strictly binary tree in Data Structures 2-3 Trees and Basic Operations on them Asynchronous advantage actor-critic (A3C) Algorithm Bubble Sort vs Heap Sort Digital Search Tree in Data Structures Minimum Spanning Tree Permutation Sort or Bogo Sort Quick Sort vs Merge Sort Boruvkas algorithm Bubble Sort vs Quick Sort Common Operations on various Data Structures Detect and Remove Loop in a Linked List How to Start Learning DSA Print kth least significant bit number Why is Binary Heap Preferred over BST for Priority Queue Bin Packing Problem Binary Tree Inorder Traversal Burning binary tree Equal Sum What is a Threaded Binary Tree? What is a full Binary Tree? Bubble Sort vs Merge Sort B+ Tree Program in Q language Deletion Operation from A B Tree Deletion Operation of the binary search tree in C++ language Does Overloading Work with Inheritance Balanced Binary Tree Binary tree deletion Binary tree insertion Cocktail Sort Comb Sort FIFO approach Operations of B Tree in C++ Language Recaman’s Sequence Tim Sort Understanding Data Processing

Number of visible boxes putting one inside another

You have given one array, which consists of values which represent the sizes of different boxes. We can put one box inside another if the size of the outside box is two times or greater than inside box. You have to find out the number of boxes which are at last visible. Let’s take an example -

Number Of Visible Boxes Putting One Inside Another

For the above diagram, we have three boxes, and their sizes are 2, 3, and 4.

Input-  

2, 3, 4

Output-

2

Explanation- We can put box 2 inside of 4 because its size is greater than 2. Now remaining boxes are 3 and 4. So, the number of boxes is 2.

Algorithm:-

Step 1: Start

Step 2: The value which represents the number of boxes is taken from the user.

Step 3: An array is created of size n. Then values of the array are taken from the user.

Step 4: A function is called to calculate the answer.

Step 5: In this function, we take the input value and the array.

Step 6: The answer is calculated.

Step 7: The value of the answer is returned.

Step 8: The returned value will be printed.

Step 9: Stop.

Explanation of Algorithm: - To solve this problem, we will sort the array. In the function, we create a queue to represent the element which will be visible at the end. We simply traverse the array, and if any element is found which is greater than the front element of the queue, then the front element will be deleted. After the ending of traversal, we get the elements which will be visible. The answer will be the size of the queue.

Code: -

// program in cpp to calculate the number of remaining boxes after putting one inside another.
#include <bits/stdc++.h>
using namespace std;
int fun (int array[], int n)
{
	queue<int> q;
	sort(array, array + n);
	q.push(array[0]);
	for (int i = 1; i < n; i++) {


		int now = q.front();
// deletion of front element of queue if the traversing element is double times or 
//greater than queue
		if (array[i] >= 2 * now)
			q.pop();
		q.push (array[i]);
	}


	return q.size();
}
int main()
{
	int arr[] = { 2, 3, 4};
	int n = sizeof(arr) / sizeof(arr[0]);
	cout << fun(arr, n) << endl;
	return 0;
}

Program in Java

// program in java to calculate the number of remaining boxes after putting one inside another.
import java.util.LinkedList;
import java.util.Queue;
import java.util.Arrays;
public class jtp {
	static int minimumBox(int []arr, int n)
	{		
		Queue<Integer> q = new LinkedList<>();	
		Arrays.sort(arr);	
		q.add(arr[0]);		
		for (int i = 1; i < n; i++)
		{
			int now = q.element();
	// deletion of front element of queue if the traversing element is double times or
 //greater than queue
			if (arr[i] >= 2 * now)
			q.remove();
			q.add(arr[i]);
		}
		return q.size();
	}
	
	// Driver code
	public static void main(String args[])
	{
		int [] arr = { 2, 3, 4};
		int n = arr.length;		
		System.out.println(minimumBox(arr, n));
	}
}

Program in Python

# program in python to calculate the number of remaining boxes after putting one inside another.

import collections
def fun (arr, n):
	q = collections.deque([])
	# sorting the array
	arr.sort()
	q.append(arr[0])
	# traversing the array
	for i in range(1, n):
		now = q[0]
		# deletion of front element of queue if the traversing element is double times or #greater than queue
		if(arr[i] >= 2 * now):
			q.popleft()
		# Pushing each element of array
		q.append(arr[i])
	return len(q)
if __name__=='__main__':
	arr = [2, 3, 4]
	n = len(arr)
	print(fun (arr, n))

Program in JavaScript

// program in JavaScript to calculate the number of remaining boxes after putting one inside another.

<script>
function minimumBox(arr, n)
{
	var q = [];
	arr.sort((a,b)=> a-b)
	q.push(arr[0]);
	// array traversal
	for (var i = 1; i < n; i++) {
		var now = q[0];
		// deletion of front element of queue if the traversing element is double times or //greater than queue
		if (arr[i] >= 2 * now)
			q.pop(0);
		q.push(arr[i]);
	}
	return q.length;
}
var arr = [2, 3, 4];
var n = arr.length;
document.write( minimumBox(arr, n));
</script>

Output:

2

Complexity Analysis: -

Time complexity- Here, we need looping and sorting. For sorting, logn time will be taken and for traversing n time is taken. So, we can find the solution within nlogn time. Time complexity will be O (nlogn).



ADVERTISEMENT
ADVERTISEMENT