Update appNew update is available. Click here to update.
Support Engineer
Amazon
upvote
share-icon
2 rounds | 5 Coding problems
views
122 views
comment
0 comments
upvote
0 upvotes
Interview preparation journey
expand-icon
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 3 : Do practice on internet
Tip 4 : Practice past year questions

Application process
Where: Company Website
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date22 Aug 2022
Problems2
Ninja And The Strictly Increasing Array

Ninja is a brilliant student in the class, so his teacher assigned him a problem.

He has been given an array ‘A’ containing positive integers ‘N’ integers.

view more
Problem approach

lenOfLongIncSubArr(arr, n)
Declare max = 1, len = 1
for i = 1 to n-1
if arr[i] > arr[i-1]
len++
else
if max < len
max = len
len = 1
if max < len
max = len
return max

Try solving now
Check If Linked List Is Palindrome

You are given a Singly Linked List of integers. You have to find if the given linked list is palindrome or not.

A List is a palindrome if it reads the same from the...

view more
Problem approach

Follow the steps below to solve the problem:

A simple solution is to use a stack of list nodes. This mainly involves three steps.
Traverse the given list from head to tail and push every visited node to stack.
Traverse the list again. For every visited node, pop a node from the stack and compare data of popped node with the currently visited node.
If all nodes matched, then retu...

view more
Try solving now
02
Round
Easy
Video Call
Duration45 minutes
Interview date11 Sep 2022
Problems3
Longest Common Subsequence

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

view more
Problem approach

The idea is to use Hashing. We first insert all elements in a Set. Then check all the possible starts of consecutive subsequences.

Try solving now
Sum Tree

For a given binary tree, convert it to its sum tree. That is, replace every node data with sum of its immediate children, keeping leaf nodes 0. Finally, return its preorder.

For example:
view more
Problem approach

Get the sum of nodes in the left subtree and right subtree. Check if the sum calculated is equal to the root’s data. Also, recursively check if the left and right subtrees are SumTrees.

Try solving now
ML Questions

Difference between Data Science and Data Analyst

Machine learning algorithm you will used for predicting car sales in next year

What is SVM and reinforcement technique?

Start a Discussion
Similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Amazon
1685 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Amazon
1720 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
1613 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Amazon
1698 views
0 comments
0 upvotes
Companies with similar interview experiencs
company logo
Support Engineer
3 rounds | 13 problems
Interviewed by Salesforce
173 views
0 comments
0 upvotes
company logo
Support Engineer
2 rounds | 4 problems
Interviewed by Adobe
128 views
0 comments
0 upvotes
company logo
Support Engineer
2 rounds | 3 problems
Interviewed by Deloitte
8 views
0 comments
0 upvotes