SDE - 1

Ram is a bright student in his class. He is very good at mathematics. So to test his skills, one of his friends Shyam thought of giving him a task.

In the task, Shyam would give Ram a ‘TARGET’ array of ‘N’ length. And also give him an array ‘ARR’ of length ‘N’ with all zeros. Ram has to change the array ‘ARR’ into the ‘TARGET’ array using the minimum number of operations. The two types of operation that can be performed on the array ‘ARR’ are as follows:

1) Incremental operations: Choose 1 element from the array ‘ARR’ and increment its value by one.

2) Doubling operation: Double the values of all the elements of the array ‘ARR’.

Shyam is not as smart as Ram, He needs your assistance to find the minimum number of operations required to change the array ‘ARR’ into ‘TARGET’. So that he can verify the correctness of the answer given by Ram. Can you help him to find the minimum steps?.

We are given the desired array ‘TARGET’ containing ‘N’ elements. Compute and return the smallest possible number of the operations needed to change the array from all zeros to the desired array.

Example :

Input: ‘N’ = 2, ‘TARGET’ = {2, 3}

Output: 4
In this case, To get the target array from {0, 0}, we first, increment both elements by 1 (2 operations), then double the array (1 operation). Finally, increment the second element (1 more operation).

Town planner Ninja is assigned to build new houses in the ninja town for its citizens. The town is in the form of a rectangular grid ‘TOWN[][]’ of (‘M’ * ‘N’) dimensions where 'M' is the number of rows and 'N' is the number of columns. Each cell of the grid can be an 'empty location' (that can be used for house) denoted by '.' or 'Tree' denoted by 'T'.

Ninja wants to meet the demands of the citizens without cutting any of the trees.

Following are the conditions asked by citizens for their house locations :

House should not have a house on its left cell
House should not have a house on its right cell
House should not have a house on its upper-left cell
House should not have a house on its upper-right cell

Town planner Ninja needs your help. Return the maximum number of houses that can be built while meeting the citizens' demands and not cutting any of the trees.

For Example :

Input  :
M = 3 , N = 5
Grid :
. . . T .
. T . . .
T . . T .

In the example above, the maximum number of houses that be built is 8.

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.

A cycle occurs when a node's next points back to a previous node in the list.

Example:

In the given linked list, there is a cycle, hence we return true.

Introduction.
Academic background.
Language skills.
Location preference.