**Company Name**: Amazon

**Job Role: SDE** **Intern**

**Years of Experience Required: **Fresher (0 Yrs.)

**Drive**: On-Campus

**Preparation for Amazon**

**Topics: **Data Structures and Algorithms

**Duration: **5 months

**Source of Preparation: **Leetcode, GFG, Striver’s SDE sheet.

[*BONUS]:*

*Check Striver’s SDE Sheet for Interview Preparation.**Check the ultimate resume-building guide for coding interviews*.*Blind 75 Leetcode*

**Amazon Interview Rounds**

**Round 1:** Online assessment

- 2-sum Problem: Given an array of integers nums[] and an integer target, return
*indices of the two numbers such that their sum is equal to the target*.**Note**: Assume that there is, and you are not allowed to use the*exactly*one solution*same*element twice. Example: If target is equal to 6 and num[1] = 3, then nums[1] + nums[1] = target is not a solution. - Bottom view of Binary tree

**Round 2:** Technical Interview

- Longest Consecutive Sequence in an Array: You are given an array of ‘N’ integers. You need to find the length of the longest sequence which contains the consecutive elements.
- Find K-th Permutation Sequence: Given
**N**and**K**, where N is the sequence of numbers from**1 to N([1,2,3….. N])**find the**Kth permutation sequence**. For N = 3 the 3! Permutation sequences in order would look like this

**Round 3:** Technical Interview

- Implement Queue using Stack
- Construct BST from given keys

**Round 4:** Technical + Managerial

- Layers of OSI model
- 3-way handshaking
- What are HTTP and HTTPS protocols?
- Serialize And Deserialize a Binary Tree: Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.

**Verdict:** Selected