SDE - Intern

Given a binary array 'ARR' of size 'N', your task is to find the longest sequence of continuous 1’s that can be formed by replacing at-most 'K' zeroes by ones. Return the length of this longest sequence of continuous 1’s.

You are given an array ‘arr’ of ‘n’ positive integers.

You are also given a positive integer ‘target’.

Your task is to find all unique combinations of elements of array ‘arr’ whose sum is equal to ‘target’. Each number in ‘arr’ may only be used once in the combination.

Elements in each combination must be in non-decreasing order and you need to print all unique combinations in lexicographical order.

Note:

In lexicographical order, combination/array  ‘a’  comes before array ‘b’ if at the first index 'i' where 'a[i]' differs from 'b[i]', 'a[i]' < 'b[i]  or length of 'a' is less than 'b'.

Example:

Input: ‘arr’ = [1, 2, 3, 1], ‘target’ = 5. 

Output: [[1,1,3], [2,3]]

Explanation:
All possible valid combinations with sum = 5 in lexicographical order are -:
(1, 1, 3)
(2, 3)

Ninja is playing with numbers but hates when he gets duplicate numbers. Ninja is provided an array, and he wants to remove all duplicate elements and return the array, but he has to maintain the order in which the elements were supplied to him.

You are given a sorted array 'arr' of distinct values and a target value 'm'. You need to search for the index of the target value in the array.

Note:

1. If the value is present in the array, return its index.
2. If the value is absent, determine the index where it would be inserted in the array while maintaining the sorted order. 
3. The given array has distinct integers.
4. The given array may be empty.

Example:

Input:  arr = [1, 2, 4, 7],  m = 6 

Output: 3

Explanation: If the given array 'arr' is: [1, 2, 4, 7] and m = 6. We insert m = 6 in the array and get 'arr' as: [1, 2, 4, 6, 7]. The position of 6 is 3 (according to 0-based indexing)

The interview was mainly based on the resume.

He asked me about my project. He asked which database I would use to log user details and why. Then, he asked me to explain the architecture of the project.

Eric has an arrangement of infinite glasses, similar to a pascal’s triangle, as shown below.

         1
      2    3
   4    5    6
7    8     9    10 … and so on 

The glasses are all empty and can contain exactly 1 Litre of water each. You can pour water only on the topmost glass (glass with number 1).

When the topmost glass 1 is full, the remaining water will fall into glasses 2 and 3.

For example, if you pour 2 Litres of water,

Glass 1 will be completely full after 1 Litre is poured,

The second litre of water will then flow to glasses 2 and 3, filling 0.5 Litres in both of these glasses.

Eric wants you to find the amount of water in ‘M’th glass in the ‘N’th row, if you are allowed to pour exactly ‘W’ Litres of water.

Find the amount of water in Litres in the ‘M’ glass in the ‘N’th row.

Example:

Input: ‘N’ = ‘2’,  'M' = ‘2’, ‘W’ = ‘2’ 

Output: 0.5

   1
 2   3

In the above example, glass ‘1’ is completely filled after 1 litre of water is poured into it. Then the remaining water is dropped into glasses 2 and 3, filling half of each of them. 
Hence, the 2nd glass in the 2nd row is Glass 3, which has 0.5L of water.