-
Notifications
You must be signed in to change notification settings - Fork 47
Time - Lola #45
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
base: master
Are you sure you want to change the base?
Time - Lola #45
Conversation
CheezItMan
left a comment
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.
Nicely done, all the solutions look well done. These are common types of questions on interviews and being able to use hashes to write efficient solutions is an important skill at this stage.
| # Design and implement a method that takes two integer arrays | ||
| # with unique values and returns their intersection in a new array. | ||
| # Note: Do not use the & operator. | ||
|
|
||
| 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.
👍
| # Write a method which will take two strings as arguments | ||
| # and returns true if one string is a permutation of the other. | ||
|
|
||
| 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.
👍
| @@ -1,4 +1,25 @@ | |||
|
|
|||
| 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.
👍
No description provided.