## *I recently got offer from **Amazon** For SDE -1.*\n**Location** - Hyderabad ( India )\n\nI have 6 months work experience.\n\n**Interview details** - total 5 round ( 1 online coding + 4 face to face )\n\n**1st round** ( Hackerearth platform) - two questions were there. I solved 1 out of them. One was easy medium (dfs, bfs based) and second was string based question. \n\n**Face to face rounds**-\n\n**2nd** - one array is given which is level order traversal of a full binary tree.while traversing if the node is of odd level we will visit its left child then right child and if level is even will visit right child then left child.we have to form the tree using given traversal.\n\n**3rd** - 10 mins discussion about current work .\n\nQ1. https://leetcode.com/problems/top-k-frequent-elements/\n\nWhat if data size is too large can not store in memory, ie. stored in file and you are getting input as stream.Given approach like divide the file in smaller parts ( multi hashmap + heap)\nSee below link for sol. \n\nhttps://zpjiang.me/2017/11/13/top-k-elementes-system-design/\n\nThe interviewer was Dev manager . Didn\'t asked me to write full code. Just pseudo code.\nAnd full code for heapify function.\n\n**4th** - \t\n\nQ1.https://leetcode.com/problems/longest-consecutive-sequence/\nQ2.https://leetcode.com/problems/kth-smallest-element-in-a-bst/\n\nInstead of kth smallest . he asked kth largest.\nFull code was required for both question.\n\n**5th** -  2 Behavioral Questions  + 1Technical\n\nQ1. Tell me an instance where your manager told you \u201C Dont do this\u201D.\nQ2. don\u2019t remember\n\nQ3. A story based question was there like  A plant is there . It will drop two seeds one at left one at right. Any one or both of them can convert to grown up plant. Then again they will drop seeds left and right.\nFinally boils down to full binary tree is there. Any node is either plant or empty space (NULL). At any level length of pipes required to water the plant is distance between left most node ( grown up plant ) - rightmost node ( grown up plant).\n\nMain focus was how will you store the full binary tree representation.if you make tree. Let say n  (number of level ) is too high. Eg 1000. How much memory it will consume. Is it feasible for much larger n.\n\nFinally i took approach . I will store it in file in a searlized tree manner.\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/\nThe will traverse level by level and calculate the value required for each level.  \n\n**Suggested preparation strategy -** \n\n**1** .Start topic wise. Filter questions on leetcode for each topic and solve some easy , some medium and some hard problems.\n\n**2**. Solve top interview questions list on leetcode\n\thttps://leetcode.com/problemset/all/?listId=wpwgkgt\nSort with difficulty level and solve all of the.\n\n**3**. Solve top 100 liked questions \n\thttps://leetcode.com/problemset/all/?listId=79h8rn6\n\n*After 1 step .Parallely solve topics which you feel need more practice like Dynamic programming  / graphs etc. with step 2 / 3.*\n\n\n**Understand the logic behind each solution properly. Don\u2019t memorise it.\nI was rejected during my 3rd year of college , I had appeared for internship at amazon .**\nI was asked to find the element which appears once.\nI told him the hashmap approach . Then told him the xor approach, i,e to take xor of all numbers.but i didnt knew why this solution works.\n**I was rejected at that time.**\n

I recently got offer from Amazon For SDE -1.\nLocation - Hyderabad ( India )\n\nI have 6 months work experience.\n\nInterview details - total 5 round ( 1 online