Oliver and the Game | Euler Tour Concept | Graph | [CODE + Explaination] | HackerEarth | Amazon 🔥🔥

#graph #competitiveprogramming #coding #dsa
Hey Guys in this video I have explained with code how we can solve the problem 'Oliver and the Game'.
Code Link = ideone.com/12xDFL
Join our Telegram Channel for more Information
🔰 Telegram Channel Link = t.me/CodeLibrary1
🔰 Array question Playlist = • Love Babbar DSA 450 Qu...
🔰 String question Playlist = • Love Babbar DSA 450 Qu...
🔰 Searching and Sorting question Playlist = • Love Babbar DSA 450 Qu...
🔰 Binary Tree question Playlist = • Love Babbar DSA 450 Qu...
🔰 Dynamic Programming question Playlist = • Love Babbar DSA 450 Qu...
🔰 RoadMap of Web Development = • 🔴 Web Development Road...
🔰 Roadmap for Dynamic Programming = • Complete Roadmap for D...
🔰 Great Strategy to solve DSA = • Great Strategy to solv...
🔰 My Journey to 5 star at codechef = • My Journey to 5 Star a...
🔰 Love Babbar DSA Sheet : drive.google.c...
Follow us on Instagram:
🔰 Shailesh Yogendra : / shaileshyogendra
🔰 Yogesh Yogendra : / i_am_yogesh_here
Follow us on LinkedIn:
🔰 Yogesh Yogendra : / yogesh-yogendra-26bbb518a
🔰 Shailesh Yogendra : / shailesh-yogendra-8b13...
Hope you like it. Comment if you have any doubt
LIKE | SHARE | SUBSCRIBE

[@aritralahiri8321]

Very beautifully explained ! Thanks a lot. Keep providing the good work.

[@renishabhuva7928]

You are checking that x lies in subtree of y and y lies in subtree of x ... Both needs to be true !! This is not possible.
Even you can neglect that condition, then also soln will accept

[@rounakbhatia5995]

++

[@raviashwin1157]

Bhai tu kitna mast kaam kar raha hai👏🏼

[@itsjaypatel]

Amazing yaar 🔥🔥salute to you👍🏻

[@snehabaser3155]

Getting tle in last 2 cases even after using fast io?

[@sahil.rajput2000]

use sacnf and printf instead of cin and cout

[@shreyasri4774]

i literally hit the like button 10times. I wish all them were counted! You made the ques so easy. Bless you :)

[@AllRounder-jt1pe]

i hitted like button 21 times.

[@tusharpathade2557]

It will count to 0. You should've hit it odd no. Of times. 😅😂.
Commented Just for fun. 🙂

[@krishnapalpanwar8280]

very beautifully explained!

[@ankushsharma1772]

Sir,graph aur linked list me se pehle koi ek complete do taaki continuous flow bna rhe topic ka.Complete graph first(mostly done) then complete linked list.

[@sanjayyadav-vu3cd]

Yaar galat code kyu likhte ho yaar intime out time kuch banaya he nahi aise he submit b ho gya wahh

[@prajitbanerjee8226]

can you tell me where is it wrong?

[@Raghav_362]

but why not use visited while doing dfs plz tell?

[@sujoyseal195]

We use visited while doing DFS on graph . Because in graph , due to existence of cycle there is a possibility that we can reach a node twice . In tree, there are no cycles so we will never revisit a node . In the given question, this is a tree .

[@ANKITCHAUHAN-do2ug]

@@sujoyseal195 how can u say it will always form a tree ?

[@aviral4080]

Bhaiya Apne DSA exactly konse course sei sikha tha...pls bata dijiye . Kya Aapne coding ninjas wagera Ka course kaara tha ?

[@preritagrawal2094]

bro ur this approach is partially correct it is not getting accepted tle for some test cases , i tried running your code too it fails

[@sahil.rajput2000]

take input and output in C language format use scanf and printf instead of cin cout, you will get AC even hackerEarth editorial used this

[@rounakbhatia5995]

ios_base::sync_with_stdio(false);
cin.tie(NULL);
add these lines in the main before taking inputs

[@SaadKasu]

Very good explanation brother. 1 question : how did you know in the first place that the form of connection was a tree structure like why can't we have any connection before 1 because I read the question and was not able to find it. It says unique path but does that mean a tree structure ?

[@AbhishekMishra-me4mu]

Yes! In a tree every pair of node should contain exactly one path between them.

[@saurabhmishra8411]

abhi to iss aproach se tle aa raha last ke do test cases me

[@harshit23]

same bhai.. kch change kiya ab tumne uske liye?

[@shubhamsood1406]

// to avoid TLE write these lines in your main()
ios::sync_with_stdio(0);
cin.tie(0);

[@chiragtejwani1803]

@@shubhamsood1406 thanks brother

[@gamingbar3881]

@@shubhamsood1406 Still I am getting TLE after adding this..

[@vikasupadhyay7916]

thanks bhai, this actually worked :)

[@tech_wizard9315]

When will you announce gievway results of Amazon SDE

[@ayushasthana4886]

The solution is not able to pass all the test cases .... plz look into it and pin a probable solution to this...it would save a lot of time P.S it seems there is some problem with the judge for it would pass a test case one but would show TLE the next though there is no randomness in the algo🙏.

[@dochimekashiariri7610]

thanks a lot

[@shreyashachoudhary480]

Amazing!

[@dakshdagariya2692]

good

[@Impromptu21]

Other way is reverse the graph ..

[@swapnildhiman6585]

❤️

[@altafmazhar7762]

Op bhai

[@srijandasbiswas4864]

Bhaiya ek baath samjha do please , kaise pata chl rha king upar hoga ques padhke toh nhi samaj aaya aesa
King ek regular house hai na kahi bhi ho skta king

[@sahil.rajput2000]

it is given in ques that adress of mansion is 1

[@SubhamKumar-9009]

👍🏼