How to solve Leetcode 1679. Max Number of K-Sum Pairs

Problem statement 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....