Amazon Service Engineer Interview Questions and Answers

Group discussion

It’s very easy you can easily clear

Q1. Java dcs question
Add your answer
Q2. And real time questions
Add your answer

2 c++ coding questions will be asked based on the STL and array operations

Q1. Project manager will ask you project related knowledge.
Add your answer

Q1. Will discuss basic HR round questions and discuss salary.
Add your answer

I have been working at essae for 3 years.

Q1. I want to learn something new.
Add your answer
Q2. I would love to meet someone to learn something better and I can work.
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

Q1. 
Longest Common Subsequence Problem Statement
Given two strings STR1 and STR2, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...read more
Ans. 
The task is to find the length of the longest common subsequence between two given strings.
• Implement a function to find the longest common subsequence between two strings.

• Use dynamic programming to solve this problem efficiently.

• Iterate through the strings and build a matrix to store the lengths of common subsequences.

• Return the length of the longest common subsequence found.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper. 
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

Q1. 
Add Two Numbers as Linked Lists
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...read more
Ans. 
Add two numbers represented as linked lists and return the sum as a linked list.
• Traverse both linked lists simultaneously while keeping track of carry from previous sum

• Create a new linked list to store the sum, updating the value and carry as needed

• Handle cases where one linked list is longer than the other by adding remaining digits with carry
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

Q1. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal in a disconnected graph starting from vertex 0.
• Use a queue to keep track of nodes to visit next in BFS traversal

• Start traversal from vertex 0 and explore its neighbors first

• Continue exploring neighbors level by level until all nodes are visited

• Ensure to print connected nodes in numerical sort order
Answered by AI
Add your answer
Q2. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal to find connected components in an undirected and disconnected graph.
• Perform DFS traversal on each vertex to find connected components

• Maintain a visited array to keep track of visited vertices

• Print the vertices of each connected component in ascending order
Answered by AI
Add your answer
Q3. 
Dijkstra's Shortest Path Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...read more
Ans. 
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
• Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.

• Use a priority queue to efficiently select the next node with the shortest distance.

• Update the distances of neighboring nodes based on the current node's distance and edge weight...read more
Answered by AI
Add your answer