-
Notifications
You must be signed in to change notification settings - Fork 47
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 - Jessica #25
base: master
Are you sure you want to change the base?
Space - Jessica #25
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Outstanding work, you hit all the learning goals here. Well done.
# Time complexity: O(n^2) | ||
# Space complexity: O(n) | ||
|
||
def intersection(list1, list2) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Your time complexity is O(n + m) where n and m are the lengths of the two arrays. Otherwise well done.
# Time complexity: O(n) | ||
# Space complexity: O(n) | ||
|
||
def palindrome_permutation?(string) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Well done.
# Time complexity: O(n) | ||
# Space complexity: O(n) | ||
def permutations?(string1, string2) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Well done
No description provided.