Best Dot Product — Solution & Editorial
Sort both ascending and pair positionally — the rearrangement inequality: sorted-with-sorted maximizes the sum (largest with largest, most negative with most negative).
Complexity: O(N log N)
Sort both ascending and pair positionally — the rearrangement inequality: sorted-with-sorted maximizes the sum (largest with largest, most negative with most negative).
Complexity: O(N log N)