Amazon Software Development Engineer 3 Interview Questions and Answers

Was asked two in DSA round , one from Binary serach and other was on simple dfs question. I have given optimised solution for both the question but even after that i was not selecetd.

Link List operations and result

Q1. Design Datadog, a new relic
Add your answer

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. Minimum Knight Moves (LC Medium)
Add your answer
Q2. OS, CN, DB concepts like multithreading, semaphore, tcp vs udp, transaction and ACId properties. Java concepts like stack vs heap(memory), error vs exception. Any 1 Project discussion for 10 mins
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

Java coding questions

Q1. Explain Java oops concepts?
Ans. 
Java oops concepts include inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance allows a class to inherit properties and behavior from another class.

• Encapsulation hides the internal state of an object and restricts access to it.

• Polymorphism allows objects to be treated as instances of their parent class.

• Abstraction hides the implementation details and only shows the necessary features.
Answered by AI
Add your answer
Q2. What is collections?
Ans. 
Collections in programming refer to data structures that allow you to store and manipulate groups of objects.
• Collections provide a way to organize and manage data efficiently

• Examples include lists, sets, maps, queues, and stacks

• Collections can be used to perform operations like adding, removing, and searching for elements
Answered by AI
Add your answer
Q3. Write a code to reverse number?
Ans. 
Code to reverse a number in JavaScript
• Convert the number to a string to easily manipulate each digit

• Use array methods like split, reverse, and join to reverse the number

• Convert the reversed string back to a number before returning
Answered by AI
Add your answer

Q1. Introduction about yourself?
Ans. 
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
• Graduated with a degree in Computer Science

• Proficient in programming languages like Java, Python, and C++

• Completed internships at tech companies like Google and Microsoft

• Enthusiastic about learning new technologies and working in a team environment
Answered by AI
Add your answer
Q2. Do you know about the company?
Ans. 
The company is a leading software development firm specializing in creating innovative solutions for various industries.
• Company focuses on creating innovative software solutions

• Has a strong presence in various industries

• Known for their expertise in software development
Answered by AI
Add your answer