Solution for Issue #3, mutations, in python #163
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Dear the-vampiire,
this is my first pull request! I hope it works out fine.
Approach / Thought Process
My approach was to first make both strings comparable (both were set to lower case) and then to compare each letter from the second string against the first string. I ended up doing it by transforming the first string into a list for reasons discussed in the section below.
Problems during the solution process
The main issue I had was making sure that the same letter in the first string couldn't be "used twice". I ended up solving it by transforming the first string into a list and removing each letter as it was used.
Instructions to run
The python file is set to run the tests (hardcoded into name=="main"), but the mutations function can be imported separately and ran. The input is a list of two strings, in which the second string will be tested against the first.
-- bpbrum