Amazon Senior Software Developer Interview Questions and Answers

Data and Algo test need to do live in front of interviewers.

Test contains 26 questions for me 13 are java based 13 are c++ based

Q1. Indexing in dbms
Ans. 
Indexing in DBMS is a technique to improve the performance of queries by creating a data structure that allows for faster retrieval of data.
• Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

• Types of indexes include clustered, non-clustered, unique, and composite indexes.

• Examples of indexing techniques include B-tree, hash, and bitmap indexes.

• Indexing can...read more
Answered by AI
Add your answer
Q2. Find whether two strings are or not anagrams
Ans. 
Check if two strings are anagrams by comparing the sorted characters in each string.
• Sort the characters in both strings and compare if they are equal.

• Ignore spaces and punctuation when comparing the strings.

• Example: 'listen' and 'silent' are anagrams.

• Example: 'hello' and 'world' are not anagrams.
Answered by AI
View 1 more answer

Q1. Inorder traversal without recursion
Ans. 
Use a stack to simulate the recursive inorder traversal process
• Create an empty stack to store nodes

• Start with the root node and push it onto the stack

• While the stack is not empty, keep traversing left and pushing nodes onto the stack

• Once you reach a leaf node, pop it from the stack, print its value, and move to its right child

• Repeat the process until all nodes have been visited
Answered by AI
Add your answer
Q2. How to make a class final
Ans. 
To make a class final, use the 'final' keyword in the class declaration.
• Use the 'final' keyword before the 'class' keyword in the class declaration

• A final class cannot be subclassed or extended

• Final classes are often used for utility classes or classes that should not be modified
Answered by AI
Add your answer

Q1. What is the implementation of Merge Sort in Java?
Ans. 
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
• Divide the input array into two halves

• Recursively sort the two halves

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. What is the implementation of the Quick Sort algorithm in Java?
Ans. 
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
• Choose a pivot element from the array.

• Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.

• Recursively apply the same process to the sub-arrays.

• Combine the sorted sub-arrays to get the final sorted array.
Answered by AI
Add your answer

BFS Implementation of a jug question.

Q1. Few hashmap questions
Add your answer
Q2. Object Oriented Programming questions
Add your answer

Q1. Data structure and algorithm
Add your answer
Q2. Some tricky logical question
Add your answer
Q3. Stack and queue
Add your answer
Q4. Some basic question about system Design
Add your answer

Hackerrank Coding Test, Leetcode medium questions

HLD test, was asked to design an online coding platform like leetcode

Q1. Most interesting project you have worked on
Add your answer
Q2. How do you handle conflict at workplace
Add your answer

It was a medium-level DSA round

This was also a DSA round

This again a DSA round

Q1. Can't disclose the question because of NDA signed but it was a design round
Add your answer

Q1. This was a project discussion round
Add your answer