SDE - 2

So there was employee table and department table and you have to output max earning person from each department.

You are given an array 'ARR' consisting of 'N' positive integers, and you need to reduce the size of the array to 1 by performing an operation several number of times. In a single operation, you can merge any two adjacent elements of the array, and the cost of merging will be equal to the sum of those two elements. Find the minimum cost of reducing the given array by performing this operation several number of times.

In a single merge operation, the two elements are removed, and their sum is inserted at its place, hence decreasing the size of the array by 1 after each operation. For eg: Consider the array A1, A2, Ai-2, Ai-1, Ai, Aj, Aj+1, Aj+2 ,,,, An. Let the operation be performed on two indices i and j, So after merging the array will look like A1, A2, Ai-2, Ai-1, Ai+Aj, Aj+1, Aj+2,,,, An.

Note:

Note that the given operation will be performed only 'N'-1 times, where 'N' is the size of the given array.

Asked about the system architecture i was working on. And then went deeper to ask other related stuffs. And also there were some situational questions like what would you do if you get into such situations

You have to create a landing page, where you will provide linkages. On click of linkages button, the respective page should open below. Give different approaches.

So we can do it using frames
If it is React based app, we can render resp containers below based on linkage button click