Amount of Time for Binary Tree to Be Infected | Using DFS | One Pass | Leetcode 2385

[@kunalbhatia8587]

kya hi explanation haiiiii. Mene khud karlia code Superb explanation................

[@lofireverbz-wy7go]

bhaiya seriously lots of love for your hardwork in making video❣❣

[@codestorywithMIK]

Means a lot

[@md.tamaltahasinkhan6448]

You have named the channel perfectly. You are a true story teller. I enjoy each and every videos of your channel as like reading my favourite novel. ❤

[@codestorywithMIK]

Means a lot 😇❤️🙏

[@DevOpskagyaan]

You are the best DSA tutor in entire KZbin. Most underrated

[@sauravchandra10]

I could never have thought of this approach. Thanks ❤

[@nishantchoudhary4230]

coding love h bhaiya because of you...

[@codestorywithMIK]

😇🙏🙏❤️

[@aws_handles]

Top notch ⭐️ Didn’t find any good video/article which explained this approach like this. You are unique

[@divyadahiya9161]

Mja aagya intna acha samjhaya hai ❤❤

[@akagi937]

Again I said in the first video earlier , the way you explain makes it easy to think and grasp the concept

[@codestorywithMIK]

🙏🙏

[@harshittyagi911]

maza aa gaya bhai... thank you soo much

[@gui-codes]

big fan yaar. love your explanations.

[@yatharthgupta6468]

Brilliant solution and very well explained Thanks

[@prateekgirilateralentry5865]

Amazing explanation! Mja Aa gya Sir And Thanks sir for daily motivation Day : 55 streak continues 😃

[@codingdev4196]

Bhai you are just too good 🔥 Best explanation dete ho bhai aap Great work 😊

[@codestorywithMIK]

Thank you so much 😀

[@cooldude0321]

Thank you sir for your hardwork and dedication,it helps us a lott!!!!🙏🙏🙏🙏

[@Whirlwind03]

MIK bhai top notch explanation, Please start LLD lectures as well🙏

[@phoenix1814]

love u brotha ur way of explaining is superb!

[@codestorywithMIK]

Thank you so much 😀

[@DevOpskagyaan]

You are a magician ❤

[@souravjoshi2293]

Superb explanation. Hats off

[@anuppatankar4294]

Great video 👌🏻

[@codestorywithMIK]

❤️😇

[@wearevacationuncoverers]

Was waiting eagerly for this ❣

[@u_NIK_]

Best explanation brother. Keep it up.

[@codestorywithMIK]

🙏🙏❤️❤️

[@gauravbanerjee2898]

Thanks a lot bhaiya fr the top notch explanation ❤🔥

[@codestorywithMIK]

Always welcome 🙏

[@ashyy346]

this is fab fab

[@codestorywithMIK]

🙏🙏

[@knowsbetter4113]

🎉🎉

[@atmanirbharofficialindiaon2789]

Hey plsss tell the ques u mentioned in the video similar to this one and link also of leetcode for that ques i want to test my skills after understanding of this ques

[@codestorywithMIK]

Aha my bad, The question was asked in Meta Coding Round (Pen and Paper) : Write a program which can take input root of a binary tree and a target value. It should find the farthest leaf distance from the target value. This problem (video) is nothing but the same Qn but with twisted words.

[@movieShorts-nv1uf]

2977. Minimum Cost to Convert String II . Vai plz make a vedio on this problem . Actually stuck on this problem . It's like to much hard to go . Please explain it and make a vedio .

[@jambajuice07]

bhaiya can u please also do solutions of upcoming leetcode contest (Q3 and Q4) atleast also Q4 of recent contests

[@codestorywithMIK]

I recently posted Qn-4 of Sunday contest. You can find it in my playlist - kzbin.info/www/bejne/iYixenqXhNWJZrc

[@RajSingh-te1uo]

are u going to make video on today's gfg potd?

[@codestorywithMIK]

Hi Raj, Actually a very similar Qn video is already there in my playlist. Using that same concept you can solve this also. Let me share the code and the video too. /* NOTE - Using same concept as Leetcode 974. Subarray Sums Divisible by K Video - kzbin.info/www/bejne/bYnIoKWYbJdkgrM */ /****************************************************** C++ *************************************************************/ //T.C : O(n) //S.C : O(n) class Solution{ public: int longSubarrWthSumDivByK(int nums[], int n, int k) { unordered_map mp; int sum = 0; mp[0] = -1; int result = 0; for(int i = 0; i

[@RajSingh-te1uo]

@@codestorywithMIK thank you sir ♥️

[@YashSinghal]

very interesting approach explained so well 🫡🫡

[@codestorywithMIK]

🙏🙏❤️❤️

[@abhishekrai3]

bhaiya, es question ko (3002. Maximum Size of a Set After Removals) kr denge plz, samjh nhi aa rha hai.

[@ashyy346]

sir, one doubt, can't we convert the tree into undirected graph and then use dfs, like why and why not ? Please tell

[@shashanksaxena6699]

he already made video on this which was the first approach and this is the second approach. check the video section of his channel

[@ashyy346]

@@shashanksaxena6699 it was with bfs right? Like I was asking for dfs but I think I should watch it again. Thanks 👍🏻

[@shashanksaxena6699]

@@ashyy346 yes it was with bfs...you can try DFS also

[@harshtiwari416]

bhaisahab aap famous question variation ko mention krna bhul gye. kripya krde vo bhi solve krlenge

[@codestorywithMIK]

Aha my bad, The question was asked in Meta Coding Round (Pen and Paper) : Write a program which can take input root of a binary tree and a target value. It should find the farthest leaf distance from the target value. This problem (video) is nothing but the same Qn but with twisted words.

[@shivanshupandey1106]

Bhaiya java me bhi code kiya karu ..... It will help us lot

[@sachinnarang2453]

class Solution { private int ans = Integer.MIN_VALUE; private int dfs(TreeNode root, int start){ if(root==null) return 0; int left = dfs(root.left,start); int right = dfs(root.right,start); if(root.val==start){ int distance = Math.max(left,right); ans = Math.max(distance,ans); // ya toh ye wala diff max hoga return -1; } else if(left>=0 && right>=0) return 1+Math.max(left,right); else{ int distance=Math.abs(left)+Math.abs(right); ans = Math.max(distance,ans); //Ya toh ye diff max hoga return -1+Math.min(left,right); } } public int amountOfTime(TreeNode root, int start) { dfs(root,start); return ans; } }

[@shivanshupandey1106]

@@sachinnarang2453 thanks bhai 😇

[@codestorywithMIK]

Actually, i always put JAVA code in the same GitHub link in the description. Hope that helps. Thank you sachin for the Java code 😇❤️🙏

[@ManojKrVerma-vw4dx]

Do baar dekhna pada

[@dayashankarlakhotia4943]

i have solved this problem from your guidance 🙏 please make video on leetcode biweekly challenge. digits dp🎉❤

[@teamamroninja333]