Skip to content

Conversation

@quinqu
Copy link

@quinqu quinqu commented Mar 30, 2020

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.

Good work, you hit most of all the learning goals here. Well done.

Take a look at my comments and let me know if you have any questions.

@@ -1,3 +1,13 @@
def intersection(list1, list2)

Choose a reason for hiding this comment

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

This works, but it's O(n * m) in time complexity. Using a hash you can get this to O(n + m) time complexity which is much better.

I encourage you to think about how to do this.

@@ -1,4 +1,18 @@

def palindrome_permutation?(string)

Choose a reason for hiding this comment

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

👍 This works

string2 = string2.split("")
hash = {}
string1.each do |char|
hash[char] = true

Choose a reason for hiding this comment

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

You would do better to count the number of times each letter appears.

@@ -1,4 +1,21 @@

def permutations?(string1, string2)

Choose a reason for hiding this comment

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

This doesn't quite work, for example it would fail for heelo and hello. See my note below.

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