Leetcode 2862. Maximum Element-Sum of a Complete Subset of Indices
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.