LeetCode Question · Feb 2022 · Los Angeles

Amazon | OA

5 upvotes 4,298 views 9 replies

Question Details

For an array of size n, calculate the sum of power of every subarray. Power of subarray [i, j] is min(i, j) sum(i, j). Sum of power of every subarray in [2,3,2,1]...

Full Details

🔒

Unlock all Amazon questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a amazon interview for a swe role during the oa round reported in 2022.

It covers the following topics: Arrays .

Topics