1679. Max Number of K-Sum Pairs

Medium

2.1K

47

You are given an integer array `nums`

and an integer `k`

.

In one operation, you can pick two numbers from the array whose sum equals `k`

and remove them from the array.

Return *the maximum number of operations you can perform on the array*.

**Example 1:**

Input:nums = [1,2,3,4], k = 5Output:2Explanation:Starting with nums = [1,2,3,4]: - Remove numbers 1 and 4, then nums = [2,3] - Remove numbers 2 and 3, then nums = [] There are no more pairs that sum up to 5, hence a total of 2 operations.

**Example 2:**

Input:nums = [3,1,3,4,3], k = 6Output:1Explanation:Starting with nums = [3,1,3,4,3]: - Remove the first two 3's, then nums = [1,4,3] There are no more pairs that sum up to 6, hence a total of 1 operation.

**Constraints:**

`1 <= nums.length <= 10`

^{5}`1 <= nums[i] <= 10`

^{9}`1 <= k <= 10`

^{9}

Accepted

121.7K

Submissions

212.5K

Acceptance Rate

57.3%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved