2246. Longest Path With Different Adjacent Characters || Leetcode || C++ || Hindi

Today we will learn ,how to solve question 2246. Longest Path With Different Adjacent Characters || Leetcode || C++
#leetcode #cpp #dailychallenge #codewithsky #weeklychallenge #preorder #dfs
Solution:github.com/codewithSky07/CppC...
Problem:leetcode.com/problems/longest...

[@akanksha00]

Me and my friends were unable to understand this problem... really helpful 😍 keep going

[@blackcap3093]

keep going

[@Ankita-sd5gp]

Great explanation and clean code, exactly what I was looking for. I just randomly found you channel through leetcode discussion and I must say I wish I have checked it sooner as been trying to get back in contact with dsa along my work. Keep up the good work :)

[@codewithsky]

Thank you so much for Support😅

[@vishalplayzz2580]

clean code for this q !! was seeing some tree sum solutions for this q dint find it convincing this was too good 👌

[@codewithsky]

Glad you liked it!😅

[@AmarjeetKumar-to9ub]

🔥++

[@codewithsky]

Thank you so much for Support😅

[@aadhyaramakrishnan3630]

I have a doubt! When we are calculating maxpath for node 2, we're getting result as 2 ( node 0,node 2) so, while calculating ans , why is the value of maxpath still 1? As it has got updated to 2 now.

[@codewithsky]

Can you please tell which example?😅

[@aadhyaramakrishnan3630]

@@codewithsky Example 2

[@codewithsky]

Aree No no, i have just wrote only for 2, i told that maxpath will be updated at 10:36 onwards.You are correct it will be 2 when we will calculate for 3 . I think now your doubt might be clear😅

[@aadhyaramakrishnan3630]

@@codewithsky Got it! Thank you