Prim's Algorithm - Minimum Spanning Tree - Min Cost to Connect all Points - Leetcode 1584 - Python

Published: 12 June 2021
on channel: NeetCode

145,412

2.4k

🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews

🐦 Twitter:   / neetcode1
🥷 Discord:   / discord

🐮 Support the channel:   / neetcode

⭐ BLIND-75 PLAYLIST:    • Two Sum - Leetcode 1 - HashMap - Python
💡 CODING SOLUTIONS:    • Coding Interview Solutions
💡 DYNAMIC PROGRAMMING PLAYLIST:    • House Robber -  Leetcode 198 - Python Dyna...
🌲 TREE PLAYLIST:    • Invert Binary Tree - Depth First Search - ...
💡 GRAPH PLAYLIST:    • Course Schedule - Graph Adjacency List - L...
💡 BACKTRACKING PLAYLIST:    • Word Search - Backtracking - Leetcode 79 -...
💡 LINKED LIST PLAYLIST:    • Reverse Linked List - Iterative AND Recurs...

Problem Link: https://neetcode.io/problems/min-cost...

0:00 - Read the problem
3:44 - Drawing Explanation
16:32 - Coding Explanation

leetcode 1584
This question was identified as an interview question from here: https://github.com/xizhengszhang/Leet...

#prims #algorithm #python
Disclosure: Some of the links above may be affiliate links, from which I may earn a small commission.

On this page of the site you can watch the video online Prim's Algorithm - Minimum Spanning Tree - Min Cost to Connect all Points - Leetcode 1584 - Python with a duration of hours minute second in good quality, which was uploaded by the user NeetCode 12 June 2021, share the link with friends and acquaintances, this video has already been watched 145,412 times on youtube and it was liked by 2.4 thousand viewers. Enjoy your viewing!