6 kyu
FLAMES Game version 1
191 of 292niczm25
Loading description...
Algorithms
View
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.
Description has to state explicitly what to do with names with multiple occurences of common letters.
Take the following example:
Additionally, the return value is unspecified if all of the letters are shared between the two names (such as LIAM/MILA, CLAY/LACY, ROAN/NORA, etc.).
Based on the reference solution,
"Siblings"
should be returned, but the description uses 1-based indexing, meaning that an index of0
should be undefined.Not really the same issue.
For yours, you just have to consider it goes back to 6.
Even negative indexes could be defined that way.
I think there's a problem with the randomized test. Cause it says on the log: HSREBQTK FLLCG 13 1 We get the value 1 which obviously corresponds to "Friendship" but an error occurs and says: expected:<[Siblings]> but was:<[Friendship]> although on previous randomized test with the same result: KRK BOOZJDTZVI 13 1 There is no error Please fix this.
What happens if the total remaining characters > 6 ?
It loops back to 1
You really need randomized tests to make all these hard-coded implementations to fail.
random tests added
This comment has been hidden.
Indeed, and in fact what is the expected outcome of that?
Since the F is counted as the first step, what should we consider "step 0"?
Two test cases don't seem to evaluate properly.
I've added a Python translation!
Approved some time ago
This comment has been hidden.
i thing your 1st minor problem is already stated in First and Second instruction?
First, cross out what letter(s) the names have in common. Second, remove the cross out letter on both names.
i really dont get the second minor issue you said, can you please elaborate more.
btw, thank you for the opinion you have discussed here.
The first problem is that the language is not clear, so if you changed:
to
The second problem was this, you describe "S" as "S = Siblings (Sister/ Brother)", do I return
Siblings
orSiblings (Sister/ Brother)
?got that, thanks.
One s is missing at Sibling__s__.
got that. thanks
In the description, step 4 is still missing the S for siblings.
i.e. 4. FLAMES --> 1>F 2>L 3>A 4>M 5>E 6>S
6>S is missing