SDE - Intern

There is a jar full of candies for sale at a mall counter. Jar has the capacity ‘N’. That is, jar can contain maximum ‘N’ candies when a jar is full. At any point in time jar can not have 0 or fewer candies.

Given the number ‘K’, the number of candies the customer wants. Your task is to return the candies left in the jar.

Note:

If 'K' is greater than 'N', return -1 denoting the invalid order.

For example:

Given if 'N' = 10, 'K' = 5. Then 5 candies are left in the jar after the event.

Selection in the Indian Navy includes a fitness test which is conducted in the seawater. In this test, there will be a group of 3 trainees appearing for the swimming test in the sea for three rounds. The oxygen level remaining of each trainee will be recorded after each round in 2D matrix/list ‘OXYGEN’ of size 3 x 3.

After the trainee is finished with all rounds, an Officer from the Indian Navy calculates each trainee's remaining oxygen level over the three rounds and selects one with the highest average oxygen level as the fittest trainee. If more than one trainee attains the same highest average level, they all need to be chosen.

The final result of the test will depend upon the following factors :

1. The remaining oxygen level should only be  accepted if it is in the range between [1, 100] both inclusive else the oxygen level will be marked as 0.
2. If the calculated maximum average oxygen remaining value of trainees is below 70, then declare the trainees as unfit with the meaningful message as “Unfit.”
3. The average remaining Oxygen level should be rounded.

For Example :

Output for the above case will be
Trainee1
Unfit
Trainee3

Because the maximum average is 70 which is in the range and Trainee 1 and 3 both have the same value.
Trainee 2 is unfit because the average is below 70. 

You have been given two integers ‘X’ and ‘Y’ which are the first two integers of a series and an integer ‘N’. You have to find the Nth number of the series using the Fibonacci rule given by f(x) = f(x - 1) + f(x - 2).

The answer may be very large, return it after modulus 10 ^ 9 + 7.

Note:

The series is 1-based indexed.

For a given Singly Linked List of integers, you are required to reverse alternate nodes and append them to the end of the list.

For Example:

The given linked list is 1->2->3->4 then after reversing the alternate nodes we will have 1->3->4->2. 

Assuming 0 based indexing, odd indexed nodes are the alternate nodes that is, in the given linked list the node with value 2 and the node with value 4 are the alternate nodes. 

List without alternate nodes:  1->3 
List with alternate nodes:  2->4 
Reversing the list with alternate nodes: 4->2

After appending the reversed alternate nodes at the end, the updated list will be 1->3->4->2.