Software Developer

Given a matrix where every element is either 1 or 0(zero), replace 0 with 1 if surrounded by 1. A 0 (or a set of 0s) is considered to be surrounded by 1 if there are 1 at locations just below, just above, just left and just right of it.

See the sample input.

You are given a string ‘S’. You are also given ‘M’ integers in an array ‘A’. You perform ‘M’ operations on this string. The operations are given in an array ‘A’ of size ‘M’.

You perform the operations in the order they appear in the array ‘A’. In the ‘i’th operation, you reverse the substring of ‘S’ from the position ‘A[i]’ to ‘len(S)’ - ‘A[i]’ - 1 (0 based).

Your task is to find the string after performing all the operations.

Example :

‘S’ = “aabcd”, ‘M’ = 2, ‘A’ = [0, 1]
After 1st operation i.e, reversing from [0, 4], ‘S’ = “dcbaa”.
After 2nd operation i.e, reversing from [1, 3], ‘S’ = “dabca”.
Hence, the answer is “dabca”.

You have 1000 people in room. 1st person has a gun he kills the 2nd person and passes the gun to 3rd person. This continues till the last person is left. Who will be the last person?
Write an algorithm for this and what data structures you will use and why.

Find the missing term within some time limit.
157.5 45 1 15 6 ? 3 2 2

You have 3000 bananas and need to cover 1000kms. Camel eat 1 banana for every 1 km travel. You have to transfer maximum number of Bananas across those 1000kms. How many bananas will be transferred maximum.