Software Engineer

There is a potter who makes pottery wares. With his saving, he can purchase some pottery clay, say ‘K’ units to make pottery wares. He can transform this clay into ‘N’ different items. Each item requires a certain amount of day for production. From past experiences, he knows the profit he will make on each item. he wishes to maximize the profit.

Given the amount of clay he has, the number of things that can be made, the days required, and the profit associated with items. Help him find the maximum profit that he can earn.

Euclid, Pythagoras, Pascal and Monte plan to play in a park. Pascal, Monte and Euclid enter the park first and stand at three different arbitrary positions. As Pythagoras is the last one to reach the park, he decides to stand in such a way that the four points form a parallelogram if joined with each other. The positions of Euclid and Monte form one of the two diagonals of the parallelogram.

Your task is to help Pythagoras determine the coordinates of the point where he must stand so that a parallelogram is formed.

A parallelogram is a simple quadrilateral with two pairs of parallel sides. The opposite or facing sides of a parallelogram are of equal length and the opposite angles of a parallelogram are of equal measure

For example, consider the scenario shown below. The coordinates of Euclid, Pascal, and Monte have been shown in the figure. 

Euclid and Monte are standing at the endpoints of a diagonal and Pascal is standing at one vertex of the other diagonal. Using the coordinates of Pascal, Euclid and Monte, figure out the coordinates of Pythagoras, which will be (10, 15).

Note:

The coordinates of Pythagoras will be unique for the unique values of the other three coordinates.

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

About and why Wipro were the major questions asked to me. They also asked me about my key learnings from my internships.
Finally the interview ended with if I was comfortable with contract and relocation