mediumArrayDynamic ProgrammingPrefix Sum 0 views

Find All Good Indices

You are given a 0-indexed integer array nums of size n and a positive integer k.

You are given a 0-indexed integer array nums of size n and a positive integer k.

We call an index i in the range k <= i < n - k good if the following conditions are satisfied:

Return an array of all good indices sorted in increasing order.

Find All Good Indices diagram

Example 1

Input: nums = [2,1,1,1,3,4,1], k = 2

Output: [2,3]

Explanation: There are two good indices in the array: - Index 2. The subarray [2,1] is in non-increasing order, and the subarray [1,3] is in non-decreasing order. - Index 3. The subarray [1,1] is in non-increasing order, and the subarray [3,4] is in non-decreasing order. Note that the index 4 is not good because [4,1] is not non-decreasing.

Example 2

Input: nums = [2,1,1,2], k = 2

Output: []

Explanation: There are no good indices in this array.

Constraints

  • n == nums.length
  • 3 <= n <= 10^5
  • 1 <= nums[i] <= 10^6
  • 1 <= k <= n / 2

Hints

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

Test results

No test cases yet.