Number of Possible Sets of Closing Branches | Intuition | Leetcode-2959 | Bi-Weekly Contest 119
63Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 41st Video of our Playlist "Graphs : Popular Interview Problems"
In this video we will try to solve a very good problem based on Floyd Warshall Algorithm - Number of Possible Sets of Closing Branches (Leetcode - 2959).
Asked on 9th Dec, 2023 in Leetcode Bi-Weekly Contest 119
I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.
Problem Name : Number of Possible Sets of Closing Branches
Company Tags : Will soon update
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Floyd%20Warshall/Number%20of%20Possible%20Sets%20of%20Closing%20Branches.cpp
Leetcode Link : https://leetcode.com/problems/number-of-possible-sets-of-closing-branches
My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
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
Approach Summary :
The function uses a brute-force approach, iterating through all possible subsets of nodes and checking if they form a valid set. The algorithm employs the Floyd-Warshall algorithm to find the shortest paths between nodes in the graph. The validity of a subset is determined by ensuring that the maximum distance between any two connected nodes in the subset does not exceed the specified maxDistance. The function returns the total number of valid sets found.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ Timelines✨
00:00 - Introduction
#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 #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa