SDE - 1
Amazon
3 rounds | 10 Coding problems
476 views
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures and Algorithms, CS core subjects specially OS, DBMS & CN, OOP principlesLow level system design.
Tip

Tip 1 : Practice a lot of DSA questions.
Tip 2 : Learn system design also.

Application process
Where: Campus
Eligibility: CGPA criteria was above 6.5 for all branches
Resume tip

Tip 1: Should be of 1 page.
Tip 2: Mention projects along with important details in bullet forms.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration150
Interview date24 Oct 2020
Problems2

#### Note:

view more
Problem approach

This was easy because I have solved it in codezen already. I used 2 pointers head and tail and initially they were NULL. Then I compared the head of 2 given linked lists and one which was smaller will be the new head of my sorted linked lists. Then I applied simple merge function of the merge sort while comparing elements and adding to my linked lists accordingly.

Clone a linked List having random pointers

#### Given a linked list having two pointers i...

view more
Problem approach

There are 2 solutions for it. I have used the optimized one. Created the copy of node 1 and insert it between node 1 & node 2 in original Linked List, create a copy of 2 and insert it between 2 & 3. I Continued in this fashion till the end, add the copy of N after the Nth node. Now I copied the random link in this way

original->next->random= original->random->nex...

view more
02
Round
Medium
Video Call
Duration40
Interview date26 Oct 2020
Problems2
Longest Common Subsequence

#### Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.

view more
Problem approach

I told him 2 approach. One was based on sorting in nlogn time. He told me to optimize it. I did it in linear time using hashing. He was satisfied with it.

Longest Substring Without Repeating Characters

#### Example:

``Suppose given input is ...``
view more
Problem approach

There are 3 ways to solve it. One is use 2 loops i,j from zero to length of the string. Check if string from i to j have unique character or not.

03
Round
Medium
Face to Face
Duration42
Interview date26 Oct 2020
Problems6
Problem approach

To make concurrency cheaper, the execution aspect of process is separated out into threads. As such, the OS now manages threads and processes

Kernel-Level threads make concurrency much cheaper than process because, much less state to allocate and initialize. However, for fine-grained concurrency, kernel-level threads still suffer from too much overhead.

Why do we need dispatchers in short term scheduling?
Problem approach

When the processes are ready to execute, they are pushed into the ready queue. The short term scheduler runs in the CPU and is used for selecting a single process from the ready queue for execution. A process dispatcher gives control of the CPU to a process selected by the short term scheduler....

view more
Difference between Round robin and SJF scheduling algorithms.
Problem approach

Shortest Job First (SJF) Scheduling Algorithm is based upon the burst time of the process. The processes are put into the ready queue based on their burst times. In this algorithm, the process with the least burst time is processed first. The burst time of only those processes is compared that are present or have arrived until that time. It is also non-preemptive in nature. Its...

view more
Which is the best scheduling algorithms that you know?
Problem approach

It depends on the requirment.

Write a SQL query to find 3rd largest salary in a database
Problem approach

Select salary from employee order by desc limit 3,1

Dice Throws

#### You are given D dice, each having F faces numbered 1 to F, both inclusive. The task is to find the possible number of ways to roll the dice together such that the sum of face-up numbe...

view more
Start a Discussion
Similar interview experiences
Software Engineer
3 rounds | 5 problems
Interviewed by Amazon
1700 views
SDE - 1
3 rounds | 4 problems
Interviewed by Amazon
1726 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
1620 views
SDE - 1
2 rounds | 3 problems
Interviewed by Amazon
1705 views
Companies with similar interview experiencs
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
25719 views