python3

javascript

java

Largest Rectangle in Histogram

Given an array of integers ``heights`` representing the histogram's bar height where the width of each bar is ``1``, Return the area of *the largest rectangle in the histogram.*
### Input Format

First Parameter:  number `n`

Second Parameter: array  of number ``heights`` of size `n`

### Output Format
Return the integer
### Example 1

![image](https://assets.leetcode.com/uploads/2021/01/04/histogram.jpg )
```
Input: heights = [2,1,5,6,2,3]
Output: 10
Explanation: The above is a histogram where width of each bar is 1.
The largest rectangle is shown in the red area, which has an area = 10 units.
```
### Example 2
![image](https://assets.leetcode.com/uploads/2021/01/04/histogram-1.jpg )
```
Input: heights = [2, 4]
Output: 4
```

#### Constraints
- 1 <= heights.length <=10^5^
- 0 <= heights[i] <= 10^5^ 
- Expected Time Complexity - O(n)
- Expected Space Complexity - O(n)

function solve(n, heights){
// CODE HERE
}

int solve(int n, vector<int> heights){
//CODE HERE 
}

static int solve(int n, int[] heights){
//CODE HERE 
}