post ur recent questions which were asked in your coding round.

  1. I was asked two sum and solved in the most optimal way and the interviewers told me they had never seen that approach before. I end up getting rejected. Morons

  2. So if the target = arr[0] + arr[-1] how someone solve it in O(LogN)? If someone knows please let me know. I am really interested to know.

  3. Yep got this one as well. Thankfully I'd seen it during my review so was able to do it, but no way someone can just come up with a solution for something this hard optimally in that time. Amazon is crazy.

  4. Reverse a stack using recursion. Two operations - pop and insert called recursively in order to achieve this functionality.

Leave a Reply

Your email address will not be published. Required fields are marked *

Author: admin