LeetCode: Linked List Cycle II Solution

Same as LC 141, but different in return

Approach

Same as LeetCode 141, but returns node instead of true/false

Implementation

1var detectCycle = function (head) {
2  if (!head) return null
3  if (head.visited) return head
4  head.visited = true
5  return detectCycle(head.next)
6}

Comments

Loading comments...

Apply and earn a $2,500 bonus once you're hired on your first job!

Clients from the Fortune 500 to Silicon Valley startups

Choose your own rate, get paid on time

From hourly, part-time, to full-time positions

Flexible remote working environment

A lot of open JavaScript jobs!!

Fact corner: Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.

Still hesitate? Read HoningJS author's guide on dealing with Toptal interview process.

LeetCode: Reverse Linked List

Update head each iteration

LeetCode: Search Insert Position

Understand why returns "low/left"

HONING JS

LeetCode: Linked List Cycle II Solution

Approach

Implementation

Comments

Tags

Apply and earn a $2,500 bonus once you're hired on your first job!

Next Post

Previous Post