Available question text
Given an array nums and m queries [l[i], r[i]], determine for each query whether the elements of the specified subarray can be rearranged to form an arithmetic sequence (i.e., have a constant difference between consecutive terms after permutation). Constraints are small (n, m ≤ 500, values in ±1e5), so per-query checking is feasible.
Related questions
Continue with questions that share topics or the same question type.
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 1630. Arithmetic Subarrays
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source