Video

Great explaination. It was hard to find video with simple explanation. Finally found this. Keep posting.

while i try to submit my code it asks to do cf config then login while i put my login id credentials it does not take them and tells csrf . how to correct this ?

thank you

simplest and best explanation available !!

I have some problems on compiler it shows me compile error

what this v vector ( 2D ) is storing

Great explanation of B. Thanks.

Please continue cfg problem of the day...

how can I format code in CP editor, In VS code its really easy ! Its looks really good after formatting the code !

Missing your potd videos !

May I know why you stop gfg daily problem? It's really helpful to people like us, who are learning how to code through that videos?

Amazing approach

Thanks ,was having a hard time with que B

what s the logiciel u are using sir ?

what is your whiteboard name? please i need to know

sir please keep uploading contest solutions videos....great explanation....really helpful !!!

irritating animation on half of the screen. can't watch it

Thank u so much for clearing all my confusions 🤗

how to add debug.h file for cpp in cp editor

not clear what's k/(n-1)!

Miss your daily potd videos

did you left codefores? you are not doing any contest lately.

Sir podt ki videos kyu nhi aa rhi hai

bro when will you upload next potd video

great explanation

waiting for daily videos

bro video dalte jao yarr we are waiting

is there any way to solve this using javascript with the same time complexity?

Great explanation

Great initiative for the Contest answers....

Thanks you please continue daily

great explanation 😍😍😍

explanation is awesome ....❤❤

nice

sir when will codeforces editorials come back 😭.

Thank you for uploading so early in the morning !

sir yee wla sol kuy kam nehi kar raha haii map<int,int>mp; for(auto it:arr)mp[it]++; set<int>st; for(auto it :mp){ if(it.second<=k){ k-=it.second; it.second=0; }else{ break; } } for(auto it:mp)st.insert(it.second); return st.size()-1;

Great explanation

5:19 The degree of all the nodes is not even. You can see that the bottom left most and right most nodes have odd degree (3).

Good Explanation Bro! 🦾

Very Nice Logic Sir 💞💞💞💞💞💞

Cf k editorials continue kijya

it can be done using booyer moore's algorithm in O(1) space complexity instead of using a map

i was stuck on this question for hours and spent a lot of my energy going through soo many videos on youtube. This video of yours is a real gem. literally the best explanation for this question across the youtube, Thank you so much sir . 🙏🙏

Please make a video for todays leetcode contest question maximum palindromes after any operations

which software you are using to explain the question?

long long dp[101][101][101]; long long solve(vector<vector<int>> &arr,int &n,int i,int j, int sum){ if(i==n-1 and j==n-1 ) return dp[i][j][sum]= sum == arr[i][j]; if(dp[i][j][sum]!=-1) return dp[i][j][sum]; dp[i][j][sum]=0; if(arr[i][j] <= sum){ if(i+1<n) dp[i][j][sum]+=solve(arr,n,i+1,j,sum-arr[i][j]); if(j+1<n) dp[i][j][sum]+=solve(arr,n,i,j+1,sum-arr[i][j]); } return dp[i][j][sum]; } long long numberOfPath(int n, int k, vector<vector<int>> &arr){ // Code Here memset(dp,-1,sizeof(dp)); return solve(arr,n,0,0,k); }

Nice explanation, can you please come with DP series

why is this code giving runtime error //{ Driver Code Starts #include<bits/stdc++.h> using namespace std; // } Driver Code Ends class Solution { public: long long numberOfPath(int n, int k, vector<vector<int>> &arr){ // Code Here vector<vector<vector<long long>>> dp(n, vector<vector<long long>>(n, vector<long long>(k + 1, 0))); // Initialization for the starting point dp[0][0][arr[0][0]] = 1; for(int s = 0; s <= k; s++) { for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { int left = 0, up = 0; if(i == 0 && j == 0) continue; if (i > 0 && arr[i][j] <= s) up = dp[i-1][j][s-arr[i][j]]; if (j > 0 && arr[i][j] <= s) left = dp[i][j-1][s-arr[i][j]]; dp[i][j][s] = up + left; } } } return dp[n-1][n-1][k]; } };