Day-15:
Find the City With the Smallest Number of Neighbors at a Threshold Distance
Leetcode #1334
Algorithm: Floyd Warshall
Floyd Warshall Algo Explained: https://youtu.be/nV_wOZnhbog
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Find the City With the Smallest Number of Neighbors at a Threshold Distance
Leetcode #1334
Algorithm: Floyd Warshall
Floyd Warshall Algo Explained: https://youtu.be/nV_wOZnhbog
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Find the City With the Smallest Number of Neighbors at a Threshold Distance - LeetCode
Can you solve this real interview question? Find the City With the Smallest Number of Neighbors at a Threshold Distance - There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and…
Day-15: (Solution)
Find the City With the Smallest Number of Neighbors at a Threshold Distance
Leetcode #1334
Algorithm: Floyd Warshall
Floyd Warshall Algo Explained: https://youtu.be/nV_wOZnhbog
Solution CODE: https://gist.github.com/SuryaPratapK/110cf5701e084dd70314cd147f241ee2
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Find the City With the Smallest Number of Neighbors at a Threshold Distance
Leetcode #1334
Algorithm: Floyd Warshall
Floyd Warshall Algo Explained: https://youtu.be/nV_wOZnhbog
Solution CODE: https://gist.github.com/SuryaPratapK/110cf5701e084dd70314cd147f241ee2
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Find the City With the Smallest Number of Neighbors at a Threshold Distance - LeetCode
Can you solve this real interview question? Find the City With the Smallest Number of Neighbors at a Threshold Distance - There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and…
Day-16:
Min Cost to Connect All Points
Leetcode #1584
Algorithm: Prims/Kruskals MST (Minimum Spanning Tree)
Prims MST Algo Explained: https://youtu.be/xthRL0lcx2w
Kruskal’s MST Algo Explained: https://youtu.be/_Iz-QLBGKpM
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Min Cost to Connect All Points
Leetcode #1584
Algorithm: Prims/Kruskals MST (Minimum Spanning Tree)
Prims MST Algo Explained: https://youtu.be/xthRL0lcx2w
Kruskal’s MST Algo Explained: https://youtu.be/_Iz-QLBGKpM
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Min Cost to Connect All Points - LeetCode
Can you solve this real interview question? Min Cost to Connect All Points - You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi].
The cost of connecting two points [xi, yi] and [xj, yj]…
The cost of connecting two points [xi, yi] and [xj, yj]…
Day-16: (Solution)
Min Cost to Connect All Points
Leetcode #1584
Algorithm: Prims/Kruskals MST (Minimum Spanning Tree)
Prims MST Algo Explained: https://youtu.be/xthRL0lcx2w
Kruskal’s MST Algo Explained: https://youtu.be/_Iz-QLBGKpM
Solution CODE: https://gist.github.com/SuryaPratapK/9fc73aa84c70ba77bb00bae3b18f2bfb
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Min Cost to Connect All Points
Leetcode #1584
Algorithm: Prims/Kruskals MST (Minimum Spanning Tree)
Prims MST Algo Explained: https://youtu.be/xthRL0lcx2w
Kruskal’s MST Algo Explained: https://youtu.be/_Iz-QLBGKpM
Solution CODE: https://gist.github.com/SuryaPratapK/9fc73aa84c70ba77bb00bae3b18f2bfb
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Min Cost to Connect All Points - LeetCode
Can you solve this real interview question? Min Cost to Connect All Points - You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi].
The cost of connecting two points [xi, yi] and [xj, yj]…
The cost of connecting two points [xi, yi] and [xj, yj]…
Day-17:
Number of Connected Components in an Undirected Graph
Leetcode #323
Algorithm: Disjoint Set Data Structure
Disjoint Set VIDEO: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by RANK & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Number of Connected Components in an Undirected Graph
Leetcode #323
Algorithm: Disjoint Set Data Structure
Disjoint Set VIDEO: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by RANK & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Number of Connected Components in an Undirected Graph - LeetCode
Can you solve this real interview question? Number of Connected Components in an Undirected Graph - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
Day-17: (solution)
Number of Connected Components in an Undirected Graph
Leetcode #323
Algorithm: Disjoint Set Data Structure
Disjoint Set VIDEO: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by RANK & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/07f8c291631e2a39f374bfa922c4e90a
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Number of Connected Components in an Undirected Graph
Leetcode #323
Algorithm: Disjoint Set Data Structure
Disjoint Set VIDEO: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by RANK & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/07f8c291631e2a39f374bfa922c4e90a
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Number of Connected Components in an Undirected Graph - LeetCode
Can you solve this real interview question? Number of Connected Components in an Undirected Graph - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
Day-18:
Making A Large Island
Leetcode #827
Algorithm: DFS/BFS/Disjoint-Set
Disjoint Set VIDEO: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by RANK & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Making A Large Island
Leetcode #827
Algorithm: DFS/BFS/Disjoint-Set
Disjoint Set VIDEO: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by RANK & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Making A Large Island - LeetCode
Can you solve this real interview question? Making A Large Island - You are given an n x n binary matrix grid. You are allowed to change at most one 0 to be 1.
Return the size of the largest island in grid after applying this operation.
An island is a 4…
Return the size of the largest island in grid after applying this operation.
An island is a 4…
Day-18: (Solution)
Making A Large Island
Leetcode #827
Algorithm: DFS/BFS/Disjoint-Set
Disjoint Set VIDEO: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by RANK & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/ce1fb8d587af4b3b420210373cecece7
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Making A Large Island
Leetcode #827
Algorithm: DFS/BFS/Disjoint-Set
Disjoint Set VIDEO: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by RANK & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/ce1fb8d587af4b3b420210373cecece7
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Making A Large Island - LeetCode
Can you solve this real interview question? Making A Large Island - You are given an n x n binary matrix grid. You are allowed to change at most one 0 to be 1.
Return the size of the largest island in grid after applying this operation.
An island is a 4…
Return the size of the largest island in grid after applying this operation.
An island is a 4…
Day-19:
Minimum Degree of a Connected Trio in a Graph
Leetcode #827
Algorithm: Adjancency Matrix
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Minimum Degree of a Connected Trio in a Graph
Leetcode #827
Algorithm: Adjancency Matrix
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Minimum Degree of a Connected Trio in a Graph - LeetCode
Can you solve this real interview question? Minimum Degree of a Connected Trio in a Graph - You are given an undirected graph. You are given an integer n which is the number of nodes in the graph and an array edges, where each edges[i] = [ui, vi] indicates…
Day-19: (Solution)
Minimum Degree of a Connected Trio in a Graph
Leetcode #827
Algorithm: Adjancency Matrix
Solution CODE: https://gist.github.com/SuryaPratapK/6fc3e5d10ea63fca13c71a57e6fe3c31
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Minimum Degree of a Connected Trio in a Graph
Leetcode #827
Algorithm: Adjancency Matrix
Solution CODE: https://gist.github.com/SuryaPratapK/6fc3e5d10ea63fca13c71a57e6fe3c31
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Minimum Degree of a Connected Trio in a Graph - LeetCode
Can you solve this real interview question? Minimum Degree of a Connected Trio in a Graph - You are given an undirected graph. You are given an integer n which is the number of nodes in the graph and an array edges, where each edges[i] = [ui, vi] indicates…
Day-20:
Couples Holding Hands
Leetcode #765
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Couples Holding Hands
Leetcode #765
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Couples Holding Hands - LeetCode
Can you solve this real interview question? Couples Holding Hands - There are n couples sitting in 2n seats arranged in a row and want to hold hands.
The people and seats are represented by an integer array row where row[i] is the ID of the person sitting…
The people and seats are represented by an integer array row where row[i] is the ID of the person sitting…
Day-20:
Couples Holding Hands
Leetcode #765
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/ea24aa7e0be6200ad2e1a2a9d36b6c5e
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Couples Holding Hands
Leetcode #765
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/ea24aa7e0be6200ad2e1a2a9d36b6c5e
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Couples Holding Hands - LeetCode
Can you solve this real interview question? Couples Holding Hands - There are n couples sitting in 2n seats arranged in a row and want to hold hands.
The people and seats are represented by an integer array row where row[i] is the ID of the person sitting…
The people and seats are represented by an integer array row where row[i] is the ID of the person sitting…
Day-21:
Critical Connections in a Network
Leetcode #1192
Algorithm: Tarjan’s Algo (Bridge)
Tarjan’s algo (Strongly Connected Components): https://youtu.be/ZeDNSeilf-Y
Tarjan’s algo (Articulation Points): https://youtu.be/64KK9K4RpKE
Tarjan’s algo (Bridge): https://youtu.be/Rhxs4k6DyMM
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Critical Connections in a Network
Leetcode #1192
Algorithm: Tarjan’s Algo (Bridge)
Tarjan’s algo (Strongly Connected Components): https://youtu.be/ZeDNSeilf-Y
Tarjan’s algo (Articulation Points): https://youtu.be/64KK9K4RpKE
Tarjan’s algo (Bridge): https://youtu.be/Rhxs4k6DyMM
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Critical Connections in a Network - LeetCode
Can you solve this real interview question? Critical Connections in a Network - There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [ai, bi] represents a connection between…
Day-21: Solution
Critical Connections in a Network
Leetcode #1192
Algorithm: Tarjan’s Algo (Bridge)
Tarjan’s algo (Strongly Connected Components): https://youtu.be/ZeDNSeilf-Y
Tarjan’s algo (Articulation Points): https://youtu.be/64KK9K4RpKE
Tarjan’s algo (Bridge): https://youtu.be/Rhxs4k6DyMM
Solution CODE: https://gist.github.com/SuryaPratapK/66d69e80562b8a802966eb80ff7b224a
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Critical Connections in a Network
Leetcode #1192
Algorithm: Tarjan’s Algo (Bridge)
Tarjan’s algo (Strongly Connected Components): https://youtu.be/ZeDNSeilf-Y
Tarjan’s algo (Articulation Points): https://youtu.be/64KK9K4RpKE
Tarjan’s algo (Bridge): https://youtu.be/Rhxs4k6DyMM
Solution CODE: https://gist.github.com/SuryaPratapK/66d69e80562b8a802966eb80ff7b224a
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Critical Connections in a Network - LeetCode
Can you solve this real interview question? Critical Connections in a Network - There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [ai, bi] represents a connection between…
Day-22:
Connecting Cities With Minimum Cost
Leetcode #1192
Algorithm: Minimum Spanning Tree (MST)
Spanning Tree: https://youtu.be/jMioOe2eTcY
Prims Algo for MST: https://youtu.be/xthRL0lcx2w
Kruskals Algo for MST: https://youtu.be/_Iz-QLBGKpM
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Connecting Cities With Minimum Cost
Leetcode #1192
Algorithm: Minimum Spanning Tree (MST)
Spanning Tree: https://youtu.be/jMioOe2eTcY
Prims Algo for MST: https://youtu.be/xthRL0lcx2w
Kruskals Algo for MST: https://youtu.be/_Iz-QLBGKpM
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Connecting Cities With Minimum Cost - LeetCode
Can you solve this real interview question? Connecting Cities With Minimum Cost - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
Day-22: (Solution)
Connecting Cities With Minimum Cost
Leetcode #1192
Algorithm: Minimum Spanning Tree (MST)
Spanning Tree: https://youtu.be/jMioOe2eTcY
Prims Algo for MST: https://youtu.be/xthRL0lcx2w
Kruskals Algo for MST: https://youtu.be/_Iz-QLBGKpM
Solution CODE: https://gist.github.com/SuryaPratapK/a8f0ae8643d281d34c2829c5842b154f
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Connecting Cities With Minimum Cost
Leetcode #1192
Algorithm: Minimum Spanning Tree (MST)
Spanning Tree: https://youtu.be/jMioOe2eTcY
Prims Algo for MST: https://youtu.be/xthRL0lcx2w
Kruskals Algo for MST: https://youtu.be/_Iz-QLBGKpM
Solution CODE: https://gist.github.com/SuryaPratapK/a8f0ae8643d281d34c2829c5842b154f
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Connecting Cities With Minimum Cost - LeetCode
Can you solve this real interview question? Connecting Cities With Minimum Cost - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
Day-23:
Remove Max Number of Edges to Keep Graph Fully Traversable
Leetcode #1579
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Remove Max Number of Edges to Keep Graph Fully Traversable
Leetcode #1579
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Remove Max Number of Edges to Keep Graph Fully Traversable - LeetCode
Can you solve this real interview question? Remove Max Number of Edges to Keep Graph Fully Traversable - Alice and Bob have an undirected graph of n nodes and three types of edges:
* Type 1: Can be traversed by Alice only.
* Type 2: Can be traversed by…
* Type 1: Can be traversed by Alice only.
* Type 2: Can be traversed by…
Day-23: (Solution)
Remove Max Number of Edges to Keep Graph Fully Traversable
Leetcode #1579
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution: https://gist.github.com/SuryaPratapK/96c9aeff42428d02ac22cd9e1e43f44d
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Remove Max Number of Edges to Keep Graph Fully Traversable
Leetcode #1579
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution: https://gist.github.com/SuryaPratapK/96c9aeff42428d02ac22cd9e1e43f44d
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Remove Max Number of Edges to Keep Graph Fully Traversable - LeetCode
Can you solve this real interview question? Remove Max Number of Edges to Keep Graph Fully Traversable - Alice and Bob have an undirected graph of n nodes and three types of edges:
* Type 1: Can be traversed by Alice only.
* Type 2: Can be traversed by…
* Type 1: Can be traversed by Alice only.
* Type 2: Can be traversed by…
Day-24:
Process Restricted Friend Requests
Leetcode #2076
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
Process Restricted Friend Requests
Leetcode #2076
Algorithm: Disjoint Set
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Please try the problem yourself and watch the video to learn the Algorithm 🙂
Please SHARE this initiative with your friends as well 😀
#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa
LeetCode
Process Restricted Friend Requests - LeetCode
Can you solve this real interview question? Process Restricted Friend Requests - You are given an integer n indicating the number of people in a network. Each person is labeled from 0 to n - 1.
You are also given a 0-indexed 2D integer array restrictions…
You are also given a 0-indexed 2D integer array restrictions…