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.
Can it be solved using digit dp? Means states will be like:
dp[N][last]=summation(dp[N-1][i]) for all i>=last for increasing?
I tried this but its counting lesser no of increasing and decreasing numbers. Can anyone explain whats wrong?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #113: Non-bouncy numbers
You are viewing a single comment's thread. Return to all comments →
Can it be solved using digit dp? Means states will be like: dp[N][last]=summation(dp[N-1][i]) for all i>=last for increasing? I tried this but its counting lesser no of increasing and decreasing numbers. Can anyone explain whats wrong?