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…
Day-24: (Solution)
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
Solution CODE: https://gist.github.com/SuryaPratapK/68ab4a613546e86f71d9f4b63c0ceee4
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
Solution CODE: https://gist.github.com/SuryaPratapK/68ab4a613546e86f71d9f4b63c0ceee4
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…
Day-25:
Max Area of Island
Leetcode #2076
Algorithm: Disjoint Set/ DFS / BFS
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/68ab4a613546e86f71d9f4b63c0ceee4
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
Max Area of Island
Leetcode #2076
Algorithm: Disjoint Set/ DFS / BFS
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/68ab4a613546e86f71d9f4b63c0ceee4
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
Max Area of Island - LeetCode
Can you solve this real interview question? Max Area of Island - You are given an m x n binary matrix grid. An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded…
Day-25: Solution
Max Area of Island
Leetcode #695
Algorithm: Disjoint Set/ DFS / BFS
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/cd2caf844648a355d82a6b1f9d69efaf
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
Max Area of Island
Leetcode #695
Algorithm: Disjoint Set/ DFS / BFS
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/cd2caf844648a355d82a6b1f9d69efaf
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
Max Area of Island - LeetCode
Can you solve this real interview question? Max Area of Island - You are given an m x n binary matrix grid. An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded…
Day-26:
Number of Closed Islands
Leetcode #1254
Algorithm: Disjoint Set/ DFS / BFS
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
Number of Closed Islands
Leetcode #1254
Algorithm: Disjoint Set/ DFS / BFS
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
Number of Closed Islands - LeetCode
Can you solve this real interview question? Number of Closed Islands - Given a 2D grid consists of 0s (land) and 1s (water). An island is a maximal 4-directionally connected group of 0s and a closed island is an island totally (all left, top, right, bottom)…
Day-26: Solution
Number of Closed Islands
Leetcode #1254
Algorithm: Disjoint Set/ DFS / BFS
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/4ea26ccb3d6ca3aafe878bd152f5dfa4
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 Closed Islands
Leetcode #1254
Algorithm: Disjoint Set/ DFS / BFS
Disjoint Set: https://youtu.be/eTaWFhPXPz4
Disjoint Set (Union by Rank & Path Compression): https://youtu.be/kaBX2s3pYO4
Solution CODE: https://gist.github.com/SuryaPratapK/4ea26ccb3d6ca3aafe878bd152f5dfa4
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 Closed Islands - LeetCode
Can you solve this real interview question? Number of Closed Islands - Given a 2D grid consists of 0s (land) and 1s (water). An island is a maximal 4-directionally connected group of 0s and a closed island is an island totally (all left, top, right, bottom)…
Day-27:
Find Eventual Safe States
Leetcode #802
Algorithm: DFS / BFS / Topological Sort
DFS: https://youtu.be/CvUMf8c2JFo
BFS: https://youtu.be/YYq38LTz774
Topological Sort: https://youtu.be/qe_pQCh09yU
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 Eventual Safe States
Leetcode #802
Algorithm: DFS / BFS / Topological Sort
DFS: https://youtu.be/CvUMf8c2JFo
BFS: https://youtu.be/YYq38LTz774
Topological Sort: https://youtu.be/qe_pQCh09yU
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 Eventual Safe States - LeetCode
Can you solve this real interview question? Find Eventual Safe States - There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D integer array graph where graph[i] is an integer array of nodes…
Day-27: (Solution)
Find Eventual Safe States
Leetcode #802
Algorithm: DFS / BFS / Topological Sort
DFS: https://youtu.be/CvUMf8c2JFo
BFS: https://youtu.be/YYq38LTz774
Topological Sort: https://youtu.be/qe_pQCh09yU
Solution CODE: https://gist.github.com/SuryaPratapK/031016cfa97e6aa33d46a7ef6bea147a
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 Eventual Safe States
Leetcode #802
Algorithm: DFS / BFS / Topological Sort
DFS: https://youtu.be/CvUMf8c2JFo
BFS: https://youtu.be/YYq38LTz774
Topological Sort: https://youtu.be/qe_pQCh09yU
Solution CODE: https://gist.github.com/SuryaPratapK/031016cfa97e6aa33d46a7ef6bea147a
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 Eventual Safe States - LeetCode
Can you solve this real interview question? Find Eventual Safe States - There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D integer array graph where graph[i] is an integer array of nodes…
Day-28:
Maximal Network Rank
Leetcode #802
Algorithm: Simple Graph
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
Maximal Network Rank
Leetcode #802
Algorithm: Simple Graph
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
Maximal Network Rank - LeetCode
Can you solve this real interview question? Maximal Network Rank - There is an infrastructure of n cities with some number of roads connecting these cities. Each roads[i] = [ai, bi] indicates that there is a bidirectional road between cities ai and bi.
The…
The…
Day-28: (Solution)
Maximal Network Rank
Leetcode #1615
Algorithm: Simple Graph
Solution CODE: https://gist.github.com/SuryaPratapK/607a4ca794fa607efa9a0ac68bb92ca3
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
Maximal Network Rank
Leetcode #1615
Algorithm: Simple Graph
Solution CODE: https://gist.github.com/SuryaPratapK/607a4ca794fa607efa9a0ac68bb92ca3
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
Maximal Network Rank - LeetCode
Can you solve this real interview question? Maximal Network Rank - There is an infrastructure of n cities with some number of roads connecting these cities. Each roads[i] = [ai, bi] indicates that there is a bidirectional road between cities ai and bi.
The…
The…
Day-29:
Minimum Number of Vertices to Reach All Nodes
Leetcode #1557
Algorithm: Simple Graph
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 Number of Vertices to Reach All Nodes
Leetcode #1557
Algorithm: Simple Graph
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 Number of Vertices to Reach All Nodes - LeetCode
Can you solve this real interview question? Minimum Number of Vertices to Reach All Nodes - Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to…