# Amazon Interview Experience for Fresher SDE - 1, Aug 2019

## PROFILE

## Preparation

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.

Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.

Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

## Application Process

Add projects and Internships if you have done any and add only those things which you really know.

## Interview Process

### Round 1

This was MCQ+Coding round.

There were a total of 19 MCQs.

Topics: Trees(5), semaphores(3), deadlocks(5) and algorithms(6)

Check if two strings are anagram or not.

### Round 2

This was face to face interview round.

Given a number n, find the smallest number that has same set of digits as n and is greater than n. If n is the greatest possible number with its set of digits, then print “not possible”.

Examples:

For simplicity of implementation, we have considered input number as a string.

Input: n = "218765"

Output: "251678"

Input: n = "1234...

Given a sequence of moves for a robot, check if the sequence is circular or not. A sequence of moves is circular if first and last positions of robot are same. A move can be on of the following.

G - Go one unit

L - Turn left

R - Turn right

Examples:

Input: path[] = "GLGLGLG"

Output: Given sequence of moves is...

### Round 3

This was face to face interview round.

Given a boolean 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 5 islands

Example:

Input : mat[][] = {{1, 1, 0, 0, 0},

{0, 1, 0, 0, 1},

{1, 0, 0, 1, 1...

Reverse stack using recursion.

Given a Binary Tree, Print the corner nodes at each level. The node at the leftmost and the node at the rightmost.

For example, output for following is **15, 10, 20, 8, 25**.