Sherlock and Cost Discussions | Algorithms | HackerRank
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.
It's absolutely a bad idea to put 5 such small test cases, that a brute solution passes them. Even if there are hidden performance tests, then solving it by brute force will get a final score about 50% I guess, which is 75pts. In my opition, brute force shouldn't give more than 10% score. I hope that there are tests which an O(n^2) solution doesn't pass.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Cost
You are viewing a single comment's thread. Return to all comments →
It's absolutely a bad idea to put 5 such small test cases, that a brute solution passes them. Even if there are hidden performance tests, then solving it by brute force will get a final score about 50% I guess, which is 75pts. In my opition, brute force shouldn't give more than 10% score. I hope that there are tests which an O(n^2) solution doesn't pass.