#1679

Max Number of K-Sum Pairs

specialist · 760 · lc medium +31 · verified · 56.9% accepted · 3,541 likes · top 52%

⚑ Converging Pointers (Pair / Triple Sum)

Description

You are given an integer array nums and integer k. In one operation, pick any two elements from nums that sum to k and remove them. Return the maximum number of such operations you can perform.

Example 1:

Input: nums = [1,2,3,4], k = 5

Output: 2

Explanation: 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 = 6

Output: 1

Explanation: 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.

Code

1

2

3

class Solution:
    def maxOperations(self, nums: List[int], k: int) -> int:

class Solution:
    def maxOperations(self, nums: List[int], k: int) -> int: