Skip to content

solution to 2.6 #12

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
KamillaKhabibrakhmanova wants to merge 1 commit into
base: master
Choose a base branch
from
Open

solution to 2.6 #12

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions Chapter2-LinkedLists/2.6-FindLoop.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
/*
Problem: Given a circular linked list, implement an algorithm which returns the node at the beginning of the loop.
*/

//built on top of linked list in data structures
LinkedList.prototype.findLoop = function() {
var n = this.head;
var storedValues = [];
var res = null;
while (n) {
if (storedValues.indexOf(n.data) < 0) {
storedValues.push(n.data);
n = n.next;
} else {
res = n.data;
break;
}
}
return res;
};

//runtime: n^2