Maximize profitable pairs

Q: Maximize profitable pairs

This question evaluates proficiency in greedy algorithms, sorting, two-pointer techniques, edge-case reasoning, and algorithmic complexity analysis for array pairing problems.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given an array profits of n integers representing net profit per item and an integer threshold T. You may form disjoint pairs (i, j). What is the maximum number of pairs such that profits[i] + profits[j] >= T? Describe an O(n log n) algorithm using sorting and a left/right pointer strategy, prove correctness, analyze complexity, and discuss edge cases (odd n, negative values, very large or very small T). Provide pseudocode.

Maximize profitable pairs

Overview

Comments (0)