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

Space - Shonda #1

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Space - Shonda #1

wants to merge 2 commits into from

Conversation

Shonda860
Copy link

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 Shonda. Really solid here, well done. One question, what is transformFromAst?

Comment on lines +22 to 25
Time Complexity: O(1)
Space Complexity: O(1)
*/
addFirst(value) {

Choose a reason for hiding this comment

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

👍

Comment on lines +34 to 37
Time Complexity: O(n)
Space Complexity: O(1)
*/
search(value) {

Choose a reason for hiding this comment

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

👍

Comment on lines +54 to 56
Time Complexity: O(n)
Space Complexity: O(1)
*/

Choose a reason for hiding this comment

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

👍

Comment on lines -58 to 102
Time Complexity: ?
Space Complexity: ?
Time Complexity: O(n)
Space Complexity: O(1)
*/
length() {

Choose a reason for hiding this comment

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

👍

Comment on lines +117 to 120
Time Complexity: O(n)
Space Complexity: O(1)
*/
getAtIndex(index) {

Choose a reason for hiding this comment

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

👍

Comment on lines +201 to 204
Time Complexity: O(n)
Space Complexity: O(1)
*/
findMiddleValue() {

Choose a reason for hiding this comment

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

👍 , nicely done, the optimal solution

Comment on lines +219 to 222
Time Complexity: O(n)
Space Complexity: O(1)
*/
findNthFromEnd(n) {

Choose a reason for hiding this comment

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

👍

@@ -129,39 +253,72 @@ class LinkedList {
Space Complexity: ?
*/
hasCycle() {

Choose a reason for hiding this comment

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

👍

Comment on lines +279 to 282
Time Complexity: O(1)
Space Complexity: O(1)
*/
getFirst() {

Choose a reason for hiding this comment

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

👍

Comment on lines +288 to 291
Time Complexity: O(n)
Space Complexity: O(1)
*/
addLast(value) {

Choose a reason for hiding this comment

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

👍

@Shonda860
Copy link
Author

Nice work Shonda. Really solid here, well done. One question, what is transformFromAst?

I believe that was something vs code did I never even noticed it.

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