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.
For me this was the most difficult type of problem with counting specific numbers whose digits satisfy some condition. After some failed attempts I finally cracked it. It requuires simple DP. In my case I used 3 dimensional arrays. The problem is tricky, so it needs carefull analysis.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #178: Step Numbers
You are viewing a single comment's thread. Return to all comments →
For me this was the most difficult type of problem with counting specific numbers whose digits satisfy some condition. After some failed attempts I finally cracked it. It requuires simple DP. In my case I used 3 dimensional arrays. The problem is tricky, so it needs carefull analysis.