SDE

You have been given an N*M matrix where there are 'N' rows and 'M' columns filled with '0s' and '1s'.

'1' means you can use the cell, and '0' means the cell is blocked. You can move in the 4 following directions from a particular position (i, j):

1. Left - (i, j-1)
2. Right - (i, j+1)
3. Up - (i-1, j)
4. Down - (i+1, j)

Now, for moving in the up and down directions, it costs you $1, and moving to the left and right directions are free of cost.

You have to calculate the minimum cost to reach (X, Y) from (0, 0) where 'X' is the row number and 'Y' is the column number of the destination cell. If it is impossible to reach the destination, print -1.

Recently Ninja has been learning about a new Ninja Technique to cross a field with landmines. The field is in the form of a rectangular matrix of size M x N, having few landmines, which are placed arbitrarily. The landmine gets triggered if a person is any closer than one cell from the position where it is placed. So Ninja must avoid the landmines and any of the four adjacent cells (left, right, above and below), as they are also unsafe.

Initially Ninja is on one side of the field and has to move to the other side. You need to help Ninja apply the new Ninja Technique by providing him with the length of the shortest safe route possible from any cell in the first column to any cell in the last column of the field.

Note that Ninja is only allowed to move only in the direction left, right, above and below i.e., he cannot move diagonally to the next cell.

Note :

The length of the path is the number of steps required to reach from the first column of the field to the last column i.e., one less than the number of cells in the path.

For Example :

Consider the field of size 4*4, shown below. The cells containing landmine are marked with 0 and red colour. The cells near the landmine which are unsafe are marked with a light red colour. 

The shortest safe route for Ninja, starting from any cell in the first column to any cell in the last column of the field is marked with green colour. The length of the path is 3.

What is thread in OS?

Difference between runtime and compile time polymorphism

Different types of languages in DBMS and its uses

Given an array with N elements, the task is to reverse all the array elements and print the reversed array.

All the skills mentioned in the resume were touched
I was asked which project I would like to talk about, I gave the name of the one about which I was most confident about.
I was then asked about my past experience. DevOps, Ansible, loadbalancer were mentioned in my resume so I was asked questions on these topics.
he asked me about my fav programming language. I said I was most comfortable in java, so next few questions were about basics of java.

RISES concept of Barclays.

Why are you a good fit for this role?