long largestRectangle(vector<int> h) {
    long maxArea;
    //base case
    if (h.empty()) {
        return 0;
    }
    //second stack to divide the current stack in two
    vector<int> a;
    //minimum element present in current stack
    int minimum = *min_element(h.begin(),h.end());
		//divide the stack
    while (h.back()!=minimum) {
        a.push_back(h.back());
        h.pop_back();
    }
    // find area using minimum value stack 
    long ar = minimum * (a.size() + h.size());
    //remove the minimum value
    h.pop_back();
    //compare the max area of current stack and that from the divided stack using recursion
    maxArea = max(ar,max(largestRectangle(a),largestRectangle(h)));
    return maxArea;
}

function largestRectangle(h) {
    let largest = 0;
    let n = h.length;
    
    
    for(let i = 0; i < n ; i++){
        let counter = 1;
        for(let j = i - 1; j >= 0 ; j--){
            if(j < 0 || h[j] < h[i]){
              break;
            }
           
            counter++;
        }
        console.log(h[i] + ' : ' + counter);
        let temp = i + 1;
        while(h[temp] >= h[i] && i < n){
            counter++;
            temp++;
        }
        if(h[i] * counter > largest)
        largest = h[i] * counter;
    }
    return largest;
}

let area = 0;
            for(let i = 0; i < h.length; i++){
                let height = h[i]
                let length = 1 
                let area1 = 0;
                let area2 = 0;
                let j = i+1;
                    //forward traversal
                    while(j < h.length){
                        if(height > h[j])break
                        if(height <= h[j])length++
                        j++           
                    }
                    area1 = (height*length);
                    j = i-1;
                    length = 1;
                    // Backward Traversal
                    while(j >= 0){
                        if(height > h[j])break
                        if(height <= h[j])length++
                        j--;         
                    }
                    area2 = (height*(length-1));
                if(area < (area1+area2))area = (area1+area2) 
            }
            return area;

    public static long largestRectangle(List<int> h)
    {
        long max = 0;
        for(int i=0;i<h.Count;i++)
        {
            int n = h[i];
            int l = 0;
            for(int j=i-1;j>=0;j--)
            {
                int nl = h[j];
                if (nl < n) break;
                l++;
            }
            int r = 0;
            for(int j=i+1;j<h.Count;j++)
            {
                int nr = h[j];
                if (nr < n) break;
                r++;
            }
            long a = (long)n*(long)(l+r+1);
            if (a > max) max = a;
        }
        return max;
    }