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
You are given two prime numbers n and m of 4 digits each, you need to convert n into m in the minimum number of steps, in each step you can change one of the digits of the number n such that a resulting number is also a prime number
Given a matrix of dimension r*c where each cell in the matrix can have values 0, 1 or 2 which has the following meaning: 0 : Empty cell 1 : Cells have fresh oranges 2 : Cells have rotten oranges
Given a sorted dictionary (array of words) of an alien language, find order of characters in the language
A group of connected 1\'s forms an island. There is a matrix of N×M. You have to find out the numbers of item
Given a graph G. you have to find out that that graph is Hamiltonian or not
There is a chessboard of size N×M and starting position (sx, sy) and destination position (dx,dy). You have to find out how many minimum numbers of moves a knight goes to that destination position?
Given a weighted directed graph, the problem is to find the shortest distances between every pair of vertices. The Graph is represented by an adjacency matrix, and any cell arr[i][j] denotes the weight of the edge (path cost) from node i to node j (if it exists) else INF
Given a weighted undirected graph. Find the sum of weights of edges of a Minimum Spanning Tree
total questions: 8

Questions

8

Views

960

Best Answers

299

Points

5