← All problemsSign in

2420. Find All Good Indices

LeetCodeArrayDynamic ProgrammingPrefix SumOpen on judge ↗

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: - The k elements that are just before the index i are in non-increasing order. - The k elements that are just after the index i are in non-decreasing order. Return an array of all good indices sorted in increasing order.

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start