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.
Lame that this cannot be done in python due to timeout. I did a non-recursive, dynamic programming solution that couldn't get a ton faster, still timeouts on every test case other than the sample.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #150: Searching a triangular array for a sub-triangle having minimum-sum.
You are viewing a single comment's thread. Return to all comments →
Lame that this cannot be done in python due to timeout. I did a non-recursive, dynamic programming solution that couldn't get a ton faster, still timeouts on every test case other than the sample.