3419. Minimize the Maximum Edge Weight of Graph | Graph | Binary Search | BFS

[@katurivinay3436]

Explanation is top notch ❤❤❤❤❤❤

[@manthansharma6769]

I solved this using Prims Algo , but kudos to this one too !

[@ayaaniqbal3531]

Very Helpful Video .

[@JazzBrown-ym8ku]

Thank you for the video, the threshold had me stumped during the contest.

[@hari-codes]

Good Explaination!

[@kbcoder3734]

I solved only 1/4 in today's contest.

[@harsh_dhakad_Gamer]

Same here
But one day I able to solve 4 questions by myself

[@kbcoder3734]

@harsh_dhakad_Gamer yea, you will if you are consistent.

[@ojasvikumar2137]

Loved it !!

[@primexmystic9405]

Thank you

[@nikhilprakash729]

😊😊

[@ayaaniqbal3531]

bro i was able to solve first 2 problems.

[@monsuruokuniyi1234]

Once I saw this problem, I didn't even attempt. I spent like 5-10 mins trying to reason it out but couldn't. Lol. So I moved on the "hard" one, which I could still reason out

[@Its_Shubham_Negi]

The Best 🔥

[@prajapati-suraj]

best explanation is there any other method to solve this question....................

[@Jazzimus]

prim's minimum spanning tree is technically a faster solution than this.

[@SachinKumar-wo1xp]

Thanks

[@shatulbansal4756]

Bro, I tried your solution, 670/671 test cases are running fine on LC using this solution.
For the last test case, its giving TLE using your solution 🙃

[@Piyanshu-d5x]

same issue here ! though i was using c++

[@shatulbansal4756]

@@Piyanshu-d5x I also used C++

[@raunakagarwal8284]

2/4

[@shredder_plays713]

4th question please

[@amankrsingh]

It was easy questions but threshold one was confusing, why they have given this 😏

[@pinakvyas1779]

you didnt even used threshold conditions ,, even though leetcode 700 test cases didnt had a single case where threshold will be challenged. but your code has flaw

[@pinakvyas1779]

why error is coming
class Solution {
public:
void addEdge(int u , int v , list* &revl){ // u----v
// directed
revl[u].push_back(v);
}
bool isposs(int n ,vector& edges , int maxwt ){
list *revl = new list[n];
for(auto e : edges){
if(e[2]