Graph Concepts & Qns - 5 (Miscoroft, Amazon, Flipkart.) : Detect Cycle in Undirected Graph using BFS

  Рет қаралды 14,697

codestorywithMIK

codestorywithMIK

Күн бұрын

Пікірлер: 31
@souravjoshi2293
@souravjoshi2293 Жыл бұрын
Thanks a lot man for listening to our requests. You will go far
@ankitsingh6624
@ankitsingh6624 Жыл бұрын
4th time revise graph everytime respect increase for sir 📈📈
@codestorywithMIK
@codestorywithMIK Жыл бұрын
4th Time 🔥🔥🔥 Hats off. Thank you so much for watching 🙏🙏🙏
@arunsharma4792
@arunsharma4792 Жыл бұрын
Ek no🔥
@codestorywithMIK
@codestorywithMIK Жыл бұрын
Thanks a lot Arun ❤️❤️
@gauravbanerjee2898
@gauravbanerjee2898 Жыл бұрын
5/40 done ✅ thanks a lot bhaiya🙌
@parasjain4-yearb.tech.mech441
@parasjain4-yearb.tech.mech441 27 күн бұрын
Dhanyawad Bhai
@kashishkashyap6229
@kashishkashyap6229 Жыл бұрын
great way of explaining 🔥 thanks alot
@codestorywithMIK
@codestorywithMIK Жыл бұрын
Thank you for watching 😇🙏
@tanujasharma1262
@tanujasharma1262 2 ай бұрын
you made it look easy, thanks
@wearevacationuncoverers
@wearevacationuncoverers Жыл бұрын
Top notch
@aatish5375
@aatish5375 Жыл бұрын
Thanku Bhaiya...❤
@codestorywithMIK
@codestorywithMIK Жыл бұрын
❤️❤️❤️
@MohitSingh-pp4ed
@MohitSingh-pp4ed Жыл бұрын
Can you please share link to these notes you are making to help us understand ? Wonderful series of graph, enjoying graphs for the very first time. Thank you for the excellent content and hats off the way you explain everything.
@codestorywithMIK
@codestorywithMIK Жыл бұрын
Hi Mohit, first of all thank you so much for your kind words. Regarding notes , i have maintained then in my Github repo (link in the description) but currently don’t have written pdf notes. I might create one in future and share Thanks again ❤️❤️❤️
@MohitSingh-pp4ed
@MohitSingh-pp4ed Жыл бұрын
@@codestorywithMIK By notes I meant is the pdf of the ipad notes made on notes app which you are streaming in the video.
@codestorywithMIK
@codestorywithMIK Жыл бұрын
I see. I never made it. Will make it in a consolidated pdf and share soon
@MohitSingh-pp4ed
@MohitSingh-pp4ed Жыл бұрын
@@codestorywithMIK That would be really helpful. Looking forward to it. Thank you so v much again for creating this channel and everything. Can't express enough thanks. Keep creating more content. Loving all the videos.
@codestorywithMIK
@codestorywithMIK Жыл бұрын
Thanks a lot Mohit. I would also suggest you to maintain a Github repo where you store all these code. It helped me a lot in revision and will definitely help all of you. One important thing is that i will be on an emergency travelling streak for 3 weeks in February and will be back with more contents. Stay connected and it’s a promise, this channel will never disappoint.
@jagadeeshp1163
@jagadeeshp1163 10 ай бұрын
Done✅
@nityabudhraja2660
@nityabudhraja2660 6 ай бұрын
I never get it where to use BFS or DFS.IF I get to know that will be very helpful
@apurav363
@apurav363 4 ай бұрын
🙏👍
@deepakdass4710
@deepakdass4710 11 ай бұрын
Graph count = 5
@KaushikkrSarma
@KaushikkrSarma Ай бұрын
same code python me TLE deta he , esa kyu ?
@oqant0424
@oqant0424 Жыл бұрын
5/40 done [22.9.23]
@codestorywithMIK
@codestorywithMIK Жыл бұрын
This weekend coming another video in this playlist. Keep it up ❤️❤️❤️
@jagadeeshp1163
@jagadeeshp1163 10 ай бұрын
from typing import List class Solution: #Function to detect cycle in an undirected graph. def bfs(self,source,adj,visited): q=[] q.append([source,-1]) visited[source]=True while(q): for i in range(len(q)): [t,p]=q.pop(0) for u in adj[t]: if visited[u]==True and u!=p: return True if u!=p: visited[u]=True q.append([u,t]) return False def isCycle(self, V: int, adj: List[List[int]]) -> bool: visited=[0 for i in range(V)] for i in range(V): if visited[i]==False: if self.bfs(i,adj,visited): return True return False
@akshitabansal118
@akshitabansal118 3 ай бұрын
miscoroft
Long Nails 💅🏻 #shorts
00:50
Mr DegrEE
Рет қаралды 17 МЛН
УДИВИЛ ВСЕХ СВОИМ УХОДОМ!😳 #shorts
00:49
HARD_MMA
Рет қаралды 3,7 МЛН
Lecture 88: Cycle Detection in Undirected Graphs || Using BFS and DFS
32:03
CodeHelp - by Babbar
Рет қаралды 146 М.
G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java
19:10
G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java
20:19
G-19. Detect cycle in a directed graph using DFS | Java | C++
17:22
take U forward
Рет қаралды 252 М.
Top 5 Most Common Graph Algorithms for Coding Interviews
13:01
Long Nails 💅🏻 #shorts
00:50
Mr DegrEE
Рет қаралды 17 МЛН