FastPrep
Problem · Array

Compute Beauty of Array Products

Learn this problem
● HardAmazonOA
See Amazon hiring insights

Problem statement

The Amazon distribution center consists of arrays of products, each possessing unique attributes. The task at hand is to compute the beauty of these product arrays, with the goal of achieving an efficient selection process.

More specifically, there are arrays of products, and each array corresponds to a list of attributes. The beauty of a subarray B = [products[l], products[l+1], ..., products[r]] is quantified by counting the indices i that satisfy these conditions:

  • l ≤ i ≤ r
  • for every index j such that i < j ≤ r, products[i] > products[j]

    • An array B is a subarray of an array A if B can be obtained from A by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. In particular, an array is a subarray of itself.

    The beautiness of the entire array of products is determined by the sum of beauty values across all subarrays of a given size k.

    Given an array products of size n and an integer k. Compute the total beautiness of the array of products.

    Function

    computeBeauty(products: int[], k: int) → int

    Complete the function computeBeauty in the editor.

    computeBeauty has the following parameters:

    1. 1. int[] products: an array of integers representing the products
    2. 2. int k: the size of the subarray

    Returns

    int: the total beautiness of the array of products

    💜 Endlessly grateful to the amazing friend for their help!

    Examples

    Example 1

    products = [3, 6, 2, 9, 4, 1]k = 3return = 8
    Example 1 illustration
    So, the beauty of the array numbers is 2 + 1 + 2 + 3 = 8.

    More Amazon problems

    drafts saved locally
    public int computeBeauty(int[] products, int k) {
  // write your code here
}
    products[3, 6, 2, 9, 4, 1]
    k3
    expected8
    checking account