Beta
Simple Fun #392: Count Robot
Loading description...
Puzzles
Mathematics
Arrays
Algorithms
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.
This comment has been hidden.
I just realised: Is this a Backpack Problem?
In that case, I'd argue this is not Simple Fun.
The naive solution to the Backpack Problem is
O(2^n); the Dynamic Programming solution isO(n²); I fear this one isO(4^n)naively andO(n^4)in the way I still don't understand. ( But I don't understand enough of the DP solution to the BP anyway to establish that complexity with any authority. )Is this a generalisation of the Backpack Problem?
It's not a Backpack Problem, I think ;-)
This comment has been hidden.
Wait, Please..
You are right. Reference solution changed. Hope it's fixed o_O
I think it's fixed; we seem to agree on results now.
Now I need a couple of orders of magnitude more speed .. :/
Thanks! :]