Leetcode 1798 Solution
This article provides solution to leetcode question 1798 (max-number-of-k-sum-pairs)
Access this page by simply typing in "lcs 1798" in your browser address bar if you have bunnylol configured.
Leetcode Question Link
https://leetcode.com/problems/max-number-of-k-sum-pairs
Solution
class Solution:
def maxOperations(self, nums: List[int], k: int) -> int:
nums = sorted(nums)
l = 0
r = len(nums) - 1
ans = 0
while l < r:
if nums[l] + nums[r] == k:
ans += 1
l += 1
r -= 1
elif nums[l] + nums[r] < k:
l += 1
else:
r -= 1
return ans