You are given a hard array problem set inside an Amazon-style scenario (for example, deliveries, inventory or orders). Explain your brute-force solution, then optimize it and state the time and space complexity. Answer or hint: The exact statement was not shared, so practise the pattern. Amazon scenario problems are usually a standard array technique in disguise. Ask clarifying questions first (size of input, duplicates, negative values, sorted or not). Say the brute force and its complexity out loud. Then look for the reduction: sorting plus two pointers, prefix sums, a hash map for lookups, a sliding window or a monotonic stack. Finish with a dry run on the interviewer's example and the edge cases: empty input, a single element, all equal values and integer overflow.