51–60 of 61 posts
And what's up with the green-on-black Mac screen?!
EDIT: my solutions (using Node.js) https://github.com/julienq/incubator/tree/master/misc/readyf...
Earlier quoted context omitted.
You mean with smart guessing? That's no fun!
Yeah. It took me three guesses to get it right. :)
Earlier quoted context omitted.
Yeah. It took me three guesses to get it right. :)
You didn't need 3 guesses. The sum of each partition has to be a factor of the number. In particular the sum of the first partition has to be a factor. Then the second. That already gives you the answer I think.
Earlier quoted context omitted.
The third problem is looking to partition the entire sequence of numbers into contiguous subsequences, all of which add up to the same sum. In other words, if the list were 23415, you subsequences could be 23, 41 and 5, all equaling 5. But the subsequences have to use up the entire string and they can't overlap.
They can't overlap! I don't think the problem specifies that? You have to interpret "break up" to mean "non-overlapping" to claim that the problem means what you're saying it means; I found 341 "contiguous subsequences such that the sums of each of the subsequences are equal", but they overlap. (If you had said "partition" I suspect I would have got what you meant)
https://gist.github.com/1029356
Thanks.
Earlier quoted context omitted.
> #pip install python-levenshtein > from Levenshtein import distance That doesn't seem in the spirit of the challenge.
Can you do it in linear time in the length of the input?
I "cheated" on the third one in that I read the discussion here which helped clarify the problem, non-overlapping, etc.