Відео

best explantion sir ,, thanks

Sir please post some new vidio .Your vidio teaches a lot please come with some dp on tree ,rerooting or in out dp content

really helped a lot .

pls complete this playlist

i am newbie but still i watching D,E problem because your explanation is really good.

thats called the explanation of dp .Any level of programmer can understand how you understand this .bro do not stop making like this video though your video view is less .

The way of approaching questions IS really outstanding.

Thanks sir

What is the macbook do you use please

Hi, I really like your explanation and approach. Could you please share the pdf of what you have explained in the video (in fact all the videos)? It would be really helpful for me. Looking forward for more such amazing content!

Hello Sir, My C++ recursive code giving TLE for two large cases can you pls review it :) //? Coin combinations CSES problem set #include <bits/stdc++.h> using namespace std ; #define MOD 1000000007 #define ll long long ll rec(vector <ll> &v , ll target , vector <ll> &memo) { if( memo[ target ] > 0) return memo[target] ; if(target == 0) return 1 ; ll sum = 0 ; for(ll i = 0 ; i < v.size() ; i ++) { if(target - v[i] < 0) break; sum += rec(v , target - v[i] , memo) ; sum = sum % MOD ; } memo[target] = sum ; return sum ; } int main () { ll n , x ; cin >> n >> x ; vector <ll> v(n) ; for(ll i = 0 ; i < n ; i++) cin >> v[i] ; sort(v.begin() , v.end()) ; vector <ll> memo (x + 1 , -1) ; memo[0] = 1 ; ll ans = rec(v , x , memo) ; cout << ans ; }

Hey pls upload more

completed the whole playlist It's hard to find such good content on UA-cam....request please complete the whole cses dp problems dada!!

Pls upload more

upload pls

upload more pls

19:56 For 9, wouldn't the dp formulation turn out to be 1+min(3,1,3) instead of 1+min(5,1,3) as the minimum number of coins required to reach a sum of 9 is 1+1+7 i.e 3.

My honest review is not to make videos so long for these type of questions But good content 😊

Watched the video completely. Probably the most lucid video on DP present on YT. Thank you for sharing your knowledge. It was indeed really helpful.

beautiful ..wow wow wow

just 0/1 knapsack

How is this solution sir? var getEncryptedString = function(s, k) { let len = s.length if(k === len) return s; if(k > len) { k = k % len } return s.slice(k) + s.substring(0,k) };

Great content sir. I am a junior developer and started my junior this month. I am very poor in DSA but now I am solving some problems in leetcode, can you please do this in javascript?

why java ??😭😭😭😭😭

struct customPair{ long long paths; map<int, int> freq; // store frquency of colors customPair(long long &paths, map<int, int> &freq){ this -> paths = paths; this -> freq = freq; } }; customPair dfs(int node, int parent, vector<vector<int>>&adj, vector<int> &colors){ long long ans = 0; int currColor = colors[node]; map<int, int> freq; for (auto child: adj[node]){ if (child == parent) continue; customPair cAns = dfs(child, node, adj, colors); ans += cAns.paths; map<int, int> &childFreq = cAns.freq; ans += childFreq[currColor]; if (childFreq.size() > freq.size()){ freq.swap(childFreq); } for (auto color: childFreq){ if (color.first == currColor) continue; ans += childFreq[color.first] * freq[color.first]; freq[color.first] += childFreq[color.first]; } } freq[currColor] = 1; return customPair(ans, freq); } void solve(){ int n; cin>> n; vector<int> colors(n + 1); for (int i = 1; i <= n; i++) cin >> colors[i]; vector<vector<int>> adj(n + 1); for (int i = 0; i < n - 1; i++){ int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } customPair ans = dfs(1, -1, adj, colors); cout << ans.paths << nline; } This is giving TLE on 15th test case in C++

bhai please yaar regular karo yaar india me quality explainer kum hi hai

Bhayya please continue your dp cses problemset

Great work Sir

great explanation sir

please make videos on advenced topic in cp

Noice explained ❤

appreciate your efforts ❤

Y r u laughing

Bhaiya beech beech k contest misa ho jate apse bhabhi ki kasam doobara du kya 🙂

bhayya please continue why have you stopped??

Hey can you make a video on setting up Java env for competitive programming?

I was grinding with this question for the last 3days. I'm also weaker in bit operation and bit intuition. And YOUR VIDEO CAME AS A SAVIOR. I got the clearest understanding of xor operation and bit intuition. Thanks a tonnnnnnn!.

please continue sir

thnx a lot. nice video. also if possible explain some recent cf dp question 1800+ in practice session . ur explaination skills are very good.

Please continue this series

Darun video dada

bro stop fucking flexing yourself at the start of every video. It's sounds so scummy to start off with self appraisal.

great series keep on continuing with this amazing series . Would love on your take on how to improve in CP

I was thinking of another lecture after your first one on dp and went to check it came or not saw this uploaded exact that moment.... cool😅...

Subscribed. Bhaiya Nice way of teaching. If possible after this series make one on Binary Search on answer

Great Explanation dada.

Great Explanation!

Please continue this series.Great work

A great explaination!

Bring a total playlist for an absolute beginner in DP :)