2096. Step-By-Step Directions From a Binary Tree Node to Another | LCA | Backtracking | 2 Pointers

[@Ayush37262]

You are quite better than codestorywithMIK

[@ArhamSheikh-kl1bo]

Explanation is always at next level 🔥

[@prathamgolwala9282]

Bhaiya Dp on trees ka crash course pls 🙏

[@harshlimbachiya7510]

Great Thumbnails ++

[@AyushSharma-tj1kp]

This is giving memory exceed limit error how to fix that??

[@jimspatel2407]

You need to pass the string by reference. may be you are trying to passing string without reference.

[@rishabhranjan5162]

passing string without reference leads to making a copy of the string for every recursive call, thus leading to memory exceed limit

[@AyushSharma-tj1kp]

@@rishabhranjan5162 ok thanks got it

[@abhishekshukla5484]

If u upload explaination notes it will be fine

[@akshaanshsrivastava9817]

Very Heavy Explanation..

[@curlyoreki]

also link the refrence problem you are using in the problem

[@tgayush1424]

i have one question ,is it good to use global variables ? Using global variables is not a good way to write solution for a problem i guess.

[@badasspandit1886]

house robber 3 kraa do Mnnit se hi hoon

[@tgayush1424]

No need to take j can be done with i alone - int i = 0, n1 = rootToStartPath.size(), n2 = rootToDestPath.size(); int lcaLenFromRoot = 0; while(i