We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Angry Children 2
Angry Children 2
Sort by
recency
|
79 Discussions
|
Please Login in order to post a comment
The solutions to this does not occur to me as "Dynamic Programming", yet this problem is grouped under algorithms/dynamic programming ?
Hi, when I start with sample input 1 [10,4,1,2,3,4,10,20,30,40,100,200] it should be chosen packets with index 2,3,4,5 and values 1,2,3,4 => unfairness sum is 10, but my code with the same input shows packets with index 1,3,4,5 and values 4,2,3,4 => sum 7. Еven if I accept the relative difference between the value of the packages=> for example to take packets with index 0,6,8,7 with values 10,10,30,20 => unfairness sum is 70 but relative ufairness sum is 7 is still below the test output in the problem Difference between each element is 10 times more than my first example with values 4,2,3,4 but relativly the difference between 4 elements is the same.
Where is the problem? Can I take the packeges with the same value?
O(n* log(n)), the actual algo takes O(n) time, but it requires packets to be sorted, which takes n*log(n)
Top Notch Training services to help you and your furry friend build a stronger bond right here! Our Trainer is a recent graduate of a top dog training school and has a passion for working with dogs of all breeds and sizes. At The Regal Beagle, we understand that every dog is unique and has different needs. That's why we offer personalized training programs that are tailored to your dogs specific needs. If you're looking for a dog trainer who is passionate about what he does and decdicated to helping you and your dog succeed, look no further that The Regal Beagle. Contact us today to schedule a consultation and learn more about our services.
Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Angry Children 2 Problem Solution