11
David Jones
Last seen 2 years ago
Member for 9 years, 4 months, 15 days
Difficulty Normal
Is it just me, or should this NOT be the "clear" solution. As a newcomer, it's extremely discouraging to see such a complex solution (ie: generator functions) in the elementary section. I'd like to come in and see annotated long-form solutions that clearly explain why the code does what. THAT is cle
More
This is good, I like the indexing, but you should also check out the hint for use of the ord() and chr() functions. If you're unaware you should also read up on unicode encoding and ASCII :)
More
While this works, if something where to change in your game mechanics or anything, editing and debugging this would be horrible! Can you think of a way that would automate the process better?
More
Shouldn't you be counting the letters? like the story says, if you were using an addition subtraction cipher then this wouldn't work, so while it completes the mission it misses the mark of counting each letter for analysis (in this case, grabbing the maximum), no?
More
If you're going to viciously defend yourself for being clear, can we get a new tag that implies a more "beginner" approach?
More
I really can't figure out how the recursion works, can someone please try to explain it to me?
More
Nice job! Your solution was given to me in the random review.
I have 2 suggestions.
First, you don't need to convert the strings to lists. Strings are iterables in python, so `sorted()` would have worked exactly the same (outputting a list, keep in mind).
Second, you could simplify your output
More
Hi, nice job! Your code was shown to me in the random review process.
My only comment is that you don't need to convert the words to lists before passing to sorted. This is because in python strings are iterables so you can treat them as lists in `for` loops and in functions like `sorted`
Hope thi
More
I don't like the way I establish the ranges. I'm going to come back to this.
More