### Problem Statement :

```Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed.

There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join  adjacent buildings, they will form a solid rectangle of area .

For example, the heights array . A rectangle of height  and length  can be constructed within the boundaries. The area formed is .

Function Description

Complete the function largestRectangle int the editor below. It should return an integer representing the largest rectangle that can be formed within the bounds of consecutive buildings.

largestRectangle has the following parameter(s):

h: an array of integers representing building heights
Input Format

The first line contains n,  the number of buildings.
The second line contains n space-separated integers, each representing the height of a building.

Output Format

Print a long integer representing the maximum area of rectangle formed.```

### Solution :

```                            ```Solution in C :

In C ++ :

#include <stack>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int N, h;
int p = 1, s;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) scanf("%d", &h[i]);
int ans = 0;
for (int i = 0; i < N + 2; ++i) {
while (h[i] < h[s[p - 1]]) {
int y = h[s[p - 1]];
p--;
ans = max(ans, (i - s[p - 1] - 1) * y);
}
s[p++] = i;
}
printf("%d\n", ans);
return 0;
}

In Java :

import java.io.*;
import java.util.*;

public class Solution {
static boolean[] valid;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[] ar = new long[n];

for(int i=0; i<n; i++)
ar[i] = sc.nextInt();

int[] left = new int[n];
int[] right = new int[n];
Arrays.fill(left, -1); Arrays.fill(right, -1);

Stack<Integer> st = new Stack<Integer>();

for(int i=0; i<n; i++){
while(st.size() > 0){
if(ar[st.peek()] < ar[i]){
left[i] = st.peek();
break;
}
else
st.pop();
}
st.push(i);
}
st.clear();
for(int i=n-1; i>=0; i--){
while(st.size() > 0){
if(ar[st.peek()] < ar[i]){
right[i] = st.peek();
break;
}
else
st.pop();
}
st.push(i);
}
// pArray(left);
// pArray(right);
long max = Integer.MIN_VALUE;
for(int i=0; i<n; i++){
long ans = 0;
if(left[i] >= 0)
ans+=ar[i]*(i - left[i] -1);
else
ans += ar[i] * i;
if(right[i] > -1)
ans+=ar[i]*(right[i] - i -1);
else
ans += ar[i] * (n - i-1);
ans += ar[i];
if(ans > max)
max = ans;
//System.out.println(ans);
}
System.out.println(max);
}

static void pArray(int[] ar){
for(int i=0; i<ar.length; i++)
System.out.print(ar[i] + " ");
System.out.println();

}
}

In  C :

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {

int i, j, k, n, h;
int ar;
int area, max=0;

scanf("%d",&n);
for(i=0;i<=n;++i)
scanf("%d",&ar[i]);

for(i=0;i<=n;++i)
{
int c = 1;
j = i-1;
k = i+1;

while(j>=0 && ar[j]>ar[i]){
j--;
c++;
}
while(k<=n && ar[k]>ar[i]){
k++;
c++;
}

area = c * ar[i];

max = (area>max)? area : max;

}

printf("%d",max);
return 0;
}

In  Python3 :

def solve(H) :
s,i,m = [],0,0
while i < len(H) :
if not s or H[i] > H[s[-1]] :
s.append(i)
i += 1
else :
t = s.pop()
a = H[t] * ((i - s[-1] -1)  if s else i)
if a > m :
m = a

while s :
t = s.pop()
a = H[t] * ((i - s[-1] -1)  if s else i)
if a > m :
m = a

return m

N = int(input())
H = list(int(_) for _ in input().split())

print(solve(H))```
```

## Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

## Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

## Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

## Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the