MAXIMAL NETWORK RANK | LEETCODE # 1615 | PYTHON GRAPH SOLUTION

[@isma5627]

Wow, what a nice explanation and simple code! Thanks for the video!!

[@xylo5750]

In case anyone is wondering, you can literally just do this instead of itertools.combinations: for i in range(n): for j in range(i, n): ...

[@tallerdenyooh]

Just some honest constructive criticism (hope you don't get offended). Not explaining how to implement the combinations or the logic behind that and just going with python's library isn't going to fly in interviews. Unless you're only trying to target experienced/advanced developers, implementing the logic of itertools.combinations doesn't feel that straight forward when they're seeing this problem for the first time. Other than that, you're well spoken which makes your explanation easy to follow and understand

[@symbol767]

Thank you for going over this problem, I got this on a Microsoft OA recently and was lost on this problem.....

[@crackfaang]

Hope it's not too late to answer it haha

[@symbol767]

@@crackfaang I still managed to pass the OA somehow lol

[@rsKayiira]

Amazing video. Honestly unbelievable content.

[@crackfaang]

Thank you for the kind words. Glad you are getting value from the content

[@ramizrizwan3057]

such a great explanation!

[@tabmax22]

what if the graph is disconnected?

[@m3633444]

Can you please use C++ or Java, not python please?

[@crackfaang]

No unfortunately not. Python is my primary language and I have 0 experience with C++ or Java.

[@rsKayiira]

Python is the best for programming interviews