Amazon interview experience Real time questions & tips from candidates to crack your interview

Software Support Engineer III

Amazon
upvote
share-icon
6 rounds | 10 Coding problems

Interview preparation journey

expand-icon
Journey
One of the recruiters reached out to me to apply for a Support Engineer role. It was a wonderful experience being interviewed at Amazon. Even though I was not selected, I learned a lot about how on-site interviews are conducted.
Application story
I was reached out to by a recruiter on the Naukri platform. It was an on-site interview in Bengaluru, and all interviews were conducted on the same day.
Why selected/rejected for the role?
The reason was not mentioned by the recruiting team. I assume it might be because of my 90-day notice period.
Preparation
Duration: 1 Month
Topics: Data Structures, Unix, Shell Scripting, Troubleshooting, C++
Tip
Tip

Tip 1: Go through the Amazon DSA questions on coding platforms.
Tip 2: Learn in depth about Linux commands and Shell scripting.
Tip 3: Prepare for behavioural questions based on the Leadership Principles.

Application process
Where: Linkedin
Eligibility: No criteria, (Salary Package - N/A)
Resume Tip
Resume tip

Tip 1: Match the job description in your resume.
Tip 2: Be clear and concise.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date15 May 2025
Coding problem0

The first round will be an online assessment with some business scenario questions (level: easy) and multiple-choice questions on Linux and scripting.

02
Round
Easy
Coding Test - Pen and paper
Duration45 minutes
Interview date17 May 2025
Coding problem2

A written test on coding (two easy DSA questions), Linux commands, troubleshooting, and shell scripting.

1. Reverse the String

Easy
15m average time
85% success
0/40
Asked in companies
SAP LabsWalmartFacebook

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".
follow up:
Try to solve the problem in O(1) space complexity. 
Problem approach

- I need to take a sample string and proceed with coding.

- I used a swapping approach with two pointers: one at the start and one at the end of the string.

- Once the start pointer is equal to or greater than the end pointer, return from the code.

Try solving now

2. Remove Duplicates

Easy
15m average time
80% success
0/40
Asked in companies
GE (General Electric)AmazonCIS - Cyber Infrastructure

Ninja is playing with numbers but hates when he gets duplicate numbers. Ninja is provided an array, and he wants to remove all duplicate elements and return the array, but he has to maintain the order in which the elements were supplied to him.

Problem approach

- I created an empty array (vector) to store the unique elements.

- I used two loops to traverse through the array.

- I added only the unique elements to the newly created array and returned the result.

Try solving now
03
Round
Easy
Face to Face
Duration60 minutes
Interview date17 May 2025
Coding problem2

Two DSA questions were asked — one easy and one medium.

1. Buildings with Sunset View

Moderate
0/80
Asked in company
Amazon

You are given an array of positive integers representing the heights of a row of buildings. You are observing these buildings from the far right side (i.e., from a position at infinity on the positive x-axis).

A building is considered to have a "sunset view" if no building to its right is taller than or equal to it.

Your task is to find and return a list of the heights of all buildings that have a sunset view, in the order they appear from left to right in the original array.


Problem approach

- In any condition, the rightmost element will be visible and hence will be added to the output array.

- I traverse from the end of the array to the first element and compare each with the largest element stored in the output array.

- If the number found in the array is larger than the element stored in the output array, it is then added to the output array.

Try solving now

2. Move Zeroes To End

Moderate
30m average time
70% success
0/80
Asked in companies
Thought WorksSAP LabsMicrosoft

Given an unsorted array of integers, you have to move the array elements in a way such that all the zeroes are transferred to the end, and all the non-zero elements are moved to the front. The non-zero elements must be ordered in their order of appearance.

For example, if the input array is: [0, 1, -2, 3, 4, 0, 5, -27, 9, 0], then the output array must be:

[1, -2, 3, 4, 5, -27, 9, 0, 0, 0].

Expected Complexity: Try doing it in O(n) time complexity and O(1) space complexity. Here, ‘n’ is the size of the array.

Problem approach

- It can be solved using the two-pointer approach (i, j).

- If the first element is 1, the j pointer is moved forward until it finds the value 0.

- If a 0 is found, it is swapped with the i pointer, which is still at the value 1.

Try solving now
04
Round
Medium
Face to Face
Duration60 minutes
Interview date17 May 2025
Coding problem3

The second face-to-face interview focused on Shell scripting, Linux commands, and my previous project experience.

1. Process Extractor

Write a shell script to find all words starting with "process" in a file at a Unix path, print those lines, and save them to an output file.

Problem approach

- I used the grep command to search for the word.

- The | (pipe) command can be used to send the output of the first command as input to the next command.

- Save the result in a new file.

2. Mobile Extractor

Write a shell script to find all 10-digit mobile numbers in a file.

Problem approach

- Use the awk command for pattern searching.

- sed is another command that can be used.

3. Linux Commands

Explain a few Linux commands that you know.

05
Round
Medium
Video Call
Duration60 minutes
Interview date23 May 2025
Coding problem2

This round was conducted by the Hiring Manager. I was asked one Java DSA question and behavioural questions about my previous project experiences. This round primarily focused on evaluating my alignment with the Leadership Principles.

1. Longest Substring Without Repeating Characters

Moderate
30m average time
65% success
0/80
Asked in companies
AdobeInformaticaIntuit

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

Problem approach

I traversed through the loop, and the output string was added to another string.

Try solving now

2. Hiring Manager round

  • Think of a scenario when you went above and beyond for a customer.
  • Give an example from your work where you had a major impact.
06
Round
Medium
Video Call
Duration45 minutes
Interview date4 Jun 2025
Coding problem1

This round was called the Bar Raiser.
All the questions were behavioural, designed to test Amazon's Leadership Principles.

1. Bar Raiser

This round was called the Bar Raiser. Questions were based on Amazon's Leadership Principles.

  • Give a scenario where you had a disagreement with your manager.
  • Describe a difficult customer interaction and explain why it was challenging.
  • Provide a situation where you had to make a quick decision and what the outcome was.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8962 views
0 comments
0 upvotes
company logo
Fullstack Developer
2 rounds | 4 problems
Interviewed by Amazon
7905 views
2 comments
0 upvotes
company logo
Support Engineer
4 rounds | 7 problems
Interviewed by Amazon
8293 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3501 views
0 comments
0 upvotes