Skip to content

Conversation

@seaweeddol
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.

Outstanding work, you hit all the learning goals here. Well done.

Comment on lines +1 to 4
# Time complexity: O(n^2)
# Space complexity: O(n)

def intersection(list1, list2)

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.

Comment on lines +1 to 4
# Time complexity: O(n)
# Space complexity: O(n)

def palindrome_permutation?(string)

Choose a reason for hiding this comment

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

👍 Well done.

Comment on lines +1 to 3
# Time complexity: O(n)
# Space complexity: O(n)
def permutations?(string1, string2)

Choose a reason for hiding this comment

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

👍 Well done

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