Back to course home
0% completed
Vote For New Content
The simplest solution you have ever seen.
Viktor Shevchenko
Jan 26, 2025
public class Solution { public ListNode findCycleStart(ListNode head) { var next = head; while(next != null && next.Next != null) { var previous = next; next = next.Next; previous.Next = null; } return next; } }
0
0
Comments
Comments
Design Gurus8 months ago
Such solutions are usually not acceptable as they change the input LinkedList.