6 kyu
Code-breaking by Letter Frequency
Loading description...
Ciphers
Puzzles
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
This kata has no right to be approved. 5 tests with fixed input and random subsitution mapping (which is pointless here since we're looking at the relative frequencies only). Frequency analysis alone doesn't cut it so it's literally applying more guesswork or working out the answer offline. And the expected result depends on contextual, external information of the plaintext not provided in the code, and would mostly require Google searches.
Basically, this is not a code challenge, this is really just an elementary cipher puzzle. Who approved this? It should be sent back to beta, probably unpublished as well (to prevent other users re-approving this).
What's the mean of the parameter n?
There are a small number of speeches (5) to solve for this kata.
They are uniquely identified by the number
n= 1,2,3,4,5.(I'll add this info to the Kata description)
@Elfein7Night- Thanks for approving my old Kata :-):)
Looks very cool. Ready to solve the riddle.
Good Luck. You can do it!
Thank you, i enjoyed solving your kata! It was difficukt to translate thoughts into a programming language. Especially a long time i was looking for how implement the storage of rating of letters, in order to decipher it later. I need to study other solution.
any python traslation yet ?
wrote a bunch of shit for it in python til i realiyed its java i am mad now
nice
I was sceptical before starting this Kata, since I could tell from the description that the this wasn't a case of code it right, and you're done.
But after attempting it, I wanna say it was pretty fun to do. So thanks!
@blu.knite, Yes, this Kata was a deliberate break away from the usual pattern. You still need to write useful code, but it is only to help to reveal the answer.
I'm glad you liked it.
This comment has been hidden.
This comment has been hidden.
Well.. the major point is, IMO, this kind of kata should involve more things ralated to programming, more exactly, a function that can decode the message automatically without manually help. Which requires users to prepare a common word dictionary themselves, and ofc one can not guarantee that it would perform 100% correct, so just expecting it to return a map which, let's say, allowing 2 or 3 mistakes, because homo sapiens can understand even there are flaws. Then we can add random tests to tell if users are doing things right....
Anyway, I'm ok if you believe it's ok to be easy for English speakers.. ... ... Talking about English, how about adding German, French and others so that challengers can ONLY rely on frequency analysis in at least one language.
This comment has been hidden.
Yeah, but actually you dont need frequency analysis to reveal the truth...
// I'm actually suggesting you (or someone else) to make another kata which required you to decode messages on the fly o_O