This one is Medium level but for Intuition Building is one of the best Problems 🙈 Checkout DSA-169 Series: kzread.info/dash/bejne/Z3aprbiMXbnUp9Y.html Problem Link: leetcode.com/problems/find-k-pairs-with-smallest-sums/description/ Code & Notes: drive.google.com/file/d/1mhYlmkID6sMtyEcTSs1z6rCOWY-d10CG/view?usp=sharing

Bhai acche dance karte hoo aur explain bhi😁

Amazing explanation , i knew it was a min heap question but couldn't figure out how to apply it , brute force gave tle and mle

not able to open the drive link

Terrific explanation. Thank you!

Superrrrr❤

Finally understood the intuition.

Awesome explanation. Thanks dude🙌

Hi bro, what can be the optimal code for given question? There are N people who have already participated. The official has noted their weight and has ranked them. The problem is, he has fallen sick and there are still P people who are left to rank and participate. Considering this, you are expected to finish the process and provide the rank of the P people. Once the person is ranked, his weight is included in the category and the weight of the new person will have to consider this weight also to be ranked. To help you out, the new P people are organized in a queue in increasing order of their weights. Input Format The first line of input consists of two space-separated integers, N and P, number of people already ranked and number of people left to be ranked respectively. The second line of input consists of N space-separated integers arranged in decreasing order, representing the weight of the N people. The third line of input consists of P space-separated integers arranged in increasing order, representing the weight of the P people. Constraints 1

Aryan's code matches to that of other peeps

Consider the test case: nums1[1,2,3,4] nums2[1,10], k=2 for this the above approach gives incorrect answer right? As it considers only first k elements from the first list

@ok-google-run

3 ай бұрын

I think it also takes the rows into consideration

@ramprasath3818

Ай бұрын

No the code works fine ig. Initially we will have (1, 1), (2, 1) on the pq, 1) (1, 1) gets popped and added to res. (1, nums2[1]) => (1, 10) is pushed. 2) (2, 1) gets popped and added to res. Nothing will get pushed as we are at the end of the row. K = 0, and the ans is correct.

Amazing solution sir ji ❤

you are so amazingggggg!!!!!!

You got that charm on your face man !

Loved it

From the first list you are taking only 'k' elements, and Inside the while loop you are increasing the 'iterator' or 2nd list. Soo the values after kth element in list 1 are never getting used🤔 How do you know that we have to neglect them?

@piyush9409

Жыл бұрын

bcz the arrays are sorted if we find are answers then no need go go further as sthe sum increases

Amazing !!

@ARYANMITTAL

7 ай бұрын

Thank you so much ❤️🫡

I just realized that this doesn't work for negative numbers -10 ^ 5 Correct me if wrong . Sorry maybe it will work not sure .

VLOGS UPLOAD KRO BHAI

Sad it didn't workout🥲

aaj ka lc?

striver ne padhaya hota to kabhi yeh video kholni na padti. Jhel raha hu jaise taise

@Stefan_2117

6 күн бұрын

😂

but..but...but...

Bhai tum kya code explainer ke chote bhai ho 😂 ?

very confused

Explanation:240p