Complete the function below. The function receives the full standard input as a single string and returns the exact standard output lines.
Problem
Given an integer array and a target value, return all unique pairs whose sum equals the target. Each pair must be sorted in ascending order, and duplicate pairs must appear only once.
Output the pairs in lexicographic order as a,b. If there are no valid pairs, output None.
Complete solveUniquePairsWithTargetSum. It has one parameter, String input. The first line contains n target; the second line contains n integers. Return one output line per unique pair.
input = "8 5\n1 4 2 3 3 2 0 5" return = ["0,5","1,4","2,3"]
The pair 2,3 is output once even though both values appear multiple times.
input = "4 10\n1 2 3 4" return = ["None"]
No pair sums to 10.
Pairs are value pairs, not index pairs; duplicates in the input should not create duplicate output lines.
- Count Promotional PeriodsOA · Seen Jun 2026
- Find Maximum Total Amount (SDE I, Fungible :)Seen Jun 2026
- Get Minimum AmountOA · Seen Jun 2026
- Find Minimum CostOA · Seen Jun 2026
- Get Smallest Base SegmentOA · Seen Jun 2026
- Maximum Non-Adjacent House ValueONSITE INTERVIEW · Seen Jun 2026
- Running Delivery Time MediansONSITE INTERVIEW · Seen Jun 2026
- Select Least Resource TasksOA · Seen Jun 2026
public String[] solveUniquePairsWithTargetSum(String input) {
// write your code here
}