AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Amazon
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Amazon Site Engineer Interview Questions and Answers
Amazon Site Engineer Interview Experiences
1 interview found
Anonymous
I applied via LinkedIn and was interviewed before Jan 2022. There were 2 interview rounds.
Hard to learn what they wanted
(2 Questions)
- Q1. What is your greatest weakness
- Q2. How will you add value to our team
Interview Preparation Tips
Interview questions from similar companies
(3 Questions)
- Q1. What is ACID in DBs ?
- Ans.
ACID stands for Atomicity, Consistency, Isolation, and Durability in databases.
Atomicity ensures that all operations in a transaction are completed successfully or none at all.
Consistency ensures that the database remains in a consistent state before and after the transaction.
Isolation ensures that multiple transactions can be executed concurrently without affecting each other.
Durability ensures that once a transaction...
- Q2. What is the difference in checked and unchecked exceptions ?
- Ans.
Checked exceptions are checked at compile time while unchecked exceptions are not checked at compile time.
Checked exceptions are subclasses of Exception class except RuntimeException and its subclasses.
Unchecked exceptions are subclasses of RuntimeException and Error classes.
Checked exceptions must be caught or declared in the method signature using 'throws' keyword.
Unchecked exceptions do not need to be caught or decl...
- Q3. Find the min difference between any two integers of 2 sorted list
- Ans.
To find the minimum difference between any two integers of 2 sorted lists, iterate through both lists simultaneously and keep track of the minimum difference.
Iterate through both sorted lists simultaneously
Keep track of the minimum difference found so far
Update the minimum difference if a smaller difference is found
Skills evaluated in this interview
Interview Preparation Tips
Experience: The written test did NOT involve general aptitude questions. Most questions were CS specific and pertained to some kind of algorithmic analysis, design of recursive solutions, designing and tracing out an algorithm on a given sample etc. About 50-60% of the candidates were eliminated in this round.
Round: Test
Experience: The next round was a coding assignment. For those familiar with code-chef, the coding assignment was similar to a medium level problem (in the practice section) and had to be done in C. The codingassignment by design, required algorithmic optimization to execute within the prescribed time limit. About 10 candidates (8 UG and 2 PG) were selected for interviews. Yahoo generally conducts 4 technical interviews and an HR interview. Typically, 2 of the 4 tech interviews will be with immediate seniors in teams that are interested in your profile. The remaining two will be with more senior engineers (in fact, one of my interviews was with the tech director of a vertical at Yahoo). Interviewers discuss with each other after each interview, and some candidates were eliminated after one poor interview. It is therefore quite important to do
General Tips: Apart from technical skills, your communication and social skills are what can make or break an interview and eventually, decide whether or not you get the job. Objectively speaking, most candidates who make it to the final round will be very technically proficient. Therefore, your aim should be to make the decision regarding your candidature anything BUT objective. The real advantage of an interview is to let the interviewer know YOU, beyond just your written test score or your academic credentials. Interviewers like confidence in a candidate and it can even make you seem better than you really are. It will also help to have a few well thought out questions in mind for your interviewer, to show him that you have put in more effort than other candidates to find out about the kind of work going on at the company. One thing youcan do is to find out who all the interviewers are during the pre-placement talk (Yes, attending the PPT CAN BE USEFUL). General Tips Preparation Look up their LinkedIn profiles and note what projects they have worked on or guided. Asking a few insightful questions about those specific projects is a good way to create a good impression of you. It is very difficult to truly judge a candidate during a 45 minute interview, so what matters a lot is the impression left in the interviewers mind about you. If possible, try to establish a social connect during your limited interaction with the interviewers, BEFORE the interviews take place. For example, one of my interviewers, a senior tech manager at Yahoo, was an NITK alumnus. Before the interviews, I spoke to him about his experience in college. As it turns out, he was one of the founders of the web club at NITK, of which I am a member. We spoke for about 15 minutes about how the club has grown and how the club has helped its members ever since.
Skill Tips: For a computer science student who intends to take up a technical job at a tier 1 company, spend as much time as possible, honing your technical skills. Start well before placement season, if possible, in 3rd year itself
College Name: NIT SURATHKAL
Interview Questionnaire
8 Questions
- Q1. Given two “ids” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of mutual friends
- Ans.
Function to return mutual friends given two ids and getFriends(id) function
Call getFriends(id) for both ids to get their respective friend lists
Iterate through both lists and compare to find mutual friends
Return the list of mutual friends
- Q2. Given an “id” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of “friends of friends” in the order of decreasing number of mutual friends,...
- Ans.
Function to return list of friends of friends in decreasing order of mutual friends
Use a set to store all friends of friends
Iterate through the list of friends of the given id
For each friend, iterate through their list of friends and count mutual friends
Sort the set of friends of friends by decreasing number of mutual friends
- Q3. Given a number of time slots – start time and end time,“a b”, find any specific time with the maximum number of overlapping. After solving the problem I had to prove my solution
- Ans.
Given time slots, find a specific time with maximum overlap. Prove solution.
Create a list of all start and end times
Sort the list in ascending order
Iterate through the list and keep track of the number of overlaps at each time
Return the time with the maximum number of overlaps
Prove solution by testing with different input sizes and edge cases
- Q4. Given an array of Integers, find the Longest sub-array whose elements are in Increasing Order
- Ans.
Find the longest sub-array with increasing order of integers.
Iterate through the array and keep track of the current sub-array's start and end indices.
Update the start index whenever the current element is smaller than the previous element.
Update the end index whenever the current element is greater than or equal to the next element.
Calculate the length of the sub-array and compare it with the longest sub-array found s
- Q5. Given an array of Integers, find the length of Longest Increasing Subsequence and print the sequence.
- Ans.
Find the length of longest increasing subsequence and print the sequence from an array of integers.
Use dynamic programming to solve the problem
Create an array to store the length of longest increasing subsequence ending at each index
Traverse the array and update the length of longest increasing subsequence for each index
Print the sequence by backtracking from the index with the maximum length
Time complexity: O(n^2)
Exam...
- Q6. Given a Sorted Array which has been rotated, write the code to find a given Integer
- Ans.
Code to find a given integer in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle edge cases such as the target integer not being present in the array.
- Q7. You have a number of incoming Integers, all of which cannot be stored into memory. We need to print largest K numbers at the end of input
- Ans.
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the heap size exceeds K, remove the smallest element.
At the end, the heap will contain the largest K numbers in the input.
- Q8. Implement LRU Cache
- Ans.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a doubly linked list to keep track of the order of items in the cache
Use a hash map to store the key-value pairs for fast access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and the hash map
Interview Preparation Tips
Experience: Facebook visited our campus in July, 2012. We had an online coding round hosted on InterviewStreet. We were asked to solve just one problem. The given problem boils down to : Given a undirected graph, source and destination, write the code to find the total number of distinct nodes visited, considering all possible paths.
Tips: Those shortlisted had to fly to Delhi for a Personal Interview. There were four rounds of interview, each of 45 minutes. The questions were simple. But just solving the given problem wasn't enough.
There was much more interaction and short questions asked related to the problem
Round: Technical Interview
Experience: The above mentioned questions wer asked in the interview. For every solution I was asked to write the code on paper. The code should also include the implementation of the data structures used (I used heaps - so I was asked to implement heaps ). They are looking for someone with good problem solving skills and conceptually sound in data structures
College Name: BIT MESRA
Skills evaluated in this interview
Interview Preparation Tips
Experience: You need to submit your CV and they shortlist you on this basis.Fast and accurate coding.
Tips: Clearly specify any technical achievement.
Round: Coding
Experience: You are given 4 hours to solve a few algorithmic questions.Start practicing for this from sometime earlier.
Tips: There are puzzles available on the Facebook page.
Round: Technical Interview
Experience: Three interviews. All almost exclusively technical with 1-2 HR questions.
The questions are mainly algorithmic in nature and you need to code online while talking to them.
Tips: Be as accurate and clean with your code as possible.
General Tips: Be creative while answering the questions. They might ask you questions like 'What changes would you want to make to Facebook?'.
Prepare algorithmic questions for the interviews. Most companies like Facebook, Google, Microsoft and others focus on this.
Technical projects or internships will be beneficial.
Qualifying for or winning programming contests like overnite is very beneficial. Involvement in Social/Cultural activities or sports is not really essential.
Skill Tips: Being good at writing fast and correct code in any language helps a lot.
Skills: Programming
College Name: IIT KHARAGPUR
Interview Preparation Tips
Experience: In the coding round there were 3 questions to be solved in about 3 hrs.
Round: HR Interview
Experience: Expect the usual crazy questions like "Why LinkedIn?" and if you are already placed, be ready to give a proper justification for "Why LinkedIn and not XYZ?" so on. Be cool, you need not be accurate. Be well prepared with your resume and expect questions from them.
Tips: For the interview, just be confident and have a good resume ready with you.
Round: Other Interview
Experience: Coding Interview:
Simple coding questions. Make sure you first explain the logic to them and then you may be asked to write the code for it on the board using any language of your choice. Syntax is not a big deal, but don't make any logical errors. They are very friendly and may suggest certain solutions of their own. Make sure you can grasp them quickly. Find faults in your own code before they find it. Always try to give the best optimal solution. In case you are unable to do so then suggest possible improvements.
Round: Other Interview
Experience: Design Interview:
Some people may find this round a bit uneasy. But this round tests how good you are at designing solutions to problems. Most of the candidates were asked to build an online gaming system. And then they keep adding extra constraints and ideas and see if you can integrate them to your design. Database knowledge may be tested. They may also ask questions pertaining to you projects listed in your resume.
General Tips: An updated LinkedIn account with decent connections. ;)
Skill Tips: Be very strong with your coding ability. Whenever you code, do follow some standard procedures and make the code look simple and structured. Whenever you solve a coding question make sure you answer it completely for all the test cases. Partial results will only indicate that there is something wrong with the logic. Try to solve a complete question rather than multiple questions with partial results.
College Name: NIT SURATHKAL
Interview Preparation Tips
Experience: Three questions of increasing difficulty level. The first one was on string manipulation, the second was based on the iterative version of the merge sort algorithm and the last one on dynamic programming.
Total Questions: 3
Round: Other Interview
Experience: Eight students were selected for this stage which consisted of three separate interviews. The first one was on algorithms and programming, the second on system design and the third was HR. In the algorithms and programming interview I was asked two questions. The interviewer asked me to first explain the proposed algorithm and then I was expected to write the code on a white board they had provided. Three weeks after the interviews the selected candidates were informed through the concerned placement coordinator.
General Tips: Don't panic, the interviewers don't expect you to come up with the optimum result directly and they will give you enough time to refine your solution.
Skill Tips: No special preparation is required. Just make sure that you have understood the fundamentals
of Data Structures and Algorithms well.
College Name: NIT SURATHKAL
Interview Preparation Tips
College Name: NIT SURATHKAL
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a 1 hour online coding round on hackerrank platform. 3 DSA questions were given.
- Q1.
Stock Trading Maximum Profit Problem
Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can onl...
- Ans.
The goal is to determine the maximum profit that can be achieved by buying and selling stocks on different days.
Iterate through the stock prices and buy on days when the price is lower than the next day, and sell on days when the price is higher than the next day.
Calculate the profit by summing up the differences between buying and selling prices.
Repeat the process for each test case and output the maximum profit possi
- Q2.
Ninja's Complement Problem Statement
Every day, Ninja dreams of a number but does not understand its significance. Upon investigation, Ninja discovers that converting this number to binary, taking its com...
- Ans.
Convert a number to binary, take its complement, and convert back to decimal.
Convert the given number to binary representation
Take the complement of the binary number by swapping '1's and '0's
Convert the complement back to decimal representation
Return the complement number for each test case
- Q3.
Bit Majority Number Generation
You are given an array
arrconsisting ofNintegers. Construct a number from these integers such that, for each bit position, if the quantity of set bits (1s) is greater tha... - Ans.
Generate a number based on majority set bits in given integers array.
Iterate through each bit position and count set and unset bits
Construct the resulting number based on majority set bits at each position
Return the final constructed number
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
In this round, a DSA question was first asked. Then a lot of discussion regarding the various test cases around this question took place. (e.g, handing of -ve numbers , decimals , overflow etc).
Main concentration was just to get as many as test cases possible and an efficient solution as well.
And Some common question like why you coding in C++?
- Q1.
Sum of Digits Problem Statement
Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...
- Ans.
Given an integer, sum its digits until a single-digit number is obtained.
Iteratively sum the digits of the integer until a single-digit number is reached
Output the final single-digit integer for each test case
Handle multiple test cases efficiently
- Q2. What are the advantages of Object-Oriented Programming (OOP)?
- Ans.
OOP allows for code reusability, modularity, and easier maintenance.
Encapsulation: Bundling data and methods together to protect data from outside interference.
Inheritance: Allows for the creation of new classes based on existing classes, promoting code reuse.
Polymorphism: Objects can be treated as instances of their parent class, allowing for flexibility and extensibility.
Modularity: Breaking down a program into small...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
Again one coding question to be done on shared screen
- Q1.
Counting Triangles in Graphs
Given two graphs – a directed graph
DIR_GRAPHand an undirected graphUNDIR_GRAPH– you are tasked with counting the number of triangles in each of the graphs.Example:
In t...
- Ans.
Count the number of triangles in a directed and undirected graph.
Parse the input to extract vertices, edges, and edges between vertices.
Implement a function to count triangles in both directed and undirected graphs.
Return the counts of triangles for each test case.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Mar 2021.
(5 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA, UNIX commands , Web Security etc.
- Q1.
Find The Repeating And Missing Number Problem Statement
You are provided with an array
numswhich contains the first N positive integers. In this array, one integer appears twice, and one integer is missi... - Ans.
Identify the repeating and missing number in an array of first N positive integers.
Iterate through the array and keep track of the sum of elements and sum of squares to find the missing and repeating numbers.
Use a set to identify the repeating number and calculate the missing number using the sum formula.
Handle multiple test cases by looping through each case and applying the same logic.
Example: For nums = [1, 2, 3, 4,...
- Q2. What is the difference between the 'ps' and 'top' commands?
- Ans.
ps displays a snapshot of current processes, while top provides real-time information and allows for interactive management.
ps displays a static list of processes, while top continuously updates the list
top allows for interactive management of processes (e.g. killing, renicing), while ps does not
ps is useful for a quick snapshot of processes, while top is useful for monitoring real-time system activity
- Q3. What is cross-site scripting (XSS)?
- Ans.
Cross-site scripting (XSS) is a type of security vulnerability that allows attackers to inject malicious scripts into web pages viewed by other users.
XSS occurs when a web application allows users to input unvalidated data that is then displayed on the page without proper encoding.
There are three main types of XSS: stored XSS, reflected XSS, and DOM-based XSS.
An example of XSS is when a user inputs a script into a sear...
- Q4. How can you prevent SQL injection?
- Ans.
Prevent SQL injection by using parameterized queries, input validation, and escaping user input.
Use parameterized queries to separate SQL code from user input.
Validate and sanitize user input to prevent malicious code injection.
Escape special characters in user input before executing SQL queries.
- Q5. What is the command to kill all running Java processes?
- Ans.
The command to kill all running Java processes is 'pkill -f java'
Use the 'pkill' command followed by the '-f' flag and 'java' keyword to kill all Java processes
Be cautious when using this command as it will terminate all running Java processes
Make sure to have the necessary permissions to kill processes on the system
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Questions based on designing. My first project as it was related to Image processing, so he also asked questions related to it.
- Q1. Design a complete system for a traffic enforcement camera.
- Ans.
Design a system for a traffic enforcement camera.
1. Install cameras at strategic locations to monitor traffic violations.
2. Use image recognition software to detect violations such as speeding or running red lights.
3. Store captured images and violation data in a secure database.
4. Generate automated tickets and send them to violators.
5. Implement a user interface for law enforcement to review violations and approve ti
- Q2. How does JSON (JavaScript Object Notation) work?
- Ans.
JSON is a lightweight data interchange format that is easy for humans to read and write and easy for machines to parse and generate.
JSON is based on key-value pairs, where keys are always strings enclosed in double quotes.
Data is organized in a hierarchical structure using objects and arrays.
Example: {"name": "John", "age": 30}
Example: [{"name": "Alice", "age": 25}, {"name": "Bob", "age": 35}]
- Q3. What software testing frameworks are you familiar with?
- Ans.
I am familiar with testing frameworks such as JUnit, Selenium, and TestNG.
JUnit
Selenium
TestNG
- Q4. What is the best protocol for storing images?
- Ans.
The best protocol for storing images is JPEG (Joint Photographic Experts Group).
JPEG is a widely used format for storing images due to its high compression ratio and good image quality.
It supports millions of colors and is compatible with most devices and software.
Other options include PNG (Portable Network Graphics) for lossless compression and GIF (Graphics Interchange Format) for animations.
Round duration - 30 minutes
Round difficulty - Easy
This was a typical HR round with questions related to my final year project and some behavioral problems.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Amazon Interview FAQs
Tell us how to improve this page.
Amazon Interviews By Designations
- Amazon Software Developer Interview Questions
- Amazon Customer Service Associate Interview Questions
- Amazon Customer Service Executive Interview Questions
- Amazon Transaction Risk Investigator Interview Questions
- Amazon Software Developer Intern Interview Questions
- Amazon Associate Interview Questions
- Amazon Seller Support Associate Interview Questions
- Amazon Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Civil Site Engineer Interview Questions
- Electrical Site Engineer Interview Questions
- Senior Site Engineer Interview Questions
- Site Supervisor Interview Questions
- Site Engineer Mechanical Interview Questions
- Senior Civil Site Engineer Interview Questions
- Site Incharge Interview Questions
- Site Execution Engineer Interview Questions
- Show more
Amazon Site Engineer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
|
Customer Service Associate
4.2k
salaries
|  ₹0.6 L/yr - ₹6.8 L/yr |
|
Transaction Risk Investigator
3.1k
salaries
| ₹2.4 L/yr - ₹6.3 L/yr |
|
Associate
2.9k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
|
Senior Associate
2.2k
salaries
| ₹2 L/yr - ₹10.1 L/yr |
|
Software Development Engineer
2.1k
salaries
| ₹19.1 L/yr - ₹34.3 L/yr |
Flipkart
TCS
Netflix
- Home >
- Interviews >
- Amazon Interview Questions >
- Amazon Site Engineer Interview Questions
