Available question text
Partition indices by their square-free kernel (i.e., remove all square factors from each index) since i*j is a perfect square iff the two indices share the same kernel; the answer is the maximum sum of nums over any such group.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Choose K Elements With Maximum Sum
Coding
- Count Submatrices with Top-Left Element and Sum Less Than k
Coding
- Difference Between Element Sum and Digit Sum of an Array
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 2862. Maximum Element-Sum of a Complete Subset of Indices
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source