# Tag Archives: DFS

## Count all possible paths between two vertices

Count the total number of ways or paths that exist between two vertices in a directed graph. These paths don’t contain a cycle, the simple… Read More »

## Minimum initial vertices to traverse whole matrix with given conditions

We are given a matrix that contains different values in its each cell. Our aim is to find the minimal set of positions in the… Read More »

## Print all n digit patterns formed by mobile Keypad

Given a number n. we need to print all N digit pattern formed by mobile Keypad. Note: we can move up, down, left, right from… Read More »

## Count all 0s which are blocked by 1s in binary matrix

Given Binary matrix. Task is count all zeros which are surrounded by one (may not be immediate neighbor). Note: here we are only taking four… Read More »

## Number of groups formed in a graph of friends

Given n friends and their friendship relations, find the total number of groups that exist. And the number of ways of new groups that can… Read More »

## Maximum number of edges to be added to a tree so that it stays a Bipartite graph

A tree is always a Bipartite Graph as we can always break into two disjoint sets with alternate levels. In other words we always color… Read More »

## Make all combinations of size k

Given two numbers n and k and you have to find all possible combination of k numbers from 1…n. Examples: Input : n = 4… Read More »

## Diameter of a tree using DFS

The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two leaves in the tree. The… Read More »

## Calculate number of nodes in all subtrees | Using DFS

Given a tree in the form of adjacency list we have to calculate the number of nodes in the subtree of each node while calculating… Read More »

## Alphanumeric Abbreviations of a String

Given a string of characters of length less than 10. We need to print all the alpha-numeric abbreviation of the string. The alpha-numeric abbreviation is… Read More »

## Clone a Directed Acyclic Graph

A directed acyclic graph (DAG) is a graph which doesn’t contain a cycle and has directed edges. We are given a DAG, we need to… Read More »

## Paytm Interview Experience | Set 14 (For Senior android Developer)

Senior android Developer Coding Round: Spirally traversing a matrix Longest Increasing Subsequence First Round: find “longest line” of 1’s in array. Hoizontal and Vertical. Array… Read More »

## Minimum edge reversals to make a root

Given a directed tree with V vertices and V-1 edges, we need to choose such a root (from given nodes from where we can reach… Read More »

## Move weighting scale alternate under given constraints

Given a weighting scale and an array of different positive weights where we have an infinite supply of each weight. Our task is to put… Read More »

## Top 10 Interview Questions on Depth First Search (DFS)

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as… Read More »