7 kyu
Move 10
2,739 of 6,754PG1
Loading description...
Fundamentals
Strings
Arrays
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.
[Nasm] Can someone explain to me how to get the length of the string, so that the code does not search and work with rubbish values after the string in memory? My solution works directly with the rdi register via offset. Maybe the length of the string is provided in some register?
Now my code returns something like this:
Expected: docdmkco. Received: docdmkco �4 o p<�[�dd�3 o ��1*ro �3 o
Expected: docdmkco. Received: docdmkco Dt[�.
nasm challenges use C code as a driver, and strings are regular C-strings: they have no length, but they are null-terminated.
Thank you, it's working now.
Can someone explain to me, how that test is possible to pass? "'kmoprvwxyzbcde' should equal 'bodebxypdroczkmomkwov'"
kmoprvwxyzbcde has 15 letters and bodebxypdroczkmomkwov has 20 letters. Is this a joke? Who made those test? There are plenty wrong test as well.
"kmocd" should equal "docdmkco" Invalid: "kmocd" has 5 letters, while "docdmkco" has 8 letters.
"kmnoybcg" should equal "mynogkbc" Invalid: Different lengths and different sets of letters.
"korvwzbcdh" should equal "ohkwzvodocdrobo" Invalid: Different lengths (10 vs. 14 letters).
"kmoprvwxyzbcde" should equal "bodebxypdroczkmomkwov" Invalid: Different lengths (15 vs. 20 letters).
"klmoqrswxyzbd" should equal "lbsxqyxdrolyydmkwz" Invalid: Different lengths (14 vs. 18 letters).
"kmnopqsxyg" should equal "goxoonkxyppsmonyq" Invalid: Different lengths (10 vs. 16 letters).
Not a kata issue, your solution is wrong.
yep, I' ve understood something wrong.
Lua translation!
Approved by someone
That would be me - thanks for the translation. Still people translating a valuable kata while the "de-dupe" process tries to have it removed. A hint perhaps...
Groovy Translation
Approved, thanks
This kata is a subject to deduplication process here: https://github.com/codewars/content-issues/issues/203.
Please join the discussion to help us identify duplicate kata and retire them.
Why no one think about negative indexes? May be +10 is the same as -16?
thinks of it as two cases, either character+10 is within range "a"..."z", and new character is character+10 or character+10 exceeds range in that case you have to take the modulo of character+10 and add code point of "a" to it since that is when you overlfola
This comment has been hidden.
Approved by author secretly
COBOL translation.
approved
Coffeescript translation
Crystal translation
Nice
This comment has been hidden.
It would be 6 kyu
Clojure Translation ready for review
Approved, thanks
love to solve
I can't believe this. A few days ago some lunatic almost bit my head off, because I had the audacity to submit a beta that was vaguely familiar to him (yes I'm talking to you, Wiltink), and here I am, solving Caesar cipher number 200 ... Reading the comments, this was already old four years ago.
Alright then, bring them on. I'll continue with Sudoku-solver no.7, or cut my way through a jungle of Fibonacci's.
:D
This comment has been hidden.
Julia translation and NASM translation
Approved
Forked python translation with new test framework used and 3.8 enabled ~~
Approved
This comment has been hidden.
Haskell : https://www.codewars.com/kumite/5bdc5a42fda5a256cd0001f7?sel=5bdc5a42fda5a256cd0001f7
Approved
Kotlin Translation
Please review and approve/comment
Approved
Ruby translation
Python translation
Please review both and approve.
Approved
C translation kumited. :)
Approved
It's a Caesar cipher.
Did we really need another one of those?
Yep. It's a beginner kata. Beginners benefit from a degree of repetition to bed in skills.
What you call a degree of repetition I might describe as an excess of sameness.
On a bad day. :P
@petegarvin1, You can take a break, I'm here to create the rest of the kata series.
I actually agree with pete on this..."Beginners benefit from a degree of repetition to bed in skills." nice kata man :)