## Amazon Interview Experience | Set 414 (For SDET-1)

I applied through an employee referral for SDET-1 position. I was interviewed at Amazon Chennai(SP Infocity).I faced 5 face to face rounds. On October 11th,… 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

I applied through an employee referral for SDET-1 position. I was interviewed at Amazon Chennai(SP Infocity).I faced 5 face to face rounds. On October 11th,… Read More »

Given two four digit prime numbers, suppose 1033 and 8179, we need to find the shortest path from 1033 to 8179 by altering only single… Read More »

Pablo has square chocolate Box of size n x n in which a variety of healthy chocolates are present denoted by ‘H’ initially but he… Read More »

N-ary tree refers to the rooted tree in which each node having atmost k child nodes. The diameter of n-ary tree is the longest path… Read More »

You are given a m litre jug and a n litre jug . Both the jugs are initially empty. The jugs don’t have markings to… Read More »

A STL based simple implementation of BFS using queue and vector in STL. The adjacency list is represented using vectors of vector. In BFS, we… Read More »

Given a directory, print all files and folders present in directory tree rooted with given directory. We can iteratively traverse directory in BFS using below… Read More »

Suppose A is at position (0, 0) of a 2-D grid containing ‘m’ rows and ‘n’ columns. His aim is to reach the bottom right… Read More »

Given a directed graph, a source vertex ‘src’ and a destination vertex ‘dst’, print all paths from given ‘src’ to ‘dst’. Consider the following directed… Read More »

Coding Round: A variation of Knapsack Easy string manipulation problem A brute-force based string matching problem Technical Round 1: Finding the length of a Linked-List… Read More »

You are given a undirected graph G(V, E) with N vertices and M edges. We need to find the minimum number of edges between a… Read More »

Given an undirected tree with some marked nodes and a positive number K. We need to print the count of all such nodes which have… Read More »

Searching a graph is quite famous problem and have a lot of practical use. We have already discussed here how to search for a goal… Read More »

In previous post, BFS only with a particular vertex is performed i.e. it is assumed that all vertices are reachable from the starting vertex. But… Read More »

Prerequisites : BFS, DFS In BFS and DFS, when we are at a node, we can consider any of the adjacent as next node. So… Read More »