SDE - 1

You are given ‘n’ items with certain ‘profit’ and ‘weight’ and a knapsack with weight capacity ‘w’.

You need to fill the knapsack with the items in such a way that you get the maximum profit. You are allowed to take one item multiple times.

Example:

Input: 
'n' = 3, 'w' = 10, 
'profit' = [5, 11, 13]
'weight' = [2, 4, 6]

Output: 27

Explanation:
We can fill the knapsack as:

1 item of weight 6 and 1 item of weight 4.
1 item of weight 6 and 2 items of weight 2.
2 items of weight 4 and 1 item of weight 2.
5 items of weight 2.

The maximum profit will be from case 3 = 11 + 11 + 5 = 27. Therefore maximum profit = 27.

You are given an array ‘ARR’ having ‘N’ integers. You are also given an integer ‘K’. The task is to count the number of subarrays that have ‘K’ distinct values.

Subarray: A consecutive sequence of one or more values taken from an array.

For Example :

‘N’ = 4, ‘K’ = 2
‘ARR’ = [1, 1, 2, 3]

There are ‘3’ subarrays with ‘2’ distinct elements, which are as follows: [1, 2], [2, 3], [1, 1, 2].
Thus, you should return ‘3’ as the answer.

Design Splitwise

An expense sharing application is where you can add your expenses and split it among different people. The app keeps balances between people as in who owes how much to whom. Example You live with 3 other friends. You: User1 (id: u1)Flatmates: User2 (u2), User3 (u3), User4 (u4)---This month's electricity bill was Rs. 1000.Now you can just go to the app and add that you paid 1000,select all the 4 people and then select split equally .Input: u1 1000 4 u1 u2 u3 u4 EQUAL For this transaction, everyone owes 250 to User1.The app should update the balances in each of the profiles accordingly. User2 owes User1: 250 (0+250)User3 owes User1: 250 (0+250)User4 owes User1: 250 (0+250)

The Ultimate Ninja Ankush is a straightforward, no-nonsense guy and loves binary Trees, and he has given you a binary tree, and you have to return the vertical order traversal of the values of the nodes of the given tree.

For each node at position (‘X’, ‘Y’), (‘X’-1, ‘Y’-1) will be its left child position while (‘X’+1, ‘Y’-1) will be the right child position.

Running a vertical line from X = -infinity to X = +infinity, now whenever this vertical line touches some nodes, we need to add those values of the nodes in order starting from top to bottom with the decreasing ‘Y’ coordinates.

Print the vertical order of the tree, to make the Ultimate Ninja Happy.

Note:

If two nodes have the same position, then the value of the node that is added first will be the value that is on the left side.

For example:

For the binary tree in the image below.

The vertical order traversal will be {2, 7, 5, 2, 6, 5, 11, 4, 9}.

Ninja is observing an array of ‘N’ numbers and wants to make as many unique subsets as possible. Can you help the Ninja to find all the unique subsets?

Note: Two subsets are called same if they have same set of elements.For example {3,4,1} and {1,4,3} are not unique subsets.

You are given an array ‘ARR’ having N elements. Your task is to print all unique subsets.

For Example

For the given if ARR = [1,1,3],the answer will be [ ],[1],[1,1],[1,3],[3],[1,1,3].

He asked me few behavioural questions and had a good discussions about my projects, dbms, OS and oops concept.