## Top 10 algorithms in Interview Questions

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 »

- Islands in a graph using BFS
- Coin Change | BFS Approach
- Minimum distance to the corner of a grid from source
- Minimum steps required to reach the end of a matrix | Set 2
- Difference Between BFS and DFS
- Minimum number of pairs required to make two strings same
- Burn the binary tree starting from the target node
- Iterative approach to check for children sum property in a Binary Tree
- Minimize the number of steps required to reach the end of the array | Set 2
- Find K vertices in the graph which are connected to at least one of remaining vertices
- Count number of ways to reach destination in a Maze using BFS

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 »

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print… Read More »

Write a function that returns true if a given undirected graph is tree and false otherwise. For example, the following graph is a tree. But… Read More »

Given a snake and ladder board, find the minimum number of dice throws required to reach the destination or last cell from source or 1st… Read More »

. Given an undirected graph, how to check if there is a cycle in the graph? For example, the following graph has a cycle 1-0-2-1.… Read More »

Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if there is a path… Read More »