Software Engineer

Alex has a computer with ‘K’ memory spaces. He has a list of ‘N’ different document downloads that he would like to do, each of which consumes some unique memory usage. He also has ‘M’ computer games, each of which consumes some unique memory usage. His computer can allow at most one download and at most one game to run simultaneously, provided that the sum of memory usages doesn’t exceed ‘K’. Alex wants to play at most one game and complete at most one download so that the total memory usage is maximum.

Given a list ‘download’ and a list ‘game’, help Alex find out the number of pairs of downloads and games such that the sum of memory usages is maximum. It can also be possible that Alex only plays a game or performs a download at a time.

You have been given an array 'ARR' of ‘N’ integers. You have to return the minimum number of jumps needed to reach the last index of the array i.e ‘N - 1’.

From index ‘i’, we can jump to an index ‘i + k’ such that 1<= ‘k’ <= ARR[i] .

'ARR[i]' represents the maximum distance you can jump from the current index.

If it is not possible to reach the last index, return -1.

Note:

Consider 0-based indexing.

Example:

Consider the array 1, 2, 3, 4, 5, 6 
We can Jump from index 0 to index 1
Then we jump from index 1 to index 2
Then finally make a jump of 3 to reach index N-1

There is also another path where
We can Jump from index 0 to index 1
Then we jump from index 1 to index 3
Then finally make a jump of 2 to reach index N-1

So multiple paths may exist but we need to return the minimum number of jumps in a path to end which here is 3.

What is virtual memory?

What is paging?

Ninja decided to travel to a city. Each house in the city is connected via roads with at most two houses and forms a binary tree-like structure such that Kth level can have at most 2 ^ K houses. Now, the problem in the city is that persons from different houses at the same level can not meet without changing their level. Ninja wants to make this city beautiful by connecting houses at the same level. As Ninja is busy preparing for his travel, he gives this task to you. Can you help Ninja to make this city beautiful?

For example Figure A represents the city before making it Beautiful. Figure B represents a Beautiful city because all the houses on the same level are connected.

Your task is to connect all the houses at the same level in the city. You are given a pointer next in the house class to do this. If there is no house on the right then set NULL to the next pointer.

Note:

1. The structure of the city is already defined. You should not change it.   

2. The address of the house at the 0’th level is already given.  

3. There is at least one house in the city.

4. You may only use constant extra space.