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.
I have implemented two different algorithms (Java/Python) and I am implementing Dynamic Programming for optimization in both of them, but it seems that's not enough for this type of problem. Any one who has implemented other method with good results?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Project Euler #254: Sums of Digit Factorials
You are viewing a single comment's thread. Return to all comments →
I have implemented two different algorithms (Java/Python) and I am implementing Dynamic Programming for optimization in both of them, but it seems that's not enough for this type of problem. Any one who has implemented other method with good results?