can you please tell me the time complexity of removing loop in alinked list
Linked list issue
Since there are multiple ways in which you can code to remove loop from a linked list
I am willing to take up each case individually from a gfg artcile
1 ) Method 1 (Check one by one) time O ( n^2)
2 ) (Better Solution) O(n k) k is count of nodes in the loop
3) (Optimized Method 2: Without Counting Nodes in Loop) O(n + k ) can be taken to be O(n) possible. k is no. of nodes in the loop
4 ) ** Hashing:* Time O(n) space O(n)
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.