Day 13,14,15/180
Here's the information you might want to know...
This is Day 13,14 &15/180 of starting my interview preparations. Also feel free to DM me in case you have any queries. And I am uploading the python solution of these graph questions on my GitHub, the link to which is in my bio.
In the past few days, I covered the basic representation of Graph.
Then I learned about connected components.
Understood BFS and DFS algorithm.
And using these algorithm and taking help from Takeuforward youtube videos
I was able to solve:
Number of provinces (leetcode)
Connected Components Problem in Matrix
Rotten Oranges
Flood fill Algorithm
Cycle Detection in undirected Graph (bfs)
Cycle Detection in undirected Graph (dfs)
0/1 Matrix (Bfs Problem)
Surrounded Regions (dfs)
I will keep posting my entire journey. So don’t miss out...
Follow my insta I’d to stay updated 😇
Until then Happy coding 😇
DM for any queries 😇
(180days challenge, python, Trees, DSA, Data structures and algorithms, interview preparations, OOPs, coding, Python, DBMS)
#180day #180daysofcode #180dayschallenge #day4
#day5 #interview #interviewtips #interviewprep #interviewpreparation #python #pythonprogramming #coding #codinglife