## Minimum steps to reach end of array under constraints

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 »

- Detect Cycle in a Directed Graph using BFS
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Islands in a graph using BFS
- Minimum distance to the corner of a grid from source
- Print all the levels with odd and even number of nodes in it | Set-2
- Finding the path from one vertex to rest using BFS
- Print the lexicographically smallest BFS of the graph starting from 1
- Iterative approach to check for children sum property in a Binary Tree
- Minimum number of pairs required to make two strings same
- Minimum steps required to reach the end of a matrix | Set 2
- Minimize the number of steps required to reach the end of the array | Set 2
- Difference Between BFS and DFS

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 »

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 »