Skip to content
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.

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

chan - rock #3

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

chan - rock #3

wants to merge 1 commit into from

Conversation

chanbzz
Copy link

@chanbzz chanbzz commented Oct 4, 2021

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work Chan, you hit the learning goals here. I don't really have anything to comment on beyond the fact that you never indicated what you thought the time/space complexity were. Other than that, outstanding submission.

@@ -23,17 +23,22 @@ class LinkedList {
Space Complexity: ?
*/
getFirst() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

}

/*
/*s
Method to add a new node with the specific data value in the linked list
insert the new node at the beginning of the linked list
Time Complexity: ?
Space Complexity: ?
*/
addFirst(value) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

@@ -43,7 +48,15 @@ class LinkedList {
Space Complexity: ?
*/
search(value) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

@@ -52,7 +65,17 @@ class LinkedList {
Space Complexity: ?
*/
length() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

@@ -63,7 +86,17 @@ class LinkedList {
Space Complexity: ?
*/
getAtIndex(index) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

@@ -73,7 +106,15 @@ class LinkedList {
Space Complexity: ?
*/
getLast() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

@@ -82,7 +123,13 @@ class LinkedList {
Space Complexity: ?
*/
addLast(value) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

@@ -92,7 +139,18 @@ class LinkedList {
Space Complexity: ?
*/
findMax() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

@@ -101,7 +159,24 @@ class LinkedList {
Space Complexity: ?
*/
delete(value) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

@@ -129,8 +204,21 @@ class LinkedList {
Space Complexity: ?
*/
reverse() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Time/space complexity?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants