Given an array **arr[]** of **N** integers representing the heights of the sticks. The task is to find the area of the largest square that can be formed using these sticks and the count of such squares. **Note** that a single side of the square can only use a single stick.

**Examples:**

Input:arr[] = {5, 3, 2, 3, 6, 3, 3}

Output:

Area = 9

Count = 1

Side of the square will be 3 and

only one such square is possible.

Input:arr[] = {2, 2, 2, 9, 2, 2, 2, 2, 2}

Output:

Area = 4

Count = 2

**Approach:** Count the frequencies of all the elements of the array. Now, starting from the maximum (in order to maximize the area) find the first frequency which is at least 4 so that a square can be formed then the area can be calculated as freq[i] * freq[i] and the count of such squares will be freq[i] / 4.

Below is the implementation of the above approach:

## C++

`// C++ implementation of the approach ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find the area of the largest ` `// square that can be formed ` `// and the count of such squares ` `void` `findMaxSquare(` `int` `arr[], ` `int` `n) ` `{ ` ` ` ` ` `// Maximum value from the array ` ` ` `int` `maxVal = *max_element(arr, arr + n); ` ` ` ` ` `// Update the frequencies of ` ` ` `// the array elements ` ` ` `int` `freq[maxVal + 1] = { 0 }; ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `freq[arr[i]]++; ` ` ` ` ` `// Starting from the maximum length sticks ` ` ` `// in order to maximize the area ` ` ` `for` `(` `int` `i = maxVal; i > 0; i--) { ` ` ` ` ` `// The count of sticks with the current ` ` ` `// length has to be at least 4 ` ` ` `// in order to form a square ` ` ` `if` `(freq[i] >= 4) { ` ` ` `cout << ` `"Area = "` `<< (` `pow` `(i, 2)); ` ` ` `cout << ` `"\nCount = "` `<< (freq[i] / 4); ` ` ` `return` `; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Impossible to form a square ` ` ` `cout << ` `"-1"` `; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `arr[] = { 2, 2, 2, 9, 2, 2, 2, 2, 2 }; ` ` ` `int` `n = ` `sizeof` `(arr) / ` `sizeof` `(arr[0]); ` ` ` ` ` `findMaxSquare(arr, n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java implementation of the approach ` `import` `java.util.*; ` ` ` `class` `GFG ` `{ ` ` ` `// Function to find the area of the largest ` `// square that can be formed ` `// and the count of such squares ` `static` `void` `findMaxSquare(` `int` `arr[], ` `int` `n) ` `{ ` ` ` ` ` `// Maximum value from the array ` ` ` `int` `maxVal = Arrays.stream(arr).max().getAsInt(); ` ` ` ` ` `// Update the frequencies of ` ` ` `// the array elements ` ` ` `int` `[]freq = ` `new` `int` `[maxVal + ` `1` `]; ` ` ` `for` `(` `int` `i = ` `0` `; i < n; i++) ` ` ` `freq[arr[i]]++; ` ` ` ` ` `// Starting from the maximum length sticks ` ` ` `// in order to maximize the area ` ` ` `for` `(` `int` `i = maxVal; i > ` `0` `; i--) ` ` ` `{ ` ` ` ` ` `// The count of sticks with the current ` ` ` `// length has to be at least 4 ` ` ` `// in order to form a square ` ` ` `if` `(freq[i] >= ` `4` `) ` ` ` `{ ` ` ` `System.out.print(` `"Area = "` `+ ` ` ` `(Math.pow(i, ` `2` `))); ` ` ` `System.out.print(` `"\nCount = "` `+ ` ` ` `(freq[i] / ` `4` `)); ` ` ` `return` `; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Impossible to form a square ` ` ` `System.out.print(` `"-1"` `); ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `arr[] = { ` `2` `, ` `2` `, ` `2` `, ` `9` `, ` `2` `, ` `2` `, ` `2` `, ` `2` `, ` `2` `}; ` ` ` `int` `n = arr.length; ` ` ` ` ` `findMaxSquare(arr, n); ` `} ` `} ` ` ` `// This code is contributed by Princi Singh ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation of the approach ` ` ` `# Function to find the area of the largest ` `# square that can be formed ` `# and the count of such squares ` `def` `findMaxSquare(arr, n) : ` ` ` ` ` `# Maximum value from the array ` ` ` `maxVal ` `=` `max` `(arr); ` ` ` ` ` `# Update the frequencies of ` ` ` `# the array elements ` ` ` `freq ` `=` `[` `0` `] ` `*` `(maxVal ` `+` `1` `) ; ` ` ` `for` `i ` `in` `range` `(n) : ` ` ` `freq[arr[i]] ` `+` `=` `1` `; ` ` ` ` ` `# Starting from the maximum length sticks ` ` ` `# in order to maximize the area ` ` ` `for` `i ` `in` `range` `(maxVal, ` `0` `, ` `-` `1` `) : ` ` ` ` ` `# The count of sticks with the current ` ` ` `# length has to be at least 4 ` ` ` `# in order to form a square ` ` ` `if` `(freq[i] >` `=` `4` `) : ` ` ` `print` `(` `"Area = "` `, ` `pow` `(i, ` `2` `)); ` ` ` `print` `(` `"Count ="` `, freq[i] ` `/` `/` `4` `); ` ` ` `return` `; ` ` ` ` ` `# Impossible to form a square ` ` ` `print` `(` `"-1"` `); ` ` ` `# Driver code ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` ` ` `arr ` `=` `[ ` `2` `, ` `2` `, ` `2` `, ` `9` `, ` `2` `, ` `2` `, ` `2` `, ` `2` `, ` `2` `]; ` ` ` `n ` `=` `len` `(arr); ` ` ` ` ` `findMaxSquare(arr, n); ` ` ` `# This code is contributed by AnkitRai01 ` |

*chevron_right*

*filter_none*

## C#

`// C# implementation of the approach ` `using` `System; ` `using` `System.Linq; ` ` ` `class` `GFG ` `{ ` ` ` `// Function to find the area of the largest ` `// square that can be formed ` `// and the count of such squares ` `static` `void` `findMaxSquare(` `int` `[]arr, ` `int` `n) ` `{ ` ` ` ` ` `// Maximum value from the array ` ` ` `int` `maxVal = arr.Max(); ` ` ` ` ` `// Update the frequencies of ` ` ` `// the array elements ` ` ` `int` `[]freq = ` `new` `int` `[maxVal + 1]; ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `freq[arr[i]]++; ` ` ` ` ` `// Starting from the maximum length sticks ` ` ` `// in order to maximize the area ` ` ` `for` `(` `int` `i = maxVal; i > 0; i--) ` ` ` `{ ` ` ` ` ` `// The count of sticks with the current ` ` ` `// length has to be at least 4 ` ` ` `// in order to form a square ` ` ` `if` `(freq[i] >= 4) ` ` ` `{ ` ` ` `Console.Write(` `"Area = "` `+ ` ` ` `(Math.Pow(i, 2))); ` ` ` `Console.Write(` `"\nCount = "` `+ ` ` ` `(freq[i] / 4)); ` ` ` `return` `; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Impossible to form a square ` ` ` `Console.Write(` `"-1"` `); ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main(String[] args) ` `{ ` ` ` `int` `[]arr = { 2, 2, 2, 9, 2, 2, 2, 2, 2 }; ` ` ` `int` `n = arr.Length; ` ` ` ` ` `findMaxSquare(arr, n); ` `} ` `} ` ` ` `// This code is contributed by 29AjayKumar ` |

*chevron_right*

*filter_none*

**Output:**

Area = 4 Count = 2

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Largest square which can be formed using given rectangular blocks
- Largest area square in an array when elements can be shuffled
- Find the largest number that can be formed with the given digits
- Lexicographically largest string formed from the characters in range L and R
- Largest number in given Array formed by repeatedly combining two same elements
- Find the largest area rectangular sub-matrix whose sum is equal to k
- Largest component size in a graph formed by connecting non-co-prime nodes
- Maximize number of groups formed with size not smaller than its largest element
- Largest number that is not a perfect square
- Minimum length of the reduced Array formed using given operations
- Count of non decreasing arrays of length N formed with values in range L to R
- Length of longest Fibonacci subarray formed by removing only one element
- Longest palindrome formed by concatenating and reordering strings of equal length
- Find Maximum Length Of A Square Submatrix Having Sum Of Elements At-Most K
- Find the length of largest subarray with 0 sum
- Length of the largest subarray with contiguous elements | Set 1
- Length of the largest subarray with contiguous elements | Set 2
- Length of largest subarray whose all elements are Perfect Number
- Length of largest subarray whose all elements Powerful number
- Find the length of largest subarray in which all elements are Autobiographical Numbers

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.