8.a) Number of islands || Number of connected components
In this video on graph data structure, I have discussed about graph traversal application problem, which is finding the number of islands in the sea.
The algorithm used is breadth first search, which finds 1 connected component in 1 dfs and the total number of dfs calls is the number of islands.
Dfs video link: https://youtu.be/gHkOhnINlZo
Practice questions:
1) Geeks for Geeks: https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1
Graph playlist: https://www.youtube.com/watch?v=vZc9EM79nGI&list=PLNxqWc8Uj2LTb6VYJG3Kebwift2oaBFvE
Advanced tree concepts: https://www.youtube.com/watch?v=AHRRIZWKGPY&list=PLNxqWc8Uj2LTupAJUeWvWzRTVT9NX36lY
Playlist on binary search tree (bst) data structure:https://www.youtube.com/watch?v=8JoXbQSSV_w&list=PLNxqWc8Uj2LQpbGv6I_HWf0kTj6kMVVwm
Playlist on binary tree data structure: https://www.youtube.com/watch?v=kgAAfIB_358&list=PLNxqWc8Uj2LRbsOlBiPJZAyZpaUwdDepd
SDE Placement Strategy: https://youtu.be/CAUhA2TmfrI
Linkedin: https://www.linkedin.com/in/kashish-mehndiratta/
Instagram: https://www.instagram.com/kashish__mehndiratta1/
I hope you liked my video, do subscribe to my channel to get the updates of my latest uploads.
#graph #datastructure #algorithm #interviewquestions #placement #internship #faang
Видео 8.a) Number of islands || Number of connected components канала Kashish Mehndiratta
The algorithm used is breadth first search, which finds 1 connected component in 1 dfs and the total number of dfs calls is the number of islands.
Dfs video link: https://youtu.be/gHkOhnINlZo
Practice questions:
1) Geeks for Geeks: https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1
Graph playlist: https://www.youtube.com/watch?v=vZc9EM79nGI&list=PLNxqWc8Uj2LTb6VYJG3Kebwift2oaBFvE
Advanced tree concepts: https://www.youtube.com/watch?v=AHRRIZWKGPY&list=PLNxqWc8Uj2LTupAJUeWvWzRTVT9NX36lY
Playlist on binary search tree (bst) data structure:https://www.youtube.com/watch?v=8JoXbQSSV_w&list=PLNxqWc8Uj2LQpbGv6I_HWf0kTj6kMVVwm
Playlist on binary tree data structure: https://www.youtube.com/watch?v=kgAAfIB_358&list=PLNxqWc8Uj2LRbsOlBiPJZAyZpaUwdDepd
SDE Placement Strategy: https://youtu.be/CAUhA2TmfrI
Linkedin: https://www.linkedin.com/in/kashish-mehndiratta/
Instagram: https://www.instagram.com/kashish__mehndiratta1/
I hope you liked my video, do subscribe to my channel to get the updates of my latest uploads.
#graph #datastructure #algorithm #interviewquestions #placement #internship #faang
Видео 8.a) Number of islands || Number of connected components канала Kashish Mehndiratta
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
![12) Multiset and Unordered Multiset || C++ STL || Standard Template Library](https://i.ytimg.com/vi/2OTEoTqvMKQ/default.jpg)
![2 b Maximum and Minimum element in bst || Binary Search Tree](https://i.ytimg.com/vi/hOHOP8F7j6k/default.jpg)
![3.c) Sorted data to balanced bst || Binary Search Tree](https://i.ytimg.com/vi/zsBve4Esf50/default.jpg)
![13) Pair in C++ STL || Standard Template Library](https://i.ytimg.com/vi/Nh6DXLblzuQ/default.jpg)
![1) Templates in C++ || C++ STL || Standard Template Library](https://i.ytimg.com/vi/tbz_YN8qkbY/default.jpg)
![5) Algorithms in C++ STL || Standard Template Library](https://i.ytimg.com/vi/mbaLM1g_fAM/default.jpg)
![Disjoint Set Union || Union by rank and path compression](https://i.ytimg.com/vi/9Sq1dL1okJg/default.jpg)
![17) Challenges || C++ STL || Standard Template Library](https://i.ytimg.com/vi/rZ0Xo1QBldA/default.jpg)
![7.b) Closest element in bst || Binary Search Tree || Data Structure](https://i.ytimg.com/vi/G5iLdUn2p0g/default.jpg)
![5.d) Coin Change 1, Coin Change 2 || Unbounded knapsack](https://i.ytimg.com/vi/IvFWG6WB6Mw/default.jpg)
![11) Set and Unordered Set || C++ STL || Standard Template Library](https://i.ytimg.com/vi/XqM6NPymCX4/default.jpg)
![9) Stack and Queue || C++ STL || Standard Template Library](https://i.ytimg.com/vi/HLYfKhSiQM8/default.jpg)
![7) Forward List || C++ STL || Standard Template Library](https://i.ytimg.com/vi/ZNBOMVQqQno/default.jpg)
![3) Contents of C++ STL || C++ STL || Standard Template Library](https://i.ytimg.com/vi/0lbQKr27QqU/default.jpg)
![5.c) Unbounded knapsack || Knapsack with duplicate items](https://i.ytimg.com/vi/p1quBPmM3_k/default.jpg)
![7.d) K distance nodes from root in binary tree | Root to kth node in binary tree](https://i.ytimg.com/vi/MqOoC_w4TcY/default.jpg)
![3.d) BST to tree with sum of smaller keys || Binary Search Tree](https://i.ytimg.com/vi/ELEsM9oR8_A/default.jpg)
![10) Word Boggle || Backtracking](https://i.ytimg.com/vi/TURfqTmD8UQ/default.jpg)
![9.b) Best time to buy and sell stocks 2 || Leetcode](https://i.ytimg.com/vi/1ZjFvzt3Knw/default.jpg)
![2.a) Breadth First Search || Bfs || Graph traversals](https://i.ytimg.com/vi/7VlwS1XRStY/default.jpg)
![9.a) Best time to buy and sell stock || Leetcode](https://i.ytimg.com/vi/y7GCr5Bk2kY/default.jpg)