## Iterative Deepening Search(IDS) or Iterative Deepening Depth First Search(IDDFS)

There are two common ways to traverse a graph, BFS and DFS. Considering a Tree (or Graph) of huge height and width, both BFS and… 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

There are two common ways to traverse a graph, BFS and DFS. Considering a Tree (or Graph) of huge height and width, both BFS and… Read More »

Given a MxN matrix where each element can either be 0 or 1. We need to find the shortest path between a given source cell… Read More »

Given a directed graph where every edge has weight as either 1 or 2, find the shortest path from a given source vertex ‘s’ to… Read More »

What are BFS and DFS for Binary Tree? A Tree is typically traversed in two ways: Breadth First Traversal (Or Level Order Traversal) Depth First… Read More »

In this post “Important top 10 algorithms and data structures for competitive coding “. Topics : Graph algorithms Dynamic programming Searching and Sorting: Number theory… Read More »

In this post “Top 10 coding problems of important topics with their solutions ” are written. If you are preparing for a coding interview, going through… Read More »

A number is called as a Jumping Number if all adjacent digits in it differ by 1. The difference between ‘9’ and ‘0’ is not… Read More »

Recently walmart labs came to our campus for campus recruitment. Here is my interview experience: Round 1 (MCQ + Coding Questions) This round was conducted… Read More »

Recently makemytrip visited our Campus and I got selected in recruitment drive.The placement drive consisted of 4 rounds. Round1: MCQ and coding round It was… Read More »

Given a dictionary, and two words ‘start’ and ‘target’ (both of same length). Find length of the smallest chain from ‘start’ to ‘target’ if it… Read More »

Given a list of contacts containing username, email and phone number in any order. Identify the same contacts (i.e., same person having many different contacts)… Read More »

Given a matrix of dimension m*n where each cell in the matrix can have values 0, 1 or 2 which has the following meaning: 0:… Read More »

Given a number line from -infinity to +infinity. You start at 0 and can go either to the left or to the right. The condition… Read More »

Given an undirected graph, print all connected components line by line. For example consider the following graph. We strongly recommend to minimize your browser and… Read More »

We have earlier discussed Breadth First Traversal Algorithm for Graphs. We have also discussed Applications of Depth First Traversal. In this article, applications of Breadth… Read More »