A linked list contains a cycle if, starting from some node p, following a
Chapter 3, Problem 3.34(choose chapter or problem)
A linked list contains a cycle if, starting from some node p, following a sufficientnumber of next links brings us back to node p. p does not have to be the first nodein the list. Assume that you are given a linked list that contains N nodes. However,the value of N is unknown.a. Design an O(N) algorithm to determine if the list contains a cycle. You may useO(N) extra space. b. Repeat part (a), but use only O(1) extra space. (Hint: Use two iterators that areinitially at the start of the list, but advance at different speeds.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer