Meet your coaches
Talk through the problem while you code. Signed-in reps become prep memory for the next session.
Linked List Cycle
Linked List Cycle is where Floyd's tortoise and hare earns its keep: two pointers, one moving twice as fast, must meet inside any loop. The hash-set answer works but spends O(n) memory you do not need. Get the fast-and-slow rhythm here and cycle-entry and middle-of-list fall out for free.
Meet your coaches
Talk through the problem while you code. Signed-in reps become prep memory for the next session.
Chat with Fin or Coco right now on mobile.
Start talking through the problem here. Switch to desktop when you're ready to code and run tests.
Start coaching sessionStart a coached rep now. Sign in before or after the session so StrongYes can save what you struggled with to your prep memory.
Email me this coached-rep link
Desktop required
Sorry - mobile cannot run the editor and tests yet. Use the next step below or email yourself a link to continue on desktop.
Stay in the library until you can get back to desktop for the full editor and tests.