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.
Hi Bayleef. It appears that no matter how i optimize the solution, it never passes exactly 11-15 test cases. Can you please confirm, just to be sure, that these test cases are still correct? I run 100 queries with whatever m and n (within the constraints), and execution time never exceed second (usually it's less than 0.01 sec for 100 queries with any crazy ms i can think off).
I tried looking for insight and solutions from discussion thread from original project euler site, and best of the posted solutions don't pass these tests cases too. Exactly these five (11-15) tests cases. Approaches in solutions used are either the same, or not that much superior.
It would be really helpfull to have confidence that these tests at this moment are definitely correct. Thank you in advance!
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #220: Heighway Dragon
You are viewing a single comment's thread. Return to all comments →
Hi Bayleef. It appears that no matter how i optimize the solution, it never passes exactly 11-15 test cases. Can you please confirm, just to be sure, that these test cases are still correct? I run 100 queries with whatever m and n (within the constraints), and execution time never exceed second (usually it's less than 0.01 sec for 100 queries with any crazy ms i can think off). I tried looking for insight and solutions from discussion thread from original project euler site, and best of the posted solutions don't pass these tests cases too. Exactly these five (11-15) tests cases. Approaches in solutions used are either the same, or not that much superior.
It would be really helpfull to have confidence that these tests at this moment are definitely correct. Thank you in advance!