Draft
Peaches and Avocados
26H3XoRuSH
Loading description...
Fundamentals
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.
Please do not use problems from other sites as "inspiration". They are most probably copyrighted and recreating them somewhere else is most probably not allowed.
unpublished
with the values : 100 <- money 10 <- p_price 11 <- a_price 79 <- ticket
i can buy : 1 p_pen, 1 a_pen, 1 ticket spending all of the money so i would return 100, but the test case wants 21
could you help ?
hello! please read the task again to find out. i don't want to give you a spoiler, good luck!
ok done, thanks :)
I just fixed the test cases. Sorry for the inconvenience.
No random tests.
Hi, thanks! I just added some random tests.
The link to the original problem is broken.
It seems like you need to signup for the contest. To do that, sign in first here: https://www.hackerrank.com/apc-practice-page/. Then, go to the link I gave. I will fix the statement real quick.
Okay, but the "variation" adds nothing to the tasks.
If you won't consider the very little variation that you just add extra conditions, then it won't be. I'll change the statement for you and other testers to understand it clearer.
This seems to be stripped-down duplicate of knapsack problems.
This problem is for beginners to learn loops and conditions, and it may serve as an introduction to dynamic programming. That's why the contraints are very low. So, unlike considering this just a stripped-down knapsack problem, consider this as a problem for beginners to learn the basics they need to understand other deeper algos and data structs.
Fixed. Thank you!