K Inverse Pairs Array 🔥🔥| Leetcode June challenge | Leetcode 629 | Approach + Code | C++ | Hindi 

Yes, by mistake. [1, 3,4,2] will come. Thanks for pointing out. 😀😀👍🏻

Thanks 😊

SAHI KAHA

because it contains 2 inverse pairs 3---1 and 3---2 but in testcase it is clearly written that we need k = 1

Welcome 🤗

Thanks 😊

Yeah same doubt, that last part explanation for it was a bit vague

When we have k>n then when we place n as first element then total n-1 inversion will made and we can't make more inversion than n-1. So till the k

Welcome :). And yes , thanks for letting me know, Fixed the code on github😀

for k=0

@@shyamjitiwari7519 then why at end we subtracted 1...jab subtraction hi Krna tha to add kyu kiya

@@oqant0424 fair enough, then don't make it 1. class Solution { public: int dp[1001][1001] = {0}; int kInversePairs(int n, int k) { if (k

She explained it wrong. We put 1 in order to avoid recomputation of that value. If not marked as 1 it would be computed multiple times in the recursive solution and the time complexity would be exponential.

Thank you 🙂

Sorry, This leetcode challenge series, I have started in Hindi, But in future, the series will be in English. Really sorry😓

Same here. Happens bro. But she makes great videos.

ABE TU APNA KAR NA TU SIKHAYEGA KON KYA KAREGA