<pre class="shiki github-dark shaku"><code>/** * @param {Node} head * @return {boolean} */function hasCircle(head) { // your code here let slow = head; let fast = head; while(fast &amp;&amp; fast.next) { slow = slow.next; fast = fast.next.next; if(slow === fast) { return true; } } return false;}</code></pre>

TC: O(n), SC: O(1) - Slow and Fast pointer technique

A Singly Linked List is a bunch of nodes linked in one direction. class Node { val: any next: Node constructor(val: any, next:Node) { this.val = val t…