Three lists with no pointers !!

Three lists T1,T2 and T3 . Add T1 and T2 , store the last digit of the sum in T3 and forward the carry to the previous node . Once you move ahead in the node , you cannot come back to this node. Way too many nodes to store in any DS . Stack for a limited case might be used

Comments (0)