Status: New Grad, 2019
Position: SDE1 at Amazon
Location: Bengaluru, India
Date: 17th May, 2019

Round 0 (Hackerearth Online)

1. Longest increasing subsequence
2. Given start and end time for meetings. Find maximum number of meetings you can attend without overlapping with other meetings. (Activity Selection problem)

Round 1 (Onsite)

1. Maximum sum path in a binary tree
   Later asked to print path as well.
2. Delete nth node from end of Linkedlist

Round 2 (Onsite)

1. Check whether a given tree is BST or not
2. Number of ways to color n poles with k colors such that no adjacent have same color. Similar question: https://leetcode.com/problems/paint-house-ii
3. Most challenging project I have done.

Round 3 (Onsite)

1. Given an array, each element representing length of a rope. Connect all ropes such that cost involving in joining two ropes is minimum. Cost to join two rope is sum of length of two ropes.
2. Duplicate Linkedlist with random pointers.
3. Given a number n. Check if langford pairing is possible or not for n.
4. OS questions - Semaphores, Deadlock, livelock
5. Java questions - Inner classes, Garbage collection.