Euler Path | Euler Circuit | PART-2 | Graph Concepts & Qns - 41 | Explanation + Code

Whatsapp Community Link : www.whatsapp.c...
Hi Everyone, this is the 41st video of our Playlist "Graph Concepts & Qns".
This is one of the very popular topics in Graph as well as a very important topic in Graph.
We had already studied Euler Path/Circuit theory in video-40 of this playlist.
This is Part-2 of the Euler series where we will solve Qn on "Detecting Euler Path/Circuit" in an Undirected Graph.
Problem Name : Euler Path | Euler Circuit | PART-2
Topic : Graph
Video : 41
Company Tags : GOOGLE (Variation asked with a Qn)
My DP Concepts Playlist : • Roadmap for DP | How t...
My Graph Concepts Playlist : • Graph Concepts & Qns -...
My GitHub Repo for interview preparation : github.com/MAZ...
Subscribe to my channel : / @codestorywithmik
Instagram : / codestorywithmik
Facebook : / 100090524295846
Twitter : / cswithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#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

[@newglobal2056]

0:42 maharshi movie dialogue one of best movie i have seen..

[@Chatbotwallah]

Completed whole playlist Thanks for making this amazing playlist

[@saurabhKumar-hj6yp]

successfully completed the graph playlist and learned a lot Thank you so much for such excellent content.❤❤

[@codestorywithMIK]

So glad to hear that.
Thank you so much.
More Graph videos coming soon 😇❤️🙏

[@SHIVAMKUMAR-tg6bh]

@@codestorywithMIK when you will post the next graph concept playlist....??

[@manibhushankumarsingh5196]

00:02 Detecting Euler Path and Circuit in Graphs
02:10 Euler Path covers all edges once, Euler Circuit does not
04:23 In Euler path and circuit, there are specific rules for the degree of vertices.
06:57 Understanding Euler Path and Euler Circuit
09:09 Determining Euler path or circuit based on vertex degrees
11:29 Non-zero degree vertices must be connected
13:53 Importance of graph connectivity for Euler path
15:48 Checking for Euler circuit or Euler path in an undirected graph
18:07 Understanding DFS and connectivity check
20:10 Explanation of determining odd degree vertices
22:36 In Euler circuit, odd degree count should be zero due to even degrees of all vertices.

[@manibhushankumarsingh5196]

Thanks bhaiya. Now, I have completed my DSA . After taking a paid course I have done backtracking, trie, bit manipulation, segment tree and graph from you.

[@CodeZipper12]

Bro please complete this graph playlist bcz I’m gaining confidence in graph

[@Love-xs9mk]

completed the entire series.....finally.
thanks to you man🙌🙌🙌🙌

[@priyajaiwal8072]

Banger Playlist.Moving on to next. Wishing your channel explodes soon.🫶

[@lofireverbz-wy7go]

i have started graph playlist on 1st jan and now after a month i have finished graph playlist fully giving 1 hour daily for graphs consistently , and bhaiaya i can,t describe that now i am feeling too confident on graphs and similar questions to it. its all because of you bhaiya and the pattern by which you taught in sequence ,
love the way of your teaching style bhaiya
consitency is the key!!!!!❤❤❤❤

[@codestorywithMIK]

So happy to hear this
Thank you ❤️❤️

[@SudhanshuSingh-jn2lw]

Completed the playlist and understood every word u said . Thank you for the series. This was the best playlist I have ever watched . Thanks again bhaiya :)

[@dchennaraidu]

LEGEND!

[@chiragsharma8905]

Sir, please continue this series. Few important topics are left, as you replied in one of the comments. Thank you so much.

[@anujkumar-pb6eb]

Completed. Thanks MIK

[@AnjuGupta-sz1uk]

Finally completed this playlist and learnt lot of things from this and gained confidence to solve graph based problems...Thanku so much Bhaiya for such a wonderful content

[@codestorywithMIK]

Most welcome 🙏😇

[@indiann871]

Thanks!!
Now they are looking for disconnected componenets too in the test cases.

[@solosanskar490]

revisited graphs using this playlist in two days , thanks mik boss .

[@DK-hn9or]

Completed the entire series. Thanks a lot😇😊

[@sauravfarkade1928]

Thanks bhaiya

[@ashyy346]

I have completed this playlist in 7 days, and so far the besttt. Understand the concepts here, revise, and practice, and you will be good to go. Thank you so much sir for the great content!

[@codestorywithMIK]

😇😇❤️❤️😇🙏

[@nerduser1000]

damn quick

[@PradeepKumarIIITD]

completed today!!! amazing videos and motivation :)

[@AmarjeetKumar-to9ub]

completed 41/41 ✅
Thank You Sir :)

[@codestorywithMIK]

Congratulations 🙌
I will soon plan to post some more videos in this playlist ❤️

[@divyam-hx3ie]

completed the playlist ✅✅✅✅✅✅✅✅✅✅

[@sahebraojadhav-gq2ew]

Finally graph ke end PR aa gya

[@sanjaykatta6499]

Bro, thank you so much for this playlist, I am able to solve most of the questions by myself.
Please do cover the rest of the concepts like Bridges in graph etc.

[@rakeshranjan5071]

Watched all the videos thanks a lot MIk boss. 😊

[@ashwaniarchivee]

Thanks Mik

[@souravjoshi2293]

Thank you so much bhai.

[@tutuimam3381]

Amazing ❤❤

[@wearevacationuncoverers]

Wow. Thanks a lot man.

[@HealthyOm]

we want much more concepts vedios bhaiay love u 😘😘😘😘🥰

[@sumitgupta310]

41/41 done !!!!!!!

[@gauravbanerjee2898]

Bhaiya please tarjan's algorithm pe ek video 🥺🥺banado, usse playlist complete ho jayegi and
Uss algo se bridges and articulation points in a graph wale questions bhi ho jayenge easily
Please bhaiya it's a humble request

[@SHIVAMOJHA21]

suppose there are 6 vertices in a graph , and 5 vertices are connected in one component and one single vertex makes another component. then it should make an euler path, right? that's what you were explaining in the first half but in the code you said disconnected graph cannot make an euler path???? please explain

[@DevOpskagyaan]

Thank you so much

[@infinitygaming7192]

mast

[@ConvxO2]

Pls make a video on bridges and articulation points

[@narendramodigodsegodseHU]

done dan dana done ,,,,,,, completed brahhhhhhhhh

[@kartikforwork]

sir, please tell what are the remaining topic we need to cover, so that in mean time we can learn them from other sources..

[@thefinalfit]

Thanks

[@devkumar9889]

Next video kab ayegi ?

[@sahebraojadhav-gq2ew]

Bhai please streak mat tutne do graph series continue karo

[@narendramodigodsegodseHU]

Nitish Prasad Kushwaha ka done ho gyaa brahhhhhhhhh

[@dibbodas4116]

in isConnected function why do we have to check the adj[i].size() ?? if any node is not visited cant we directly tell false?

[@indiann871]

for node with zero degree, we can't directly tell false.

[@abcd76820]

DONE

[@Abhishek-sf9ux]

now in gfg without checking isconnected it will not work they have updated their test cases

[@akmarkan2490]

How many topics remain Sir??

[@Shakib.Siddiqui]

@codestorywithmik All basics covered till here ??

[@anish.naruto]

Thanks for this amazing playlist, really you made the visual understandings of the concepts very clear for me.
one request, it would be great if u can make videos on concepts like Red-black trees, binomial trees, fibonacci heaps in early future, it will help me a lot.
Love from IIT DELHI. (PS- I am also from Jharkhand 🙃)

[@codestorywithMIK]

❤️❤️❤️😇😇😇
I will soon find some time to make those videos

[@shubhamjaiswal7645]

question ka link de deya kareye sir

[@himanshigoel7510]

Sir, Is concepts playlist complete ?

[@codestorywithMIK]

Few more advanced topic videos are left.
Will soon come.
More or less it’s complete