SDE - Intern

You have been given an array 'ARR' of 'N' distinct elements.

Your task is to find the minimum no. of swaps required to sort the array.

For example:

For the given input array [4, 3, 2, 1], the minimum no. of swaps required to sort the array is 2, i.e. swap index 0 with 3 and 1 with 2 to form the sorted array [1, 2, 3, 4].

You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of the subsequence with the constraint that no two elements are adjacent in the given array/list.

Note:

A subsequence of an array/list is obtained by deleting some number of elements (can be zero) from the array/list, leaving the remaining elements in their original order.

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values

Print the left view of the binary tree.

Example :

If the input tree is as depicted in the picture: 

The Left View of the tree will be:  2 35 2 

You have 9 balls, equally big, equally heavy - except for one, which is a little heavier.

How would you identify the heavier ball if you could use a pair of balance scales only twice?

How will you measure 4 litre of water from a 3 litre and 5 litre jug? There are no measurement lines on the jug. You can use any amount of water but only those 2 jugs.

Tell me something about our company.

How much salary do you expect?

Where do you see yourself five years from now?

On a scale of one to ten, rate me as an interviewer.