Problem Brief

Count Spikes 🍓

See Amazon online assessment and hiring insights

A k-Spike is an element that satisfies both the following conditions:

There are at least k elements from indices (0, i-1) that are less than prices[i].

There are at least k elements from indices (i+1, n-1) that are less than prices[i].

Count the number of k-Spikes in the given array.

1Example 1

Input

prices = [1, 2, 8, 5, 3, 4], k = 2

Output

Explanation

8 at index 2 has (1, 2) to the left and (5, 3, 4) to the right that are less than 8. 5 at index 3 has (1, 2) to the left and (3, 4) to the right that are less than 5.

Constraints

Limits and guarantees your solution can rely on.

N/A (If you know about it, feel free to contact us :P tysm!)

Draft autosaves locally

public int countSpikes(int[] prices, int k) {
  // write your code here
}

Input

prices

[1, 2, 8, 5, 3, 4]

Output