Leetcode 1679 | Max number of k-sum pairs | 13th from LC 75 | 90 days SE prep

[@Malayalam_learner]

Thanks sir 😅 how can i forget this simple logic 😮

[@shantanusingh7423]

sir the way u explain , outstanding

[@vaibhavshukla6911]

Thank you

[@utkarshsinghchouhan8819]

great explanation sir 🫡

[@rajeevkumargupta532]

class Solution { public int maxOperations(int[] nums, int k) { int ans=0; Arrays.sort(nums); int fi=0; int li=nums.length-1; while(fi

[@deepaktyagi8725]

Bhai sort karke t.c increase hogi...

[@brajeshmohanty2558]

bhai naya video kab ayega

[@dayashankarlakhotia4943]

public int maxOperations (int[]nums,int k){ Mapmpp=new HashMap(); int cnt=0; for(int i=0;i0){ cnt++; mpp.put(k-nums[i],mpp.get(k-nums[i])-1); }else { mpp.put(nums[i],mpp.getOrDefault(nums[i],0)+1); } } return cnt; } } Tc=0(n); SC=0(n);