## Find the minimum number of moves needed to move from one cell of matrix to another

Given a N X N matrix (M) filled with 1 , 0 , 2 , 3 . Find the minimum numbers of moves needed to… Read More »

- Detect Cycle in a Directed Graph using BFS
- Nutanix Interview Experience (On-Campus 2018)
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Minimum number of given operations required to make two strings equal
- Find the ordering of tasks from given dependencies
- Edge Coloring of a Graph
- Find whether it is possible to finish all tasks or not from given dependencies
- Finding the path from one vertex to rest using BFS
- Print all the levels with odd and even number of nodes in it | Set-2
- Minimum distance to the corner of a grid from source
- Print the lexicographically smallest BFS of the graph starting from 1

Given a N X N matrix (M) filled with 1 , 0 , 2 , 3 . Find the minimum numbers of moves needed to… Read More »

Problem Statement : Given a graph which represents a flow network where every edge has a capacity. Also given two vertices source ‘s’ and sink… Read More »

Given N X N matrix filled with 1 , 0 , 2 , 3 . Find whether there is a path possible from source to… Read More »

Given a limit N, we need to find out the count of binary digit numbers which are smaller than N. Binary digit numbers are those… Read More »

Given a binary matrix of N x M, containing at least a value 1. The task is to find the distance of nearest 1 in… Read More »

Given a square chessboard of N x N size, the position of Knight and position of a target is given. We need to find out… Read More »

Given a dictionary, a method to do lookup in dictionary and a M x N board where every cell has one character. Find all possible… Read More »

Given a initial number x and two operations which are given below: Multiply number by 2. Subtract 1 from the number. The task is to… Read More »

Given a binary matrix of order m*n, the task is to find the distance of nearest 1 for each 0 in the matrix and print… Read More »

Given an array containing one digit numbers only, assuming we are standing at first index, we need to reach to end of array using minimum… Read More »

A decimal number is called binary digit number if its digits are binary. For example, 102 is not a binary digit number and 101 is.… Read More »

Given an undirected graph and a set of vertices, find all reachable nodes from every vertex present in the given set. Consider below undirected graph… Read More »

Given two integers ‘n’ and ‘m’, find all the stepping numbers in range [n, m]. A number is called stepping number if all adjacent digits… Read More »

Direct I came for Full Time recruitment for Applications Engineer, Operations Engineer and Platform Engineer in our campus. Round 1 Online test on Codechef contains… Read More »

Cloning of a LinkedList and a Binary Tree with random pointers has already been discussed. The idea behind cloning a graph is pretty much similar.… Read More »