Amazon Transportation Services Manual Testing Interview Questions and Answers

Q1. General behavioral and situational questions about team members
Add your answer

Q1. Identify if the number is positive, negative or zero
Ans. 
Identify if a number is positive, negative, or zero
• Check if the number is greater than 0 to determine if it is positive

• Check if the number is less than 0 to determine if it is negative

• If the number is neither greater nor less than 0, it is zero
Answered by AI
Add your answer

Q1. Asked everything that was present in my resume
Add your answer
Q2. DBMS, OOps were asked a lot and react as well
Add your answer

Q1. Csharp basics and a coding questing was given to implement
Add your answer
Q2. .net and angular basics questions
Add your answer

Q1. Asked deeply about my resume and technologies
Add your answer
Q2. Coding question to sort a given array using DSA
Add your answer

Difficult online round

Q1. Arrays from neetcode
Ans. 
Arrays are a collection of strings in programming used to store multiple values under a single variable name.
• Arrays are declared using square brackets []

• Each element in an array is accessed by its index, starting from 0

• Example: var fruits = ['apple', 'banana', 'orange']
Answered by AI
Add your answer
Q2. Linked list from neetcode
Add your answer

Q1. Trees in neet code
Ans. 
Trees in neet code refer to the implementation of tree data structures in coding challenges on the platform NeetCode.
• Trees are a common data structure used in coding challenges to represent hierarchical relationships between data.

• Common tree operations include traversal (inorder, preorder, postorder), insertion, deletion, and searching.

• Examples of tree-related coding challenges on NeetCode include implementing a binary...read more
Answered by AI
Add your answer
Q2. Trees in leet code
Ans. 
Trees in leetcode are a common topic for coding interviews, involving various tree traversal and manipulation techniques.
• Understand different tree traversal methods like inorder, preorder, and postorder.

• Learn about common tree algorithms like finding the height, diameter, and lowest common ancestor.

• Practice solving tree-related problems on leetcode to improve your skills.
Answered by AI
Add your answer

Nice and difficult work from home

Q1. Array and haah was aaked
Add your answer
Q2. It was difficult
Add your answer

Normal MCQs round really easy was able to complete in 1 hour

$ questions very easy 3 coding and 1 SQL

Q1. Asked me about the logic and format of code
Add your answer
Q2. One scecnaior based question and what you will do there
Add your answer
Q3. Asked to describe the concept of override and encapsulation with code
Add your answer

90 minutes hackerrank test, 3 questions 1 easy 2 medium.

Q1. Resume based and questions based on my personal projects
Add your answer

Q1. CN,OS and DBMS questions.
Add your answer

Q1. Managerial round and hr questions
Add your answer

It was open coding contest called Ode 2 Code organised on hackerearth. Top 100 students got interview calls

Q1. This was a 1:1 online technical interview.
Add your answer
Q2. Basic question on web development, regarding projects in resume. 1 problem solving question and DSA basics
Add your answer
Q3. I was asked to explain merge sort
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.
• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer