วีดีโอ

op bro. great !!

thanks👍

Great explanation man. Kudos for the solution. Keep helping others.🎉

Nice explanation sir , according to you what should be the rating of this problem ?

Good approach Gopal !! Keep posting the contest solution . The part i liked most is how you described the intutuion , most people describe solution but very few describe its intution I am subscribing you .

This explanation might not be entirely clear, so I have created a detailed tutorial in Hindi for better understanding. You can check it out here:- th-cam.com/video/6-52VV1doOc/w-d-xo.html

No way this could be considered a medium problem hahaha. Thanks for sharing the solution to this problem!

bhaiya can you please try to write the logic more cleaner? like you can use write-pad-pen rather then mouse. and if possible it will be better if you explain in hindi bcz i face some difficulty. and will definately help your channel grow. otherwise all good.

best explanation on utube!!

Love your channel! Keep growing. I am stuck on 1650 Rating, how to improve? (leetcode)

Thank you, simple and clean code 🖌️

NICE SUPER EXCELLENT MOTIVATED

NICE SUPER EXCELLENT MOTIVATED

Thank you for this explanation sir : )

Great Work!

nice explanation

thnx bro \

Now this question has some extra test cases added, this program will fail when n and d both have value 1 and also you have not considered gcd ,it should be in the simplest form ,at last a and b should be divided by its gcd to get the simplest fraction.

my side

prog.cpp: In member function void Solution::dfs(Node*, int&, int&): prog.cpp:106:71: error: _gcd was not declared in this scope if(r->left && r->right) cur_gcd=_gcd(r->left->data,r->right->data); this compiler error

if(r->left && r->right) cur_gcd=_gcd(r->left->data,r->right->data); this is error line no 106 how to resolve

Gcd was not delecared

looking for code help could you share email id

You are great bro 👍👍👍

perfect explanation

d is the frequency of each element in the entire array?

Thanks bro , I was stuck in this problem and your soln really helped me ......

Best Solution!

Coding ninjas is better for data structures course sir

Thankyou

thank you for the video

Nice explanation bhaiya

Please help this code sir

Sir please share ur mail id i will share program pic i need program for that

Swap parity, good array programs solution want sir please share

i watched this solution by many channel but i did not get but here i understood thanks bro!

Great explanation

Good Logic!!

I just saw this Channel. The Explanation was Awesome! Keep Growing !!!!

Good night bro 😊

How your solution is O(N)? I think, it is O(NlogN) because you are creating a set of N elements for finding distinct integers. Please clarify.

Hey bro 😎 can u please create a playlist of python 🐍

sir ,what if v[ ] = {2, 4,5} and X = 6 . then we wouldn't have got our answer .

thank for making tutorial it helps me a lot.

Sir can you explain in python too

Hey it was a nice explanatory video Could you help me out with this coding solution it is currently giving WA ----------------------------------------------------------------------------------------------- vector<vector<int>> direction={{1,0},{0,1},{-1,0},{0,-1}}; int longestIncreasingPath(vector<vector<int>>& matrix) { // Code here if( matrix.size()==0) return 0; int n=matrix.size(),m=matrix[0].size(),longestPath=0; vector<vector<int>> cache(n,vector<int> (m,0)); for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { int longest=recursiveFunction(matrix,cache,i,j); longestPath=max(longest,longestPath); } } return longestPath; } int recursiveFunction(vector<vector<int>>& matrix,vector<vector<int>>& cache, int i,int j) { if(cache[i][j]>0) return cache[i][j]; int n=matrix.size(),m=matrix[0].size(),size=0; for(int k=0;k<direction.size();k++) { int x=i+direction[k][0],y=j+direction[k][1]; if(x>-1&&y>-1&&x<n&&y<m&&matrix[i][j]<matrix[x][y]) { int longest=recursiveFunction(matrix,cache,x,y); size=max(size,longest); } } cache[i][j]=size+1; return cache[i][i]; }

very complicated solution. It is just an easy problem. just sort an array and if prev and current have the same parent then find the gcd of their child and get maximum. @CODEnow please check others solutions and explain so other students can quickly get them. This is just advice if you can please don't take it personally.

Please write in clear handwriting

But O(nlogn was expected) not to just pass all the given test cases

👍