Available question text
Remove elements from either end to make the sum of removed elements equal x; equivalently, find the longest contiguous subarray whose sum equals total(nums) - x (so you minimize removed count) and return n - length, or -1 if no such subarray exists — solvable in O(n) with a sliding-window/hashmap approach.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Size Subarray Sum
Coding · Array · Binary Search · Prefix Sum
- Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
- Max Consecutive Ones III
Coding · Array · Binary Search · Prefix Sum
- Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy
Sources · 2 references
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 1658. Minimum Operations to Reduce X to Zero
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Bloomberg
Minimum Operations to Reduce X to Zero
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 59.6. This is not an interview probability.
View source