I am regular solver of Leetcode as I think it helps to build logic even when doing dev work in day to day job and these videos helps whenever I am stuck. Thanks for the dedication of making these videos.🙏
In a directed graph. If all nodes have even indegree & outdegree then Euler circuit exists as well as path. OR if exactly 2 nodes have indegree-Outdegree = 1 then too path exists but no circuit. Also, All edges must be in 1 component in a multi component system. For undirected graph, Please refer my previous video from description link.
Hey! In the end of the video you told the difference between map and unordered_map. But while submitting the code, the opposite is happening i.e. map is giving tle whereas unordered_map is giving pretty good runtime. Can you explain why is that the case? Thank you! Edit: great explanation
I am regular solver of Leetcode as I think it helps to build logic even when doing dev work in day to day job and these videos helps whenever I am stuck. Thanks for the dedication of making these videos.🙏
great :)
30 min video behind seen is lot of hardwork thankyou so much sir
welcome :)
Thanks for detailed explanation ❤
welcome :)
thanku sir ji
Welcome :)
Great explanation. 👏
Thanks :)
Instead of using graph can we directly use maps to find the start and the end node?
still the map will be counting indegree and outdegree.
But Euler path will be required anyhow you try solving.
amazing, sir what is the name of this digital board you use for explaination?
Well explained. Best solution. Clear now, anyways how to check if the euler path exist or not ?
In a directed graph.
If all nodes have even indegree & outdegree then Euler circuit exists as well as path.
OR
if exactly 2 nodes have indegree-Outdegree = 1 then too path exists but no circuit.
Also, All edges must be in 1 component in a multi component system.
For undirected graph, Please refer my previous video from description link.
@@techdose4u Got it. Thank you!
Hey!
In the end of the video you told the difference between map and unordered_map. But while submitting the code, the opposite is happening i.e. map is giving tle whereas unordered_map is giving pretty good runtime. Can you explain why is that the case? Thank you!
Edit: great explanation
Biased test cases :)
@@techdose4u alright :_)
@@techdose4u thank u, I had the same doubt.
Thank you sir :)
welcome :)
awesome thankyou
welcome :)
Tnakyou sir
Welcome :)
Got that batch!!!
:)
Lecture successfully completed on 30/11/2024 🔥🔥
great :)
TLE
Are you inserting element in front instead of push_back to avoid reverse()?
Based on test cases instead of ordered map use unordered map...
@@vikasvoruganti7490 Mine worked tho
try ordered map for guaranteed logN complexity
haha i love you
🖤
Who is deciding the name of this algos? :|
Carl Hierholzer is a German Mathematician :)