I gave my first round today\n\nThe interviewer was a SDE-2 in Amazon and was very friendly.\n\nThese were the questions asked.\n\nQuestion 1:-\n\n```\nhttps://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/\n```\n\nI was able to identify the pattern quickly , explained the stack based approach and coded it quickly.\nThe interviewer had some questions about the approach but was satisfied at the end. \n\nTime spent : 20-25 min\n\nQuestion 2:-\n\n```\nhttps://leetcode.com/problems/minimum-cost-to-connect-sticks/\n```\n\nI quickly came up the min heap approach and explained how the logic would work.The interviewer asked whether I\'ve seen this problem before ,I said yes.The interviewer liked the fact that I was honest and didn\'t ask me to code this and gave an other question.\n \n Time spent :- 5-10 mins\n\nQuestion 3:-\n\n```\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/\n```\n\nI explained the dfs approach and gave a example with the tree the interviewer gave.The interviewer was satisfied and asked me code it out.There was a small mistake in my code which I was able to identify with the hints given. \n\nTime spent :- 25-30 min.\n\nI\'ll update my post if I\'m called for the second round.\n\n**Update** : I was called for the next round. You can find it [**here**](https://leetcode.com/discuss/interview-experience/1755267/Amazon-or-New-Grad-or-SDE-1-or-Round-2)

I gave my first round today\n\nThe interviewer was a SDE-2 in Amazon and was very friendly.\n\nThese were the questions asked.\n\nQuestion 1:-\n\n\nhttps://leet