AWS Cloud Support Associate Amazon interview experience

Interview rounds

Round

Easy

Online Coding Interview

Duration90 Minutes

Interview date15 Nov 2020

Coding problem1

MCQ + Coding

1. Fibonacci Member

Easy

0/40

Asked in companies

Create a function that determines whether a given number N belongs to the Fibonacci sequence. If N is found in the Fibonacci sequence, the function should return true; otherwise, it should return false.

Problem approach

In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation

Fn = Fn-1 + Fn-2
with seed values

F0 = 0 and F1 = 1.

Try solving now

Round

Easy

Video Call

Duration60 Minutes

Interview date15 Nov 2020

Coding problem2

OS in Depth and DSA

1. Operating System Question

Virtual Memory,
Orphan process, Zombie process,
OS Boot Process,
Memory Management,
Linux Commands

Problem approach

Tip 1: Learn OS Concepts in depth

2. Next Greater Element

Easy

10m average time

90% success

0/40

Asked in companies

You have been given an array/list ‘ARR’ consisting of ‘N’ positive integers. Your task is to return the Next Greater Element(NGE) for every element.

The Next Greater Element for an element ‘X’ is the first element on the right side of ‘X’ in the array 'ARR', which is greater than ‘X’. If no such element exists to the right of ‘X’, then return -1.

For example:

For the given array 'ARR' = [7, 12, 1, 20]

The next greater element for 7 is 12.
The next greater element for 12 is 20. 
The next greater element for 1 is 20. 
There is no greater element for 20 on the right side.

So, the output is [12, 20, 20, -1].

Problem approach

Push the first element to stack.
Pick rest of the elements one by one and follow the following steps in loop.
Mark the current element as next.
If stack is not empty, compare top element of stack with next.
If next is greater than the top element, Pop element from stack. next is the next greater element for the popped element.
Keep popping from the stack while the popped element is smaller than next. next becomes the next greater element for all such popped elements.
Finally, push the next in the stack.
After the loop in step 2 is over, pop all the elements from the stack and print -1 as the next element for them.

Try solving now

Round

Easy

Video Call

Duration90 Minutes

Interview date17 Nov 2020

Coding problem2

Computer Networks in depth and coding question

1. Computer Networks Questions

DHCP, DORA Process,
DNS,
Complete flow when you trigger amazon.com,
Port Numbers,
Troubleshoot questions

Problem approach

Tip 1: Learn Computer Networks in depth

2. Detect and Remove Loop

Moderate

10m average time

90% success

0/80

Asked in companies

Given a singly linked list, you have to detect the loop and remove the loop from the linked list, if present. You have to make changes in the given linked list itself and return the updated linked list.

Expected Complexity: Try doing it in O(n) time complexity and O(1) space complexity. Here, n is the number of nodes in the linked list.

Problem approach

loyd’s Cycle-Finding Algorithm
Approach: This is the fastest method and has been described below:

Traverse linked list using two pointers.
Move one pointer(slow_p) by one and another pointer(fast_p) by two.
If these pointers meet at the same node then there is a loop. If pointers do not meet then linked list doesn’t have a loop.

Try solving now

Round

Easy

Video Call

Duration60 Minutes

Interview date24 Nov 2020

Coding problem2

Managerial Round

1. Project Based Questions

1. Why have you used this particular tech stack?

2. What challenges did you face?

2. Basic HR Questions

Behavioral Questions based on Amazon Leadership Principles

Problem approach

Tip 1: MUST GO THROUGH AMAZON LEADERSHIP PRINCIPLES (Most Important)

Round

Easy

Video Call

Duration60 Minutes

Interview date9 Dec 2020

Coding problem1

Bar Raiser

1. Basic HR Question

1. Where do you see yourself after 5 years?

2. How will you handle team dispute situations?

Problem approach

Tip 1 : MUST GO THROUGH AMAZON LEADERSHIP PRINCIPLES (Most Important)

AWS Cloud Support Associate

Interview preparation journey

Are you ready for your Dream Job?

Interview rounds

1. Fibonacci Member

Create a function that determines whether a given number N belongs to the Fibonacci sequence. If N is found in the Fibonacci sequence, the function should return true; otherwise, it should return false.

1. Operating System Question

2. Next Greater Element

You have been given an array/list ‘ARR’ consisting of ‘N’ positive integers. Your task is to return the Next Greater Element(NGE) for every element.

The Next Greater Element for an element ‘X’ is the first element on the right side of ‘X’ in the array 'ARR', which is greater than ‘X’. If no such element exists to the right of ‘X’, then return -1.

For example:

1. Computer Networks Questions

2. Detect and Remove Loop

Given a singly linked list, you have to detect the loop and remove the loop from the linked list, if present. You have to make changes in the given linked list itself and return the updated linked list.

Expected Complexity: Try doing it in O(n) time complexity and O(1) space complexity. Here, n is the number of nodes in the linked list.

1. Project Based Questions

2. Basic HR Questions

1. Basic HR Question