Bro one doubt...! Ipo suppose last node 3 oda pointer 4 ah point Panama suppose 2 vah point pana...apo fast pointer 2 nodes Traverse pani 4 la varum..and slow pointer 5 la irkum..apo rendum same number ila..so loop kandupidika mudiyadhu la ? So adhuku badhil...traverse panum podhu again repeated number repeated memory value of pointer va dha adhu loop nu return panalam ah ??? So again fast pointer 2 nodes Traverse pani 3 la varum slow pointer also 3 la varum...apo loop nu kandu pidikalaam...but oru traverse extra agudhu...so time complexity adhigam agum la ?!
Bro list oda end kandupudikkave namma next = null thana use pannuvom apa loop iruntha eppidi panna mudiyum antha condition eh varathu la so loop oda end node enna netheriyathu
Sure, Hashmap vachu solve pannalam, but we just thought this solution was cooler than that. 😅😅 And people don't think of this solution , so we thought it might be worth implementing more than the hashmap approach
they are asking for the loop with the node bro...not with the data...node oda next null aa iruka nu dhan pakanum..This problem has nothing to do with data...
