Weekly Contest 312 | 2421. Number of Good Paths

[@ashvinkumhar5819]

Respect +++++++++++++++ , As always best content 💯💯💯💯💯

[@unknown380]

Your explanation is awesome man.

[@krishanusaha5212]

Excellent bhaiya.. Can you provide more similar type questions

[@josephstark5810]

one optimization while considering the edges in adj. list only consider a->b (when a is greater then b) or b->a(when b is greater then a) tell why? because when we only go from large value to small not need to mark activated nodes

[@nabajyotimajumdar4511]

Quality content!

[@paraspandey577]

Excellent explanation man. Using the idea of stitching up the graph instead of breaking the graph is brilliant.

[@hemanthkumartirupati]

Best explanation video on youtube

[@akshayyadav112]

now i am more confused, but u explained well

[@anvesh5377]

Instead of creating is_active array, at the time of creating adj list we add a edge if vals[u] >= vals[v] then G[u].push_back[v] else G[v].push_back[u] . This thing makesures that the bigger value nodes connected to smaller value nodes at the time union operation. And also time complexity will be reduced since the number of adj_nodes are less for a node.

[@codingmohan]

Overall time complexity will not be affected as in this case you are just iterating over all the edges exactly twice and in your approach we'll be iterating over edges exactly once. But yes, this will remove the need of "is_active" array. Good point :)

[@JohnWick-kh7ow]

What is the time and space complexity of the solution?

[@hemantranjan2297]

Time Complexity: O(n), Space Complexity: O(n)

[@JohnWick-kh7ow]

@@hemantranjan2297 how?

[@hemantranjan2297]

​@@JohnWick-kh7ow As we are iterating over all the valued nodes once, and findLeader(Time complexity would be inverse Ackermann function i.e

[@blasttrash]

@@hemantranjan2297 what about sorting? it should be nlogn for TC i think. Even on leetcode they mention nlogn for TC.

[@sunilpanchal1498]

Super Explanation 😃😃

[@bitterthread6794]

This question was well formed for HARD category and well explained here..

[@mr.s7767]

If I use nC2 formula it doesn't work. But it works if I use n * ((n - 1)/2). Why?

[@HARSHYADAV-qe9zz]

when you use nC2 formula it will calculate factorial for 'n' and 'n-2' then it divides them to get the result. The values are quite huge and it also take some time. Maybe that's why it was not working.

[@thedevtutorials]

Epic Explanation !!!

[@akashyadav3211]

Damn...thanks u cleared my doubt xC2

[@niladrisekharnath]

Great Explanation Thank You so much

[@freezefrancis]

Simple explaination to very hard problem. Well done. I could immediately code it up after watching your video.

[@arnabnandy2828]

Excellent explanation

[@hymnish_you]

Cool explanation!!! Bro, I came up with the solution but I am hell lazy to get it implemented. Slept just 4 hours ;( Anyways will try my best next time.

[@codingmohan]

Next time you get the same feeling, make sure to copy-paste DSU code from somewhere (you can use mine if you want :P) and write the core logic :)

[@giraffe4375]

thanks

[@varunmanchanda3972]

Is this Small to Large DSU based question?

[@codingmohan]

Not really. This problem doesn't really depends on that concept. This just exercised DSU to keep track of the connected component.

[@codingwithanonymous890]

I am still having hard time understanding any good blogfor this pls suggest

[@Truysジャ]

Nice explanation sir

[@Heartless-he8km]

dimag ka dahi kar diya bhai aapne.

[@streetcode4284]

Amazing explanation

[@lofibeats2344]

Why you didnot upload maximum and su string solution?

[@codingmohan]

Do you want me to record it? I looked at it after 20 mins into the contest and already 6K+ people had solved it. So, haven't uploaded it. I can upload it if you feel that I can add some value. Let me know :)

[@lofibeats2344]

@@codingmohan yes this type of problems are coming frequently in recent contest.

[@jaddajaswanthkumar1164]

Superb explanation bro

[@shubhankarnath7573]

This solution is really really awesome bro , nice thought 😎🔥

[@karannnful]

time complexity?

[@rohit9003]

This is my first time watching your video and i understood it in one go , gg great explanation !!!

[@prafullprajapati3643]

good explaination

[@mohdaasimqureshi7115]

Great Explanation 👏👏👏

[@SHREYANSHSHARMA-y9o]

big Fan sir

[@XxelitebeautyxX]

Amazing work!

[@laxmikanthreddy4393]

Excellent explanation bro . Keep posting you will definitely gonna reach large number of audience

[@codingmohan]

Thank you so much 🙂

[@aayush5474]

excellent explanation. Subscribed

[@devendrapatil07]

op🔥

[@TusharKumar-u4p]

Google OA

[@_MS98]

Thanks

[@SDE-wq4tl]

amazing explanation