Amazon Software Developer Interview Questions, Process, and Tips for Experienced

There were three coding questions related to graphs and dynamic programming.

Standard ds algo questions. Practice with Neetcode 150

Q1. When will be the all the tomatoes be rotten in 2D grid
Ans. 
The tomatoes will be rotten when all adjacent tomatoes are rotten as well.
• Check each tomato in the grid and if it is rotten, check if all adjacent tomatoes are also rotten

• Repeat this process until no more tomatoes can be marked as rotten

• The process will continue until all tomatoes are rotten or no more tomatoes can be marked as rotten
Answered by AI
Add your answer

Coding about data structure

Test contain multiple questions, few related to graph and dp

Q1. Share market design
Ans. 
Share market design involves creating a platform for buying and selling stocks and other financial instruments.
• Design a user-friendly interface for traders to view stock prices and place orders

• Implement a secure payment system for transactions

• Include real-time data updates for accurate pricing information

• Create a database to store user information and transaction history
Answered by AI
Add your answer
Q2. Food delivery design
Ans. 
Designing a food delivery system for efficient and user-friendly experience.
• Focus on user-friendly interface for easy ordering

• Implement real-time order tracking for transparency

• Optimize delivery routes for faster delivery times

• Integrate payment options for convenience

• Ensure food safety and quality standards are met
Answered by AI
Add your answer

3 questions all DSA trees graphs

Q1. 2 DSA medium difficulty
Add your answer
Q2. Find middle of linked list
Ans. 
To find the middle of a linked list, use the two-pointer approach.
• Initialize two pointers, slow and fast, pointing to the head of the linked list.

• Move the slow pointer one step at a time and the fast pointer two steps at a time.

• When the fast pointer reaches the end of the list, the slow pointer will be at the middle.
Answered by AI
Add your answer
Q3. Topological sort
Add your answer