Find All People With Secret | 4 Approaches | Google | Leetcode 2092
258Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 44th Video of our Playlist "Graphs : Popular Interview Problems".
In this video we will try to solve a very good Graph problem asked : Find All People With Secret | Leetcode 2092
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 : Find All People With Secret
Company Tags : Google
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/BFS_DFS/Find%20All%20People%20With%20Secret.cpp
Leetcode Link : https://leetcode.com/problems/find-all-people-with-secret/description
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 :
Approach-1:
Description: The most basic approach uses a map to store meetings at each time, iterates through meetings in increasing order of time, and performs BFS to spread the secret.
Time Complexity (T.C): ~O(M*(M+N)), where M = number of meetings, N = number of people.
Space Complexity (S.C): O(M+N).
Approach-2:
Description: Uses BFS graph traversal, maintains a queue with persons and their respective times, and updates the earliest known secret time for each person.
Time Complexity (T.C): O(M * (M+N)), where M = number of meetings, N = number of people.
Space Complexity (S.C): O(M+N).
Approach-3:
Description: Utilizes DFS graph traversal to update the earliest known secret time for each person. Revisits some nodes with better secret knowing time.
Time Complexity (T.C): O(M * (M+N)), where M = number of meetings, N = number of people.
Space Complexity (S.C): O(M+N).
Approach-4:
Description: Uses a min-heap to fetch the earliest time, updates the earliest known secret time for each person, and maintains a visited set to avoid revisiting.
Time Complexity (T.C): ~O((N+M) * (log(M+N) + M)).
Space Complexity (S.C): O(N+M).
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ Timelines✨
00:00 - Introduction
00:33 - Problem Explanation
06:45 - Approach-1
36:03 - Approach-2
01:04:33 - Approach-3
01:07:47 - Approach-4
#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 #2024 #newyea