Amazon rounds often use classic array problems where you must explain how you moved from brute force to an O(n) answer. Trapping rainwater is a good example, because the clean solution comes in steps: brute force, then prefix maxima, then two pointers. Use it to practise talking through each improvement out loud, not only writing the final code. Jumping straight to two pointers without explaining why it is correct often costs marks with the interviewer.