Either your problem statement is incomplete, or your test suite is ill-formed.
For some of the problems, the solution is not unique, but your test suite fails for solutions other than your own. If there is some further requirement that would make your solutions unique, it should be stated.
For the last test, the input is a valid solved Kurosu board, but you expect us to say that there is no solution to that board. If this was intended (i.e. you meant the "partially filled" statement to be a requirement on the input), then it should have been specified.
The last test board has three consecutive zeros in a column, so it is invalid, and the others do appear to have a unique solution.
Thank you for the comments. I've updated the test suite to check for non-unique solutions, just in case.
It looks like I missed restriction 3 in the description. I retract my comments. Great problem!
Good problem !
Extraterrestrial solution from Tim. This code must be taught in school.
Great solution indeed, thanks for the comment Jean-Marie. That's why I felt compelled to rescore and eliminate your backdoor solution. Sorry, but nice catch.
Cody seemed to be having a hard time creating a ~2Gb variable here (commented-out line in the this solution code) @CodyTeam: would it be possible (in general) to increase the servers available memory a bit? (of course this is not a big deal, we can always try to work around that)
Thank you for your feedback. I will capture this as an enhancement request to discuss further with the Cody Team :)
Find the alphabetic word product
Spot the rectangle
Draw a 'Z'.
Return the sequence element II
Increasing sub-sequence (Level 2)
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office