They asked the questions as below: 1. Why do you want to join Amazon? 2. Which part would you like to join? Front end- Back end or more broader side? 3. Difference between Array and Linked list? 4. Retrieval in an array and a linked list? 5. Insertion in an array and a linked list? 6. What if the array is full? 7. Big 0 of insertion in an array and a linked list? 8. WAP to check whether the string is a palindrome? 9. Take an example and support your answer. 10. Big 0 of the program you made just now. 11. Difference between binary search tree and Hash Table. 12. What will be the big 0 of searching in binary tree and hash table 13. Worst case scenario in Binary Search tree 14. How do you solve collision problems in a Hash Table. 15. WAP using two queues, queue 1 and queue 2 and insert into the stack. The three functions that are allowed to use are: Size(), Enqueue(), and Dequeue.