Strongly Connected Components | Kosaraju's Algorithm | Intuition | AMAZON | Graph Concepts & Qns- 38

Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=E6DeC0Zpdns



Duration: 38:45
724 views
50


This is the 38th Video on our Graph Concepts Playlist.
Since we already studied Kruskal's Algorithm for Minimum Spanning Tree in video-36. It's time to solve Qns on Kruskal's Algorithm.
Today we will solve a very famous and good problem "Min Cost to Connect All Points" (Leetcode-1584).

If you have been following my "Graph Concepts & Qns" playlist , then these will become very easy.
Make sure to watch from the beginning of this playlist to master graphs in the easiest way possible.

Problem Name : Min Cost to Connect All Points
Company Tags : META
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Min%20Cost%20to%20Connect%20All%20Points.cpp
Leetcode Link : https://leetcode.com/problems/min-cost-to-connect-all-points/


My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips
#interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook




Other Videos By codestorywithMIK


2023-07-29Soup Servings | INTUITIVE | Recursion | Memoization | GOOGLE | Leetcode-808
2023-07-27Predict the Winner | Two Recursive Approaches | Memoization | Game Strategy | AMAZON | Leetcode-486
2023-07-27No One Can Fu***ng Stop You 🔥🔥🔥 #coding #motivation #hardwork #reels #youtubeshorts #dontgiveup
2023-07-27Maximum Running Time of N Computers | Binary Search | INTUITION | Dry Run | GOOGLE | Leetcode-2141
2023-07-25Minimum Speed to Arrive on Time | Binary Search | INTUITION | Online Assessment | Leetcode-1870
2023-07-24Peak Index in a Mountain Array | Binary Search | DRY RUN | GOOGLE | Leetcode-852
2023-07-24Thank you from the bottom of my heart ❤️ #consistency #bonding #friends #friendship #trust
2023-07-23Pow(x, n) | Reasoning | Dry Run | LINKEDIN | AMAZON | Leetcode-50 | Live Code + Explanation
2023-07-23All Possible Full Binary Trees | Recursion Tree | Memoization | GOOGLE | AMAZON | Leetcode-894
2023-07-21Knight Probability in Chessboard | Recursion | Memoization | AMAZON | DIRECTi | Leetcode-688
2023-07-21Strongly Connected Components | Kosaraju's Algorithm | Intuition | AMAZON | Graph Concepts & Qns- 38
2023-07-21Number of Longest Increasing Subsequence | Using LIS | Full Dry Run | META | Leetcode-673
2023-07-20Asteroid Collision | Intuition | Dry Run | Leetcode-735 | Uber | Lyft | Explanation ➕ Live Coding
2023-07-19Min Cost to Connect All Points | Kruskal's Algorithm | Graph Concepts & Qns - 37 | Leetcode-1584
2023-07-18Non-overlapping Intervals | 2 Approaches | Intuition | Dry Run | Leetcode-435 | GOOGLE | Explanation
2023-07-18Kruskal's Algorithm | Minimum Spanning Tree | Full Dry Run | INTUITION | Graph Concepts & Qns - 36
2023-07-18Thank you for the Trust - 6000 Subscribers #coding #leetcode #interviewpreparation #intuition
2023-07-17Maximum Alternating Subsequence Sum | BOTTOM UP | INTUITION | DP Concepts & Qns - 10 | Leetcode-1911
2023-07-16Add Two Numbers II | Follow Up Qn Also | 2 Approaches | AMAZON | MICROSOFT | Leetcode-445
2023-07-16Min Cost to Connect All Points | Prim's Algorithm | META | Graph Concepts & Qns - 35 | Leetcode-1584
2023-07-16Smallest Sufficient Team | Recur + Memo | Bit Manipulation Made Easy | AMAZON | Leetcode-1125