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.
Maybe your optimisations for big m have a detrimental effect on the runtime for small m. For small m the number of red zones can become very big. In Python I have been able to run all tests in sub second time.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Project Euler #115: Counting block combinations II
You are viewing a single comment's thread. Return to all comments →
Maybe your optimisations for big m have a detrimental effect on the runtime for small m. For small m the number of red zones can become very big. In Python I have been able to run all tests in sub second time.