Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Amazon Lab126 SDE Interview Questions and Answers

Updated 13 Apr 2024

Amazon Lab126 SDE Interview Experiences

1 interview found

SDE Interview Questions & Answers

user image Anonymous

posted on 13 Apr 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Hashmap problem
  • Ans. 

    Hashmap problem involving storing and retrieving data efficiently.

    • Hashmap is a data structure that stores key-value pairs.

    • It allows for fast retrieval of values based on keys.

    • Examples include storing student grades by student ID, or mapping employee names to their salaries.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice leetcode

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

6 Questions

  • Q1. Find a equilibrium index in array
  • Ans. 

    Find an index in array where sum of elements on left side is equal to sum of elements on right side.

    • Loop through array and calculate sum of all elements

    • Then loop through array again and check if sum of elements on left side is equal to sum of elements on right side

    • Return the index if found, else return -1

  • Answered by AI
  • Q2. Find the minimum no of jumps required to reach the end of array.where element at each index represent how many max moves you will take in right
  • Ans. 

    Find minimum number of jumps required to reach end of array with max moves in right direction at each index.

    • Use dynamic programming approach to solve the problem

    • Maintain an array to store minimum number of jumps required to reach each index

    • Traverse the array and update the minimum number of jumps for each index

    • Return the minimum number of jumps required to reach the end of array

  • Answered by AI
  • Q3. Tournament tree puzzle and write code for that
  • Ans. 

    Tournament tree is a binary tree where each node represents a match between two players/teams.

    • Tournament tree is used in sports tournaments to determine the winner.

    • The leaf nodes represent the players/teams and the internal nodes represent the matches.

    • The winner of each match is the node with the higher score.

    • Code can be written using a recursive function to traverse the tree and determine the winner.

  • Answered by AI
  • Q4. Find the 2 maximum elements in array in O(n+log(n)) comparison
  • Ans. 

    Find 2 maximum elements in array in O(n+log(n)) comparison

    • Use divide and conquer approach

    • Divide array into two halves

    • Recursively find max elements in each half

    • Compare the two max elements to find the overall max elements

  • Answered by AI
  • Q5. Celebrity Problem puzzle and write code for that
  • Q6. Given a 2D array of 0 and 1. where each row is sorted. find the row with maximum no of 1 in minimum time complexcity
  • Ans. 

    Find row with maximum 1s in a sorted 2D array of 0s and 1s.

    • Use binary search to find the first occurrence of 1 in each row.

    • Calculate the number of 1s in each row using the index found in step 1.

    • Keep track of the row with maximum number of 1s.

    • Time complexity: O(m log n), where m is the number of rows and n is the number of columns.

  • Answered by AI

Interview Preparation Tips

College Name: IIT GANDHINAGAR

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?
  • Ans. 

    Efficiently check if a number is present in an array where each element differs by 1.

    • Use binary search to find the element in the array

    • Calculate the difference between the middle element and the first element

    • If the difference is equal to the index of the middle element minus the index of the first element, then the left half of the array is consecutive

    • If the difference is not equal, then the right half of the array is ...

  • Answered by AI
  • Q2. Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5
  • Ans. 

    Microsoft Excel

    • Add more chart types (p1)

    • Improve collaboration features (p2)

    • Enhance data analysis tools (p3)

    • Integrate with more external data sources (p4)

    • Improve error handling and debugging (p5)

  • Answered by AI
  • Q3. A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square
  • Ans. 

    Program to rearrange shuffled 16 squares to get original big square

    • Create a 4x4 matrix to represent the big square and fill it with shuffled squares

    • Loop through the matrix and check if each square is in the correct position

    • If a square is not in the correct position, swap it with the square in the correct position

    • Repeat until all squares are in the correct position

  • Answered by AI
  • Q4. There are 9 identical Marbels out of which 1 is heavy. find out that Marbel
  • Q5. Given 3 sorted arrays, array a, b, c. find all pairs where a[i] + b[j] = c[k] note : a, b , c are sorted arrays
  • Q6. What is the difference between the two declarations? int p=*(int*)i; int p=*(int*)&i;
  • Ans. 

    The first declaration casts i to int pointer and dereferences it, while the second declaration casts the address of i to int pointer and dereferences it.

    • The first declaration assumes i is already an int pointer.

    • The second declaration takes the address of i and casts it to an int pointer.

    • The first declaration may cause a segmentation fault if i is not an int pointer.

    • The second declaration may cause unexpected behavior i...

  • Answered by AI
  • Q7. Given an unsorted array of size 5. How many minimum comparisons are needed to find the median? then he extended it for size n
  • Ans. 

    Minimum comparisons needed to find median in unsorted array of size n

    • For odd n, median is the middle element. For even n, median is the average of middle two elements

    • Minimum comparisons needed for odd n is (n-1)/2. For even n, it is n/2

    • Various sorting algorithms can be used to find median in an unsorted array

  • Answered by AI
  • Q8. Given an array which is alternatively sorted. What will be the time complexity to find out an element in it. e.g. 14,3,16,6,22,7,24,11,27
  • Ans. 

    Time complexity to find an element in an alternatively sorted array.

    • The time complexity will be O(log n) using binary search.

    • Check the middle element and compare with the target element.

    • If the middle element is greater than the target, search in the left half of the array.

    • If the middle element is smaller than the target, search in the right half of the array.

    • Repeat until the target element is found or the array is exha

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: #Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?
#Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5.
#A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.
#There are 9 identical Marbels out of which 1 is heavy. find out that Marbel.
#given 3 sorted arrays, array a, b, c.
find all pairs where a[i] + b[j] = c[k]
note : a, b , c are sorted arrays.
#What is the difference between the two declarations?
int p=*(int*)i;
int p=*(int*)&i;
#Given an unsorted array of size 5.
How many minimum comparisons are needed to find the median? then he extended it for size n.
#Given an array which is alternatively sorted. What will be the time complexity to find out an element in it.
e.g. 14,3,16,6,22,7,24,11,27

College Name: NA

Skills evaluated in this interview

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

I applied via Campus Placement and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - Coding Test 

3 coding questions, mostly focused on dp, graphs strings and arrays, it was medium to hard level

SDE Interview Questions & Answers

Samsung user image Anonymous

posted on 17 Dec 2024

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
Not Selected
Round 1 - Coding Test 

Coding test which was difficult (Hard Leetcode)

Interview experience
3
Average
Difficulty level
Hard
Process Duration
4-6 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Mar 2023. 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 - HR 

(1 Question)

  • Q1. Tell me about yourself
Round 3 - Technical 

(1 Question)

  • Q1. Reverse a tree using DSA
  • Ans. 

    Reverse a tree using DSA involves traversing the tree in a specific order and swapping the left and right child nodes.

    • Start by traversing the tree in post-order or level-order traversal.

    • Swap the left and right child nodes of each node as you traverse the tree.

    • Continue until all nodes have been visited and their children swapped.

  • Answered by AI

Skills evaluated in this interview

SDE Interview Questions & Answers

Samsung user image Anonymous

posted on 17 Oct 2023

Interview experience
2
Poor
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Oct 2022. There were 2 interview rounds.

Round 1 - Coding Test 

It was of 3 hours and they have their own software for this.

Round 2 - Technical 

(2 Questions)

  • Q1. They asked questions on graph trees and binary search. Also heap.
  • Q2. Questions on heaps data structure

Interview Preparation Tips

Topics to prepare for Samsung SDE interview:
  • DSA
Interview preparation tips for other job seekers - Prepare for DSA and project.

SDE Interview Questions & Answers

Samsung user image Anonymous

posted on 22 Oct 2023

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-

I applied via Job Portal

Round 1 - Coding Test 

2 Coding quesiton were asked based on dsa

Round 2 - Technical 

(1 Question)

  • Q1. Technical question related to dsa were asked
Round 3 - HR 

(1 Question)

  • Q1. Why do you want to join samsung?

SDE Interview Questions & Answers

Samsung user image Anonymous

posted on 15 Nov 2022

I applied via Walk-in and was interviewed in May 2022. 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 - Coding Test 

Basic coding round with 3 CP based questions

Round 3 - One-on-one 

(2 Questions)

  • Q1. Use of namespace in c++
  • Ans. 

    Namespace in C++ is used to avoid naming conflicts and organize code.

    • Namespace allows grouping of related functions, classes, and variables.

    • It helps in avoiding naming conflicts by providing a unique identifier to each entity.

    • Namespace can be nested within another namespace.

    • Using namespace keyword, we can access the entities within a namespace.

    • Example: namespace std { class string {}; }

    • Example: using namespace std; str

  • Answered by AI
  • Q2. How would++(++i) work
  • Ans. 

    The expression would increment the value of i twice before using it in the operation.

    • The value of i would be incremented by 2 before being used in the operation.

    • This is equivalent to writing i = i + 2; followed by the operation using the new value of i.

    • For example, if i was initially 3, the expression would evaluate to 6.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - question were a bit atypical so knowledge part from basic knowledge is needed

Skills evaluated in this interview

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

I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Abcdef jssu ksye ksyd kahe jeheb

Round 2 - Technical 

(2 Questions)

  • Q1. Introduce yourself
  • Q2. Project related questions
Contribute & help others!
anonymous
You can choose to be anonymous

Amazon Lab126 Interview FAQs

How many rounds are there in Amazon Lab126 SDE interview?
Amazon Lab126 interview process usually has 1 rounds. The most common rounds in the Amazon Lab126 interview process are One-on-one Round.

Recently Viewed

REVIEWS

Wipro

No Reviews

SALARIES

Accenture

REVIEWS

Wipro

No Reviews

JOBS

Jio Institute

No Jobs

SALARIES

Deloitte

SALARIES

Jio

No Salaries

REVIEWS

Wipro

No Reviews

REVIEWS

Wipro

No Reviews

SALARIES

Jio

SALARIES

Jio

Tell us how to improve this page.

Amazon Lab126 SDE Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

SDE Interview Questions from Similar Companies

Google SDE Interview Questions
4.4
 • 15 Interviews
Samsung SDE Interview Questions
3.9
 • 4 Interviews
Dell SDE Interview Questions
4.0
 • 3 Interviews
Qualcomm SDE Interview Questions
3.8
 • 3 Interviews
Razorpay SDE Interview Questions
3.6
 • 3 Interviews
Nagarro SDE Interview Questions
4.0
 • 2 Interviews
View all
Software Engineer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Program Manager 2
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Amazon Lab126 with

Google

4.4
Compare

Microsoft Corporation

4.0
Compare

Apple

4.3
Compare

Samsung

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