Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Amazon Team. If you also belong to the team, you can get access from here

Amazon Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Amazon Sde1 Interview Questions, Process, and Tips

Updated 31 Dec 2024

Top Amazon Sde1 Interview Questions and Answers

  • Q1. pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent process id let us say the process that we killed is 2 now we have to print 2,0,1 as 0,1 are child of 2 and supp ...read more
  • Q2. N queen problem with problem statement and dry running of code with 4 queens and then writing the code
  • Q3. Sub set problem(Check if there exists any sub array with given sum in the array ) . But the thing here is that we have to do it with space complexity of only O( 1 K ) . K ...read more
View all 38 questions

Amazon Sde1 Interview Experiences

30 interviews found

Sde1 Interview Questions & Answers

user image Anonymous

posted on 21 Feb 2022

I applied via Company Website and was interviewed in Jan 2022. There were 2 interview rounds.

Round 1 - Coding Test 

Asked 2 questions
1. Find the strings with maximum pattern match in given array of strings
2. Find the shortest distance between two target elements in given array

Round 2 - Technical 

(1 Question)

  • Q1. 1. Find the contiguous sub array with max sum 2. Find the median of an array sorting is involved

Interview Preparation Tips

Topics to prepare for Amazon Sde1 interview:
  • Data St
  • Algorithms
Interview preparation tips for other job seekers - Completly asked questions related to DSA and practice medium and high level problems in geeksforgeeks and leetcode

Skills evaluated in this interview

Sde1 Interview Questions & Answers

user image Anonymous

posted on 9 Mar 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.

Round 1 - Coding Test 

DSA round - algorithm to insert in sorted and non overlapping intervel

Sde1 Interview Questions Asked at Other Companies

Q1. DSA and Language Questions: 1. Difference between Arrays and Arra ... read more
asked in Park Plus
Q2. 1. What is a doubly-linked list? And real-world applications.
asked in Amazon
Q3. pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent proces ... read more
Q4. Given one point and circle how will you find if it's inside circl ... read more
asked in Amazon
Q5. N queen problem with problem statement and dry running of code wi ... read more

Sde1 Interview Questions & Answers

user image Anonymous

posted on 13 Dec 2022

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-

I was interviewed before Dec 2021.

Round 1 - Aptitude Test 

Normal coding questions and good mcqs.

Round 2 - Technical 

(2 Questions)

  • Q1. Mountain array in a array.
  • Ans. 

    A mountain array in an array refers to an array where the elements form a peak and then descend.

    • The array should have a peak element and then the elements should descend on both sides.

    • For example, [1, 3, 5, 4, 2] is a mountain array in an array.

    • However, [1, 2, 3, 4, 5] is not a mountain array in an array.

  • Answered by AI
  • Q2. Median in a running stream.
  • Ans. 

    Finding the median in a running stream of data.

    • The median is the middle value in a sorted list of numbers.

    • In a running stream, we cannot sort the data beforehand.

    • We can use a min-heap and a max-heap to keep track of the median.

    • As new data comes in, we add it to the appropriate heap and balance the heaps.

    • The median is then the top element of the larger heap or the average of the top elements of both heaps.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well and be confident and solve using better approach with good time complexity

Skills evaluated in this interview

Sde1 Interview Questions & Answers

user image Anonymous

posted on 18 Aug 2022

I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.

Round 1 - Coding Test 

2 coding questions were asked, 1 invloves sorting and manipulation and the other one was trees question.

Round 2 - One-on-one 

(3 Questions)

  • Q1. 1 trees question and 1 priority queue question
  • Q2. Connect n ropes with minimum cost(priority queue question)
  • Ans. 

    Connect n ropes with minimum cost using priority queue

    • Create a priority queue and insert all the ropes into it

    • Pop the two smallest ropes from the queue and connect them

    • Insert the new rope into the queue and repeat until only one rope remains

    • The cost of connecting two ropes is the sum of their lengths

    • Time complexity: O(nlogn)

    • Example: Ropes of lengths 4, 3, 2, and 6 can be connected with a cost of 29

  • Answered by AI
  • Q3. Find the height of the tree when the leaf nodes are connected with each other
  • Ans. 

    The height of the tree can be found by counting the number of edges from the root to the farthest leaf node.

    • Count the number of edges from the root to the farthest leaf node

    • This will give the height of the tree

    • Example: If the farthest leaf node is 4 edges away from the root, the height of the tree is 4

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Amazon Sde1 interview:
  • Data Structures
  • OOPS
Interview preparation tips for other job seekers - Practicing Data Structures and Algorithms is must.

Skills evaluated in this interview

Amazon interview questions for designations

 Software Developer

 (187)

 Software Developer Intern

 (94)

 Software Engineer

 (78)

 Software Development Engineer

 (34)

 Device Associate

 (33)

 Software Development Engineer II

 (29)

 Data Engineer

 (22)

 Quality Service Associate

 (18)

Sde1 Interview Questions & Answers

user image Anonymous

posted on 15 Mar 2022

Round 1 - Coding Test 

Leetcode medium problems

Round 2 - One-on-one 

(1 Question)

  • Q1. Find middle of linkedlist add 2 numbers
  • Ans. 

    To find the middle of a linked list, use two pointers - one moving twice as fast as the other. To add two numbers, traverse both lists simultaneously and add corresponding digits.

    • Use two pointers to find the middle of the linked list - one moving twice as fast as the other

    • To add two numbers represented by linked lists, traverse both lists simultaneously and add corresponding digits

    • If the sum of two digits is greater th

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - keep on trying, you will reach there

Skills evaluated in this interview

Get interview-ready with Top Amazon Interview Questions

Sde1 Interview Questions & Answers

user image Anonymous

posted on 11 Oct 2021

I applied via Referral and was interviewed in Apr 2021. There were 4 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. 2 variable variation of LIS
  • Ans. 

    2 variable variation of LIS

    • The problem involves finding the longest increasing subsequence in two arrays

    • Dynamic programming can be used to solve the problem

    • The time complexity of the solution is O(n^2)

    • Example: Given two arrays [1, 3, 5, 4] and [2, 4, 3, 5], the longest increasing subsequence is [3, 5]

    • Example: Given two arrays [10, 22, 9, 33, 21, 50, 41, 60] and [5, 24, 39, 60, 15, 28, 27, 40], the longest increasing su

  • Answered by AI
  • Q2. House robber 3
  • Ans. Solved it with top down dp
  • Answered Anonymously
  • Q3. Search in rotated sorted array
  • Ans. 

    Search for an element in a rotated sorted array.

    • Use binary search to find the pivot point where the array is rotated.

    • Compare the target element with the first element of the array to determine which half to search.

    • Perform binary search on the selected half to find the target element.

    • Time complexity: O(log n), Space complexity: O(1).

  • Answered by AI
  • Q4. First non repeating character in continuous character stream
  • Ans. 

    Find the first non-repeating character in a continuous character stream.

    • Use a hash table to keep track of character frequency.

    • Iterate through the stream and check if the current character has a frequency of 1.

    • If yes, return the character as the first non-repeating character.

    • If no non-repeating character is found, return null or a default value.

  • Answered by AI
  • Q5. One priority queue question

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare Data structures and algorithms well, Answer managerial questions using STAR methodologies.

Skills evaluated in this interview

Sde1 Jobs at Amazon

View all

Sde1 Interview Questions & Answers

user image Anonymous

posted on 2 Nov 2022

I applied via Company Website and was interviewed before Nov 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

General Leet Code Question and it was easy

Round 3 - Coding Test 

General coding question which was from difficult

Interview Preparation Tips

Topics to prepare for Amazon Sde1 interview:
  • leetcode
  • Python
Interview preparation tips for other job seekers - Prepare Amazon Principles and also leet code.
Good to know system designs and more.

Sde1 Interview Questions & Answers

user image Anonymous

posted on 3 Feb 2022

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

Prepare from hackerrank array and trees problems

Interview Preparation Tips

Interview preparation tips for other job seekers - work on ds and algo as they focus more on this knowledge

Sde1 Interview Questions & Answers

user image Anonymous

posted on 16 Nov 2021

I applied via Campus Placement and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Medium DSA questions based on trees, linked lists and 1 graph

Interview Preparation Tips

Interview preparation tips for other job seekers - DSA was the only thing needed in my interview so being consistent with Leetcode, giving weekly contests(at least attempting Hard level qns even if not completing them) was really helpful.

Sde1 Interview Questions & Answers

user image Anonymous

posted on 12 Aug 2017

I was interviewed in Aug 2017.

Interview Questionnaire 

16 Questions

  • Q1. -----/ But here the main thing is that handling of corner cases like when there are duplicate tickets and when there is no proper path possible with given tickets
  • Q2. N queen problem with problem statement and dry running of code with 4 queens and then writing the code
  • Ans. 

    N queen problem is to place N queens on an NxN chessboard without any two queens threatening each other.

    • The problem can be solved using backtracking algorithm

    • Start with placing a queen in the first row and move to the next row

    • If no safe position is found, backtrack to the previous row and try a different position

    • Repeat until all queens are placed or no safe position is found

    • Code can be written in any programming langua...

  • Answered by AI
  • Q3. Sub set problem(Check if there exists any sub array with given sum in the array ) . But the thing here is that we have to do it with space complexity of only O( 1 K ) . K is the sum given .
  • Ans. 

    Check if there exists any sub array with given sum in the array with O(1K) space complexity.

    • Use two pointers to traverse the array and maintain a current sum.

    • If the current sum is greater than the given sum, move the left pointer.

    • If the current sum is less than the given sum, move the right pointer.

    • If the current sum is equal to the given sum, return true.

  • Answered by AI
  • Q4. What is NP hardness .
  • Ans. 

    NP hardness refers to the difficulty of solving a problem in non-deterministic polynomial time.

    • NP-hard problems are some of the most difficult problems in computer science.

    • They cannot be solved in polynomial time by any known algorithm.

    • Examples include the traveling salesman problem and the knapsack problem.

  • Answered by AI
  • Q5. What is the difference between references and pointers
  • Ans. 

    References and pointers are both used to access memory locations, but references cannot be null and cannot be reassigned.

    • Pointers can be null and can be reassigned to point to different memory locations.

    • References are automatically dereferenced, while pointers need to be explicitly dereferenced.

    • Pointers can perform arithmetic operations, while references cannot.

    • Example: int x = 5; int *ptr = &x; int &ref = x;

    • Example: i

  • Answered by AI
  • Q6. What is difference between reference variable and actual reference
  • Ans. 

    A reference variable is a variable that holds the memory address of an object, while an actual reference is the object itself.

    • A reference variable is declared with a specific type and can only refer to objects of that type.

    • An actual reference is the object itself, which can be accessed and manipulated using the reference variable.

    • Changing the value of a reference variable does not affect the original object, but changi...

  • Answered by AI
  • Q7. In this round he asked me about previous round questions and their time complexities also . and with every DS and Algo related questions they asked the time complexities
  • Q8. Segmentation , virtual memory , paging
  • Q9. 0-1 Knapsack problem
  • Q10. What happens when we type an URL
  • Ans. 

    When we type an URL, the browser sends a request to the server hosting the website and retrieves the corresponding webpage.

    • The browser parses the URL to extract the protocol, domain, and path.

    • It resolves the domain name to an IP address using DNS.

    • The browser establishes a TCP connection with the server.

    • It sends an HTTP request to the server.

    • The server processes the request and sends back an HTTP response.

    • The browser re

  • Answered by AI
  • Q11. Implementation of LRU (WIth Production level code)
  • Ans. 

    Implementation of LRU cache using a doubly linked list and a hash map.

    • LRU (Least Recently Used) cache is a data structure that stores a fixed number of items and evicts the least recently used item when the cache is full.

    • To implement LRU cache, we can use a doubly linked list to maintain the order of items based on their usage frequency.

    • We can also use a hash map to store the key-value pairs for quick access and retrie...

  • Answered by AI
  • Q12. Given page access sequence and we have to tell final output using different page replacement algorithms like FIFO , LRU etc
  • Q13. What is indexing in DBMS How do we maintain it
  • Ans. 

    Indexing in DBMS is a technique to improve query performance by creating a data structure that allows faster data retrieval.

    • Indexing is used to speed up data retrieval operations in a database.

    • It involves creating a separate data structure that maps the values of a specific column to their corresponding records.

    • This data structure is called an index.

    • Indexes are typically created on columns that are frequently used in s...

  • Answered by AI
  • Q14. B trees , B+ trees with examples
  • Ans. 

    B trees and B+ trees are data structures used for efficient storage and retrieval of data in databases.

    • B trees are balanced trees with a variable number of child nodes per parent node. They are commonly used in databases to store large amounts of data.

    • B+ trees are a variant of B trees where all data is stored in the leaf nodes, and the internal nodes only contain keys. They are commonly used in databases for indexing.

    • B...

  • Answered by AI
  • Q15. AVL trees with examples and their balancing
  • Ans. 

    AVL trees are self-balancing binary search trees. They maintain a balance factor to ensure height balance.

    • AVL trees are named after their inventors, Adelson-Velsky and Landis.

    • They are height-balanced, meaning the difference in height between left and right subtrees is at most 1.

    • Insertion and deletion operations may cause imbalance, which is corrected by rotations.

    • AVL trees have a worst-case time complexity of O(log n) ...

  • Answered by AI
  • Q16. Pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent process id let us say the process that we killed is 2 now we have to print 2,0,1 as 0,1 are child of 2 and suppose that if we have children f...
  • Ans. 

    Given a list of process IDs and their corresponding parent process IDs, print the IDs of all processes that are children of a specific process ID, and recursively kill all their children.

    • Iterate through the list of process IDs and parent process IDs

    • Check if the current process ID is the one to be killed

    • If yes, recursively find and print all its children

    • If a child has further children, recursively kill them as well

  • Answered by AI

Interview Preparation Tips

Round: WRITTEN
Experience: It is a written round .

We are given with 2 coding questions of 10 marks each .There is no negative marking for coding questions

1)Given a string you have to partition the string in such a manner that each part of the partitioned string is a palindrome in itself and you have to count the number of such partition

For eg: given string NITIN
N ITI N
N I T I N
NITIN
So output will be 3.

2)You are given with a large paragraph and N words.
You have to find a min length subparagraph of the paragraph which contain all those N words in any order. Here length of a paragraph is the count of words in the paragraph.

There are 20 MCQ's all are technical questions only majorly from DSA
Tips: Coding it comes from practice . And for aptitude be good at fundamentals like time complexities etc .

Round: Technical Interview
Experience: Some times luck in interview is also important .I was unable to solve the second question initially ,but later with the help of my interviewer I was able to solve it .
Tips: Even if you are not able to solve the question initially don't be panic it will definitely go well

Round: Technical Interview
Experience: There are so many other questions . But sorry to say that I don't remember all of them ,if I remember them at some other time I will again update it here .

This round interviewer was very nice person And he is very helpful in fact .
Tips: Have solid basics at all data structures and algorithms ,Operating Systems


Round: Technical Interview
Experience: This round is entirely about other CS subjects like OS , DBMS,Networking .

Here asked me do you know other CS subjects like compiler design etc .
But as I am from Electronics I told them that I don't know all those subjects
Tips: Be good at other Cs subjects also

Round: Technical Interview
Experience: I solved above question Using DFS .I constructed a Graph using given information . and I did DFS starting from Given process .In the graph I took each process as 1 Node and the corresponding parent child relationship between the process as edges .
Tips: They will give sufficient time for thinking of the solution . So don't worry immediately after seeing the question . First think well you will definitely get it

Skills: Algorithms And DataStructures, Algorithm Analysis, Operating Systems, Basic Knowledge Of DBMS, Networking Basics, Object Oriented Programming (OOP) Basics
College Name: MNIT

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Amazon Interview FAQs

How many rounds are there in Amazon Sde1 interview?
Amazon interview process usually has 2-3 rounds. The most common rounds in the Amazon interview process are Coding Test, Technical and Resume Shortlist.
How to prepare for Amazon Sde1 interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Amazon. The most common topics and skills that interviewers at Amazon expect are Basic, Clinical SAS Programming, Manual Testing, Prototype and Team Building.
What are the top questions asked in Amazon Sde1 interview?

Some of the top questions asked at the Amazon Sde1 interview -

  1. pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent process id let u...read more
  2. N queen problem with problem statement and dry running of code with 4 queens an...read more
  3. Sub set problem(Check if there exists any sub array with given sum in the array...read more

Recently Viewed

REVIEWS

Amazon

No Reviews

REVIEWS

Amazon

No Reviews

REVIEWS

Amazon

No Reviews

SALARIES

Mphasis

JOBS

Amazon

No Jobs

INTERVIEWS

RaRa Delivery

No Interviews

JOBS

Amazon

No Jobs

COMPANY BENEFITS

Amazon

No Benefits

SALARIES

Mphasis

Tell us how to improve this page.

Amazon Sde1 Interview Process

based on 14 interviews

4 Interview rounds

  • Resume Shortlist Round
  • Coding Test Round
  • Technical Round - 1
  • Technical Round - 2
View more

Interview Questions from Similar Companies

Reliance Retail Interview Questions
3.9
 • 1.5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
Paytm Interview Questions
3.3
 • 749 Interviews
Tata Group Interview Questions
4.2
 • 358 Interviews
BigBasket Interview Questions
3.9
 • 358 Interviews
Myntra Interview Questions
4.0
 • 214 Interviews
Blinkit Interview Questions
3.7
 • 180 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
AmbitionBox Interview Questions
4.9
 • 149 Interviews
JioMart Interview Questions
3.9
 • 94 Interviews
View all
Amazon Sde1 Salary
based on 1.1k salaries
₹12 L/yr - ₹48 L/yr
33% more than the average Sde1 Salary in India
View more details

Amazon Sde1 Reviews and Ratings

based on 100 reviews

4.0/5

Rating in categories

4.0

Skill development

3.3

Work-life balance

4.4

Salary

3.2

Job security

3.6

Company culture

3.8

Promotions

3.7

Work satisfaction

Explore 100 Reviews and Ratings
SDE1 FTC

Bangalore / Bengaluru

1-5 Yrs

₹ 12-25 LPA

SDE1 FTC

Hyderabad / Secunderabad

1-5 Yrs

Not Disclosed

SDE1 FTC

Bangalore / Bengaluru

1-5 Yrs

₹ 12-25 LPA

Explore more jobs
Customer Service Associate
4.2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
2.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
2.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Program Manager
2.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Amazon with

Flipkart

4.0
Compare

TCS

3.7
Compare

Google

4.4
Compare

Netflix

4.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview