Maximum Number of K Divisible Components | Leetcode 2872

[@utsavjha9236]

You are a great teacher, one of the best i have seen.

[@techdose4u]

thanks for your appreciation

[@kheersagarpatel3195]

Yes sir, your teaching is just awesome, i have got new enthusiasm for the DSA and i hope i will surely reach my dream destination by following you..

[@techdose4u]

If DSA is the path to your destination then I guarantee you will be posting your success story with me in future here :)

[@kheersagarpatel3195]

@techdose4u waiting for that day and working for that day from my heart sir ..... I am also your linkedin connection i hope you recognised me....

[@techdose4u]

definitely let me know if I can help you :)

[@baka_man2512]

Thanks sir for this consistency 🙏

[@techdose4u]

Consistency is the key 🔑:)

[@LinhHoang-ml1qo]

Literally, your explaination is very good. You slolved the complex problem using the simple concept and standard in greedy approach.This make me eassyly to get the idea to solve this.Thank you, teacher!

[@techdose4u]

welcome :)

[@kky7811]

Great Explanation . Thanks for ur Effort 😎😎.

[@techdose4u]

welcome :)

[@sailendrachettri8521]

today i participated in biweekly LC contest and was able to solve 1 question :)

[@techdose4u]

great :) you will improve slowly. keep up your good work

[@sailendrachettri8521]

@@techdose4u sure sir :)

[@Princekumar-ty4qp]

Consistency🔥

[@techdose4u]

:)

[@AmarjeetKumar-to9ub]

Ty sir :)

[@techdose4u]

Welcome :)

[@chandanaarvapally]

@techdose sir, i am getting tle for the above code? what to do?

[@kiran1379]

Check if you are passing values by reference or not

[@techdose4u]

Please check your recursion break condition & reference pass as mentioned :)

[@gireeswar18]

Thank you sir. How to think about the solution like you sir? I feel stuck on seeing this problem.

[@techdose4u]

Practice the key :)

[@ENUMARTHYGNYANAPRASUNA]

​@@techdose4ufor this question what relevant topics should be practiced sir?

[@Anikait-h3d]

can you also start solving leetcode contest questions. It would really help all of us

[@indianofficialclashers9148]

Sir please explain the illustration you draw and the code side by side because many times what happens is beginners like me can't associate the two So it would be really helpful if you tell us which line of code corresponds to which illustration 🙂

[@techdose4u]

Many people might find it too boring hence avoiding that to manage within limited time :)

[@gireeswar18]

In java code we can use a static variable and init with 0 on every call, this avoids using an array to store count.

[@techdose4u]

same can be done in c++ using static :)

[@gireeswar18]

@techdose4u yes sir 😊

[@indianofficialclashers9148]

In the dfs function , where does the recursion end and start going back ?

[@techdose4u]

recursion starts with exploring all adjancent edges and ends when loop ends after exploration is done

[@crazygamerrohan9899]

if i am passing the adj vector by valyue then it is showing me time limit exceed why??

[@techdose4u]

I had mentioned in the video about integer overflow. The return type of dfs needs to be set to 64-bit integer. Ex. Long Long dfs()

[@ASHUTOSHSHARMA-us6hd]

@@techdose4u fir bhi tle aa rha hai, sir ji

[@ASHUTOSHSHARMA-us6hd]

@@techdose4u class Solution { public: long long dfs(long long node, vector adj, vector& vals, int k, long long & counter, long long parent) { long long sum = vals[node]; for (auto negh : adj[node]) { if (negh != parent) { sum += dfs(negh, adj, vals, k, counter, node); } } sum%=k; if(sum==0) counter++; return sum; } int maxKDivisibleComponents(int n, vector& edges, vector& vals, int k) { long long counter = 0; vector adj(n); for (auto it : edges) { int firstNode = it[0]; int SecondNode = it[1]; adj[firstNode].push_back(SecondNode); adj[SecondNode].push_back(firstNode); } dfs(0, adj, vals, k, counter, -1); return counter; } };

[@ASHUTOSHSHARMA-us6hd]

@@techdose4u this code is giving tle, what to do??

[@crazygamerrohan9899]

@@techdose4u means if iam passing vector as values then it requires stack space but in case of passing by reference it does not require stack space??

[@Anikait-h3d]

ab lagta hai agle week tak trees and bfs ke upar hi question ayga

[@techdose4u]

😂

[@AmitDaily_Vlogs]

sir aap robot ho kya explanation tora expressive bana skte ho kya

[@techdose4u]

If I make expressive then my sound quality will reduce. Good mic is costly hence just managing for my resources at hand :)

[@AmitDaily_Vlogs]

@techdose4u okay sir you are doing great work and it was just a feedback 😁😁

[@techdose4u]

Yea I too realised that but waiting for collecting some amount for it then will change mic:)