The Target Hunt

Given a list of integers and integer target, return all unique [x, y] pairs with x != y (from distinct indices) summing to target, each index used in at most one pair. Preserve discovery order (greedy: sweep left-to-right, for each x pick the smallest index y > x such that x+y = target and y is unclaimed). Return pairs as lists.

Example

Input

nums:[2,4,3,5,7,8,1]

target:9

Output

[[2,7],[4,5],[8,1]]

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99


def find_pairs(nums: list[int], target: int) -> list[tuple[int, int]]:
    
def find_pairs(nums: list[int], target: int) -> list[tuple[int, int]]:
    

Active Now|Sr. (L5)|||5.6k Attempts|1.7k Solves|