Intersection Point. Kept getting Null pointer Exception

#1
#2

@lousybrick,
https://ide.codingblocks.com/s/224513 corrected code

The efficient way to do this problem is to use difference of node counts.

  1. Get count of the nodes in the first list, let count be c1.
  2. Get count of the nodes in the second list, let count be c2.
  3. Get the difference of counts d = abs(c1 – c2).
  4. Now traverse the bigger list from the first node till d nodes so that from here onwards both the lists have equal no of nodes.
  5. Then we can traverse both the lists in parallel till we come across a common node.
1 Like
#3

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.