Available question text
Given an array where a move decrements any element by 1, return the minimum number of decrements needed to make the array zigzag (either every even index is a peak or every odd index is a peak). Compute the minimal total decreases required across the two possible zigzag patterns.
Related questions
Continue with questions that share topics or the same question type.
- Apply Operations to Make All Array Elements Equal to Zero
Coding
- Make Array Elements Equal to Zero
Coding
- Make Lexicographically Smallest Array by Swapping Elements
Coding · Array · Sorting · Union-Find
- Minimum Number of Operations to Make All Array Elements Equal to 1
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1144. Decrease Elements To Make Array Zigzag
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source