Видео

i find all your content helpful. Thank you.

your explainations was very good and really help me to understand the approach, one suggestion is that you could try to calm or maintain you body language which is anoying

suggestion if possible remove top down section as it is so much confusing rest other is awesome

Brilliant Presentation style is superb.

Today's problem to upload karo jaldi Remove Graph edges

optimization of 3202 freezed my brain

i never understand your class why i dont know

What I was thinking in first at the time of contest is using recursive with memoization and it is good to go and solved both Q2 & Q3 but when I used memoization it gives memory limit exceed error i both the cases and My submission is left with just last 10 cases in both the Questions and due to that I was stuck on these Questions in my whole leetcode contest and that actually ruined/fucked up my mind totally. My question is that to you Aryan that how we should think out like these approaches at the time of contest because in my mind apart from memoization no other approached come .

My memoization java code runs -> class Solution { int dp[][]; int kk; public int maximumLength(int[] nums, int k) { int n = nums.length; kk = k; dp = new int[n+1][k+1]; for (int[] d1 : dp) { Arrays.fill(d1, -1); } int ans = 0; for(int i=n-1; i>0; i--){ for(int j=i-1; j>-1; j--){ ans = Math.max(ans , 2 + solve(nums , j , (nums[j] + nums[i]) % kk)); //finding first two elements. } } return ans; } public int solve(int[] nums, int pre, int mod) { if (pre == -1) return 0; if (dp[pre][mod] != -1) return dp[pre][mod]; int ans = 0; for (int i = pre-1; i >= 0; i--) { if ((nums[i] + nums[pre]) % kk == mod) { ans = Math.max(ans, 1 + solve(nums, i, mod)); break; } } dp[pre][mod] = ans; return ans; } }

No Vedio on 1,2,3 ?

🫡

why for type =3 we are dsu of alice only shouldn't we check for both

please make video on leetcode 3202

do not put such strong hints in video title, It spoils the question pretty quickly

DSU was very intuitive and I was able to solve it easily using it

My solution failed exactly on the "edge" case mentioned, it cleared my doubt why the answer is 7. Thanks!!!

Why we cannot use median method , it is giving me wrong answer on 453 test case , if i just join two medians of different trees , please reply @ARYANMITTAL

I guess this one was easier than Problem 3, what do you guys think?

Good explanation. Thanks for all the knowledge.

GREAT

Can someone tell me whats wrong in my code? @ARYANMITAL please? int n = s.length() , score = 0; map < char , vector < int > > maa; for(int i = 0; i < n; i++){ int x = abs(points[i][0]) , y = abs(points[i][1]); maa[s[i]].push_back(max(x , y)); } int maxi = INT_MAX; //upper_limit -> represent second closest occurence of any character for(auto &[c , v] : maa){ sort(v.begin() , v.end()); if(v.size() > 1) maxi = min(maxi , v[1]); } for(auto [c , v] : maa){ if(v[0] < maxi){ score++; } } return score;

Bro, I forgot that problem you had a editorial which can be solved using multi bfs traversal. Can someone give me that problem name/link.

i didn't understand the 2 consq. sortedAncestors line

100% for your efforts bhai but fir bhi smz nhi aya .....hindi me daloge to jada understanding bethegi and grow bhi jada kr paoge bhai..e.g., love babbar and striver have same content but lovebabbar grow more becuase of his hindi language .

honestly, didnot understand anything.

@ARYANMITTAL, Please create a video for this question 3009 leetcode.com/problems/maximum-number-of-intersections-on-the-chart/description/

explain in java. i am sure u r reach and subscribers will be doubled

Awesome explanation, perfectly described, you got a new subscriber!

Bro..sexyyy tbh

thanks for all the efforts

Hi Aryan, I've been working on the same problem you discussed in your video about finding ancestors in a directed graph. Here’s the code I wrote to solve it using a topological sort approach. Could you please check it and let me know if there are any optimizations or improvements I can make? Thanks! class Solution { public: vector<vector<int>> getAncestors(int n, vector<vector<int>>& edges) { unordered_map<int, list<int>> mp; vector<int> indegree(n, 0); for (const auto& edge : edges) { int u = edge[0]; int v = edge[1]; mp[u].push_back(v); indegree[v]++; } queue<int> q; for (int i = 0; i < n; ++i) { if (indegree[i] == 0) { q.push(i); } } vector<set<int>> v(n); // Perform a topological sort while (!q.empty()) { int top = q.front(); q.pop(); for (int x : mp[top]) { indegree[x]--; if (indegree[x] == 0) { q.push(x); } v[x].insert(v[top].begin(), v[top].end()); v[x].insert(top); } } vector<vector<int>> ans; for (const auto& x : v) { ans.push_back(vector<int>(x.begin(), x.end())); } return ans; } };

is it working now???? I am interested

Hello Hello Hello Aryan Good morning

I was waiting for your video😅...thanks a lot!!

Master Leetcode in 2024 - ruclips.net/video/ZbkG8-ifnIk/видео.html

anyone can tell what is wrong in this code and logic #define ll long long class Solution { public: ll helper(int i, int j, vector<int>& nums) { if(i > j) return 0; ll sum = 0; ll maxi = -1e9; for(int k = i;k<=j;k++) { if((k-i) % 2 == 0) sum += nums[k]; else sum -= nums[k]; ll result = sum*pow(-1,k-i) + helper(k+1,j,nums); if(result > maxi) maxi = result; } return maxi; } long long maximumTotalCost(vector<int>& nums) { int n = nums.size(); return helper(0,n-1,nums); } };

this guy is very much irritating, overact very much

3 variants of flip bits leetcode learnt

I did the same except didn't think of the base case as you did. Awesome solution mate!

Java Solution Easy: public long maximumImportance(int n, int[][] roads) { long deg[] = new long[n]; for(int x[]:roads){ deg[x[0]]++; deg[x[1]]++; } Arrays.sort(deg); long sum=0; long val=1; for(long it:deg){ sum+= it*val; val++; } return sum; }

Why used long long?

🙏🙏🙏🙌🙌

i solved only because of you

at 6:48 bro remembered his maksad....

Easy q , solved on my own, took some time to get intuition

priority_queue tag has also been mentioned on leetcode , how to do from that? i myself came up with the solution that u are telling here but i am just curious that how priority_queue will help here ?

Do you daily upload these daily challenge questions of leetcode?.....btw explanation was too good !!

great aryan bhai .... bss tumhara hi sahara h ab to