> SPOILER : \u26A0\uFE0F No questions from leetcode were given!\n\n> NOTE : Hey guys! seems like the readers have a few ques, so I updated the post to address  the questions.  \n\n## Intro\n```\nStatus: New grad\nExperience : 6 months\nPosition I applied to : SDE1\n```\n## Process\n> Note : Due to the pandamic all the rounds were conducted virtually\n\nFor behavioral questions that I mentioned below - [HERE IS A GREAT LEETCODE POST](https://leetcode.com/discuss/interview-question/437082/Amazon-Behavioral-questions-or-Leadership-Principles-or-LP)\n\n\n### Round-1\n```\nOnline Coding & Behavioral Round (1 hour) :\n\t- 2 Coding questions [Difficulty : Easy]\n\t- Behavioural questions\n\nSummary : This round is fairly simple and can be easily solved \n```\n### Round-2\n```\nVirtual Interview (1 hour):\n\t- 2 Coding questions (Based on Tree, BS ) [Difficulty : Hard]\n\t- Behavioural qustions\n\nSummary : This round was the most difficult one for me,as the interviewer was building up on a simple binary search tree question and the discussion went too deep.\n\nJust to give you the context, this kind of ques was asked\n- First verify if a given tree is a BST\n- Now do the same for reverse BST\n- Then Count all the BST (subtrees)  in a given tree\n- Now Count the reverse BST (subtrees)  in a given tree\n\nTBH, I thought my chance is lost after this interview cuz, I didn\'t write the complete code for this, but I was able to write upto 3rd variation \n```\n\n### Round-3\n```\nVirtual Interview (1 hour):\n\t- 2 Coding questions (Based on BFS, DFS, BS ) [Difficulty : Medium]\n\t- Behavioural qustions\n\nSummary : This round is a medium one, I gave the solutions for both the questions and the interviewer was satified so we moved on (Pretty standard!)\n```\n\n### Round-4 (Manager/Senior Round)\n```\nVirtual Interview (1 hour):\n\t- 2 Coding questions (Based on array manipulation) [Difficulty : Medium]\n\t- CS Fundamentals\n\t- Behavioural qustions\n\nSummary : This round is also a medium one, But this round was more emphasized on CS Fundamentals\n- The CS fundamental questions include topics like OOPS, OS, DBMS\n\tHere are a few example ques topics\n\t\t- Transactions\n\t\t- Indexing/Hashing\n\t\t- Normalization\n\t\t- Deadlocks\n\t\t- Memory management\n\n```\n\n### Round-5 (Manager/Senior Round)\n```\nVirtual Interview (1 hour):\n\t- 2 Coding questions (Based on array manipulation) [Difficulty : Easy]\n\t- CS Fundamentals\n\t- Behavioural qustions\n\nSummary : Surprisingly, This is the most easiest round as I solved  the questions given in like a 5min. I did not expect this round to be that easy, as this was the last round\n```\n\n## Result\n\u2705 I was offered the SDE role!\n\n## My Thoughts and Suggestions\n* Leetcode definitely helped, But do not expect leetcode questions to show up.\n* Explaining the **TIME & SPACE** complexities is a must, and in almost all interviews they were looking for mulitple ways of solving the same problem to check your coding flexibility.\n* Behavioural questions are as important as coding.\n* The interview experience was good and the interviwers will support you throughout the process, If they see you struggle.\n* Honestly, work hard and give your best , because that\'s the most you can do!\n\n\n

SPOILER : \u26A0\uFE0F No questions from leetcode were given!\n\n> NOTE : Hey guys! seems like the readers have a few ques, so I updated the post to address  th