Available question text
The source lists this question by title. A full statement is not available in this collection.
Check the source for more detail. You can use the workspace to record questions, notes, and an approach.
This entry contains problem metadata. Read the source for the complete statement.
Related questions
Continue with questions that share topics or the same question type.
- Longest Subarray Divisible by K with At Most One Negation I
Coding · Array · Hash Table · Prefix Sum
- Longest Alternating Subarray After Removing At Most One Element
Coding
- Longest Non-Decreasing Subarray After Replacing at Most One Element
Coding · Array · Dynamic Programming
- Length of Longest Subarray With at Most K Frequency
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
LeetCode · 1 record
No company association
Official problem listing
Longest Subarray Divisible by K with At Most One Negation II
Source snapshot: Nov 13, 2026
Verified official problem metadata. This is not evidence of a recent interview ask.
View source