Let's just say the "state of the art statistical model" isn't really accurate.
(I'm presumming you are talking about cases such as n = 5, score = 7, but I'd say that's covered by the "If this is not possible, return -1" part, if you're referring to something else, please clarify in a comment)
The description do not establish any relations between locations and tunnels (not even that locations would be the complete set of locations), which transforms the kata into something else (minimal cost connection between a subset of the graph).
Since the graph is guaranteed to be complete, tunnels already contain information about locations anyway, which makes the latter redundant.
Seems like this kata was abandoned by it's author, so I'll try to push it out of beta myself. I've reworked the description to make it easier to understand + random tests for Python were added. Looking forward to any comments about what else should be done to get it approved.
That desciption was rough.
Let's just say the "state of the art statistical model" isn't really accurate.
(I'm presumming you are talking about cases such as n = 5, score = 7, but I'd say that's covered by the "If this is not possible, return -1" part, if you're referring to something else, please clarify in a comment)
There are times where the opponents given score is impossible.
Python new test framework should be used (Refer this for more detail)
This comment is hidden because it contains spoiler information about the solution
Unpublishing, as duplicate of numerous spanning tree kata (ex: https://www.codewars.com/kata/5ae8e14c1839f14b2c00007a, https://www.codewars.com/kata/64a815e3e96dec077e305750, ...)
(Also, not using the decorator syntax to write the tests)
Re-raising the issue:
Needs edge case with no tunnels and 0/1 locations (aka empty/singleton graph).
Empty set is also a set. This is not a valid explanation.
Anyways, Re-raising the issue again (since you're neither correct, nor have the authority to make this decision)
Elon Musk wants to drill a set of tunnels to a number of important locations, less than 2 locations makes no set of tunnels.Needs edge case with no tunnels and 0/1 locations (aka empty/singleton graph).
The description do not establish any relations between
locationsandtunnels(not even thatlocationswould be the complete set of locations), which transforms the kata into something else (minimal cost connection between a subset of the graph).Since the graph is guaranteed to be complete,
tunnelsalready contain information aboutlocationsanyway, which makes the latter redundant.Description says "a walk that crosses all of the bridges once and only once"
Tests check "a walk that crosses all of the bridges once and only once and visits all land masses"
Done.
Function naming should be in
snake_caseSeems like this kata was abandoned by it's author, so I'll try to push it out of beta myself. I've reworked the description to make it easier to understand + random tests for Python were added. Looking forward to any comments about what else should be done to get it approved.
Loading more items...