why are we moving d nodes in longer linked list
Algo noot clear
hello @kartik-malik
d is differnce between length of two list.
so by removing d nodes from bigger list we are making its length equal to smaller list.
and now the problem reduce to -> given two list of equal length ,check whther they r intersecting or not
cant’t intersection be in the area we removed
no,because given lists are forming y.
( assume section highlighted in yellow is intersection )
so after intersection length of both should be equal
1 Like
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.