Out of 4, 3 test cases were passed and I cannot think of other one. Can anyone help with that one - where my code is getting stuck?
My one test case was not passed - Intersection point in LL
hey @LPLC0114, your approach is not correct.
here is correct approach to solve these question.
Traverse the bigger list from the first node till d (where d= absolute differece of length of two LL)nodes so that from here onwards both the lists have equal no of nodes.
Then we can traverse both the lists in parallel till we come across a common node. This common node will be intersection point.
Okk I follow your instruction thanks for the suggestion
hey @LPLC0114 , if your query is resolved. Please mark this doubt as resolved and rate me on the basis of your experience.
rating option will appear when to mark this doubt as resolved
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.