-
-
Notifications
You must be signed in to change notification settings - Fork 195
largest-series-product corner cases #89
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
Ah, that's unfortunate. Tests are failing on |
Yeah ran locally with |
Going to change that |
The reasoning behind this is that there are zero ways to make a 4-character string out of "123", so to find the max product is to take the max of an empty list, which is an error. (Compare with the case of taking a 0-character string, of which there is one, so that case is not an error) These are consistent with the values defined in https://github.com/exercism/x-common/blob/master/largest-series-product.json
It is prudent to ensure that every combination of edge/non-edge are tested for the two inputs.
This is distinct from the existing case because there are nonzero digits in this string as well.
OK, that's better. Much less churn doing it this way. I saved the old way of doing it at https://github.com/exercism/xhaskell/compare/master...petertseng:lsp-corner-nojust?expand=1 but I think the way it is in this PR is better. |
I'm not sure who's around these days who knows Haskell. It looks like @abo64, @NobbZ and @stevejb71 have all commented recently in the Haskell track... would one of you have a moment to review this? |
I'll take a closer look into this in the next 36 hours. Katrina Owen [email protected] schrieb am Fr., 29. Jan. 2016 19:58:
|
As far as I can see, the code in the example is idiomatic, the choose of Also all the added tests (and the changes to make old ones pass with new code) seem reasonable. |
Reasonble question. I originally tried to answer this question by seeing what has
If someone follows the order in config.js, then the ones that come before: scrabble-score, binary, atbash-cipher, bank-account, queen-attack, binary-search-tree, hexadecimal However, I actually realized that it's not necessarily the case that the tests are testing for
So someone on this exercise either has seen Separately, we may consider somewhere to discuss general questions that rise from the above comment. Possible questions I can think of:
|
Y'all think anything else needs to be done here? Based on the investigation above, I think the |
I do also think that this can be merged. @kytrinyx |
Thanks, merging! |
largest-series-product corner cases
As part of the work to have consistency between tracks as in https://github.com/exercism/todo/issues/104 and https://github.com/exercism/todo/issues/13. Comments are in individual commit messages.