Similar Collections

We are trying to list out the most frequently asked interview problems or the problem given in the coding rounds of IT giants.

questions

Title
Given a matrix with 0\'s and 1\'s, one enters the matrix at cell (0, 0) in left to right direction. Whenever one encounters a 0 he retains in the same direction, if one encounters a 1 he has to change direction to the right of current direction and change that 1 value to 0
Given a Boolean 2D matrix (0-based index), find whether there is a path from (0,0) to (x,y) and if there is one path, print the minimum no of steps needed to reach it, else print -1 if the destination is not reachable
Given a gold mine of n*m dimensions, each cell in this mine contains a positive integer which is the amount of gold in tons
You are given a matrix of the size of N*M, you need to print all the paths from top left to the bottom right of the given matrix
Given a rectangular matrix of size N*M, we can move from the current cell in 4 directions with equal probability
You will be given a square matrix M and a positive integer power N. You will have to compute M raised to the power N
Given a N X N Matrix, Matrix[N][N] of positive integers. There are only three possible moves from a cell Matrix[r][c]
Given an mXn matrix, if an element is 0, set its entire row and column to 0. Do it in-place
Given a N*M binary matrix find the size of largest square sub-matrix of 1\'s present in it
total questions: 9

Questions

9

Views

877

Best Answers

299

Points

5