gcd(m,n) = 1. Dave
On Jul 5, 11:02 pm, amit <[email protected]> wrote: > Consider the general fast and slow pointer strategy to detect loop in > a LL. > Now , Suppose we move the slowPtr 'm' nodes at a time and move the > fastPtr 'n' nodes at a time. What are the constraints on 'm' and 'n' > so that we that we are able to find whether the list is circular or > not? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
