Junior Engineer Associate

You have been given an array/list 'HEIGHTS' of length ‘N. 'HEIGHTS' represents the histogram and each element of 'HEIGHTS' represents the height of the histogram bar. Consider that the width of each histogram is 1.

You are supposed to return the area of the largest rectangle possible in the given histogram.

For example :

In the below histogram where array/list elements are {2, 1, 5, 6, 2, 3}.

The area of largest rectangle possible in the given histogram is 10.

A permutation is a mathematical technique that determines the number of possible arrangements in a set when the order of the arrangements matters. A string of length 'N' has 'N'! permutations.

Given an array of distinct integers, return all the possible permutations of the array.

Example:

'ARR[]' = [1, 2]

The size of the array is 2. So, the total number of permutations is 2! = 2. The possible permutations are [1, 2] (the array itself) and [2,1] where the position of element 1 in the original array is swapped with element 2 and vice-versa.   

Note:

1. All the numbers in the array are unique.

2. You can return the answer in any order.

3. The original array is also a permutation of the given array.

We already had C language then what was the need to create C++?
What are the basic concepts/pillars of object-oriented programming?
Give real-life examples of Inheritance, polymorphism and abstraction.

Is Multiple inheritance possible in java?
How is it implemented in java?
Explain the concept of exception handling done in java.

What all projects you did at your internship?
What is the problem your project addressed and how you approached and solved that problem?
What technologies did you work on?
What is the key role of the technologies you used?

What is the difference between truncate, drop and delete?
Difference between UNIQUE and Primary Key. Which of these can be Null?

What all sorting algorithms you know?
What are their complexities?
Where does quick sort fail?

Tell me about yourself