Available question text
Partition the array into two sums based on whether an element's 0-based index is a prime number, and return the absolute difference |sum(prime-index elements) - sum(other elements)|; the main challenge is efficiently identifying prime indices up to n−1 (n ≤ 1e5).
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 3618. Split Array by Prime Indices
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source