SDE - Intern

You are given 'n' roses and you are also given an array 'arr' where 'arr[i]' denotes that the 'i^th' rose will bloom on the 'arr[i]^th' day.

You can only pick already bloomed roses that are adjacent to make a bouquet. You are also told that you require exactly 'k' adjacent bloomed roses to make a single bouquet.

Find the minimum number of days required to make at least 'm' bouquets each containing 'k' roses. Return -1 if it is not possible.

Example :

Input: n = 9,  arr = [ 1, 2, 1, 2, 7, 2, 2, 3, 1 ], k = 3, m = 2

Output: 3. 

Explanation: This is because on the 3rd day: all the roses with 'arr[i]' less than equal to 3 have already bloomed, this means every rose except the 5th rose has bloomed. Now we can form the first bouquet from the first three roses and the second bouquet from the last three roses.

You have 'N' sticks of different lengths. You want sticks to be of equal length. You can cut any stick any number of times. Your task is to find the maximum length of the stick you can get.

Note:

The cuts in all the sticks will be of the same length.

For Example:

You have 4 sticks of sizes 4, 12, 20, 48. Now you want to cut sticks of equal length from each stick. Then you have the following options:

Make all the sticks of unit length.

Make all sticks of 2 unit length, 4(2*2), 12(2*6), 20(2*10), 48(2*24)

Make all the sticks of 4 unit length, 4(4*1), 12(4*3), 20(4*5), 48(4*12)

Hence, the maximum possible length of the stick is 4.

You are given three rods (numbered 1 to 3), and ‘N’ disks initially placed on the first rod, one on top of each other in increasing order of size ( the largest disk is at the bottom). You are supposed to move the ‘N’ disks to another rod(either rod 2 or rod 3) using the following rules and in less than 2 ^ (N) moves.

1. You can only move one disk in one move. 
2. You can not place a larger disk on top of a smaller disk.
3. You can only move the disk at the top of any rod.    

Note :

You may assume that initially, the size of the ‘i’th disk from the top of the stack is equal to ‘i’, i.e. the disk at the bottom has size ‘N’, the disk above that has size ‘N - 1’, and so on. The disk at the top has size 1.

Example :

First, I was asked about my projects. It’s helpful to have your web development project deployed online. Then, I was asked about my plans for further studies after graduation, followed by questions about the courses I enjoyed the most.