SDE - 1
Amazon
3 rounds | 7 Coding problems
388 views
Interview preparation journey
Preparation
Duration: 8 Months
Topics: Data Structure, Algorithms, Machine Learning, Operating System, DBMS
Tip

Tip 1 : Practice atleast 250-300 questions on coding platforms like leetcode,gfg and interviewbit
Tip 2 : Keep revising the theoritical topics like os,dbms and computer networking
Tip 3 : You must bevery well versed and should be able to explain the projects that you have mentioned in your resume.So practice for that too

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Don't make a fancy resume.make a simple resume and mention all your relevant projects and work experience.
Tip 2 : Don't write anything in your resume that you don't have a good knowledge of.If the interviewer asks some questions relating to the topic you have mentioned you should be able to explain that clearly otherwise it will create a very negative experience.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration120 Minutes
Interview date10 Sep 2020
Problems2
Subtree of Another Tree

view more
Pair Sum

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

...
view more
02
Round
Medium
Video Call
Duration30 Minutes
Interview date20 Nov 2020
Problems2
Running Median

view more
Smallest Window

Example:

view more
03
Round
Medium
Video Call
Duration40 minutes
Interview date22 Apr 2021
Problems3
OS Questions

How would you solve the problem of critical section(apart from using semaphores)
What is Kernel and types of Kernel

Anagram Pairs

Pre-requisites: Anagrams are defined as words or names that can be formed by rearranging letters of another word. Such as "spar" can be formed by rearranging letters of "ras...

view more
Print Nodes at Distance K From a Given Node

You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given node and return the list of these nodes.

...
view more
Similar interview experiences
SDE - 1
3 rounds | 4 problems
Interviewed by Amazon
1747 views
SDE - 1
2 rounds | 3 problems
Interviewed by Amazon
1724 views
Intern
2 rounds | 3 problems
Interviewed by Amazon
33 views
SDE - Intern
2 rounds | 14 problems
Interviewed by Amazon
21 views
Companies with similar interview experiencs
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
25928 views