Power Of Numbers Recursive solution Dynamic Programming Playlist  

Bahut pyara Bhai ji maja hi a gaya.Ka samjhaye hai bhaiya ji.

very well taught bhaiya , phle baar apka video dikha ....love the way u approach the problem

I have been struggling with DSA from 8 months now and lost my interest in computer science but your videos helped me a lot and boost my confidence. Thanks a lot.

Bhaiya aap bahut achhe se smjhate hai , pura clear

great breakdown of the problems with amazing teaching style

great explanation bhaiya

bhai tum bhut hee acha padate ho keep it up

You explain very well. like " haule haule "

your style of teaching is great

bhaiya ur teaching style is awesome👌

sir saw many videos but this is next level🙏

Got Everything, thank you for making such an helpful video.

Nicely explained concepts💯

same explanation like my professors thanks sir

nice explanation

Explanation was great and thorough i liked it cause learn what this problem meant to teach .

wow what a nice explanation sir

bhut badiya

Great video. Thanks a lot!

good one

amazing explanation sir thank you, sir

Nice explanation

Great explanation.

Please either make a playlist or make a video on how to complete all these playlist

14:41 Bhaiya ka dedication

great sir

Crystal Clear ho gya🙂😇

Nice explanation ✨

Great video bhaiya

Great video

bhaiyya ek barr dry run krke bataado please ans=power(N,R/2) is line me power work kese karra he samajh nahi ayaa mtlb vo power calculate kese karra he ????

bhai mjee aa gye majjeeee 🥳🥳

Very useful , thank you so much :)

Sir please make full playlist of recursion

Bhaiya which app do u use for these notes?

Bhaiya array se related DSA problem video upload kro in Java language

Thanks sir

great vid!

Bro I am not able to solve using this approach for even case it's pow(n,r//2) but for od it's n*pow(n,r-1) that works for me

osm tutorial sir

bhai me khudse solve krke output me code run pe test cases pass hue but submit ke baad time limit exceed abhi aapka tutorial dekh raha hu

nice video

Good

thanks you sirr.

nice

thank you bro

thank you so much sir 😄😄

wow

My thought for the return statement- if (rev ==1){ return 1; } return num * f(num, rev-1); Edit after seeing the solution: base condition me thoda mistake ho gya... But glad ki return condition sahi h...

🤩

great vid! 😃

Bhaiya please jaldi jaldi video daldo

Greate VID :)

Sir can u please make a playlist i don't know where to start should i learn hashing first binary heap

Servicenow per video banaye na

#princebhai

🙌🙌🙌🙌🙌😊

14:20

Noice

Very helpful video

It doesn't handle the negative power value ie Input: x = 2.00000, n = -2 Here is the complete code: (In JavaScript) and no need MOD value const myPow = (x, n) => { if (n === 0) return 1; if (n < 0) return 1 / myPow(x, -n); if (n % 2 === 0) { const halfPow = myPow(x, n / 2); return halfPow * halfPow; } else { const halfPow = myPow(x, (n - 1) / 2); return halfPow * halfPow * x; } }; // let a=2, b=10 // 1024 let a = 2.1, b = 3; //9.26100 // let a= 2.00000, b = -2 //0.25000// Explanation: 2-2 = 1/22 = 1/4 = 0.25 console.log("myPow", myPow(a, b));

when I tried the optimized code, no test cases passed :(

Sir tree graph ka concept clear nahi hota hai please eski detail playlist create kariye

acha theek H Bheek nai maango krr de rha hoon comment koi bkl hi hoga jo comment nai krega all the best

Giving TLE

bhaiya this code giving wrong ans :- class Solution{ public: //You need to complete this fucntion long long power(int N,int R) {int modu=1000000007; if(R==0)return 1; if(N==0)return 0; //Your code here if(R%2 ==0){ long long ans= power(N,R/2); return ((ans%modu)*(ans%modu))%modu; } else { long long ans= power(N,(R-1)/2); return ((ans%modu)*(ans%modu)*(N%modu))%modu; } } }; but below code running correctly after removing brackets:--- class Solution{ public: //You need to complete this fucntion long long power(int N,int R) {int modu=1000000007; if(R==0)return 1; if(N==0)return 0; if(R%2 ==0){ long long ans= power(N,R/2); return (ans%modu*ans%modu)%modu; } else { long long ans= power(N,(R-1)/2); return (ans%modu*ans%modu*N%modu)%modu; } } }; i am not able to understand the difference??please explain bhaiyaa...

// } Driver Code Ends class Solution{ public: //You need to complete this fucntion long long power(int N,int R) { int mod =1e9+7; //Your code here if(N == 0) return 0; if(R == 0) return 1; if (R %2== 0){ long long ans= power(N,(R)/2); return ((ans%mod)*(ans%mod))%mod; } else { long long ans = power(N,(R-1)/2); return ((ans%mod)*(ans%mod)*(N%mod))%mod; } } }; whats the problem with this code

why we cannot use direcly pow function?? bhaiyaa

if(r%2==0){ r=r/2; vector dp(r+1,0); dp[0] = 1; for(int i = 1; i

Please Makkari mat krna dost

avg bihari teacher

Great video