Video

Bhai tuu hindi bhi bolta hai 😂😂

casually explaining sieve of erathosthenous

Mera favourite graphs and trees hai.

I am starting with phone

❤❤

Bruh, I am saying honestly that I started to learn C++ from 4th class, then till 9th I build so many 3d graphics games in Pure C++ , in 9th I learned Python and build IOT and Hacking Programs in it. in 11th class I learned Assembly language and build my own OS, BUT After this I stop to continue because of 12th studies, and literally currently I forgot those all, I can't do anything now, and I can't manage my time while doing graduation BTech in AiML

I should sue my university for how awful they taught this concept. This is the clearest I have ever understood recursion

this video is illegal to watch having so much quality in one video

c mei greedy works, and a better solution imo

the quality of people here :) feels almost illegal to hear their discussions for free _/\_ orzzzzzz

can any one explain how 6/2 = 1/2

7:41

There are no shortcuts

Whenever i initialize the dp array inside my solve() function it gives incorrect but it corrects as soon as i make it global. Any particular reason for that?

2300..! And i struggle on 1500..

D Gukesh, what are you doing here?

bhaiya i am also from iit bhu yeahhh

if b == 0 you return 1.

This is not working now.. I can't change the default clang version compiler to gcc by the commands you have mentioned. What to do.... HELP please!!!!!! 🙏 🙏

Can someone please tell me which software he used to create thie presentation please

sir jatin yadav ko bhi lekr aao kabi please

// Online C++ compiler to run C++ program online #include <bits/stdc++.h> using namespace std; #define int long long int mod = 1e9+7; int32_t main() { // Write C++ code here int n,k; cin>>n>>k; vector <int> arr(n); for(int i=0;i<n;i++) cin>>arr[i]; vector <vector<int>> dp(n+1,vector<int>(k+1,0)); for(int i=0;i<=arr[0];i++) dp[0][i] = 1; for(int i=1;i<=k;i++) dp[0][i]+=dp[0][i-1]; for(int i=0;i<n;i++) dp[i][0] = 1; for(int i=1;i<n;i++){ for(int j=1;j<=k;j++){ int r = dp[i-1][j]; int l = 0; if(j-arr[i]>0) l = dp[i-1][j-arr[i]-1]; dp[i][j] = ((r-l+mod)%mod + dp[i][j-1])%mod; } } cout<<(dp[n-1][k]-dp[n-1][k-1]+mod)%mod<<endl; return 0; } iT IS GIVING WA ON 4 TETSCASE ANYONE WHO CAN HELP ME?

50 programming questions from Phone. What a legend !

Utkarsh like 6ka

From one competition (jee) to another, they really like this shit ig 🤡

thanks

Thank u

thank you very much! very helpfull!

Bro went and never came back 😢