SDE - Intern

You have given a m*n matrix filled with "1" and "0"."1" means you can use the cell and "0" means the cell is blocked. You can move in 4 directions left, right, top, bottom. Every time you move upward direction or downward it costs you 1$. Moving left or right will not be added to cost. So you have to write a code to check whether one can reach to destination index (x,y) starting from (0,0). If yes then print the minimum cost, if no then print "-1".

You are given a bag of size 'W' kg and provided with the costs of packets with different weights of oranges as a list/array with the name 'cost'. Every i-th position in the cost denotes the price of 'i+1' kg packet of oranges.

If at any point in time the i-th cost is -1, it means that 'i+1' kg packet of orange is unavailable.

You are required to find the minimum total cost to buy exactly 'W' kg oranges and if it's not possible to buy precisely W kg oranges then print -1. There is an infinite supply of all available packet types.

Given a snake and ladder board, find the minimum number of dice throws required to reach the destination or last cell from source or 1st cell. Basically, the player has total control over the outcome of dice throw and wants to find out the minimum number of throws required to reach the last cell.

If the player reaches a cell which is base of a ladder, the player has to climb up that ladder and if reaches a cell which is the mouth of the snake, has to go down to the tail of snake without a dice throw.