You are viewing a single comment's thread. Return to all comments →
This was by no means an easy problem. The most challenging part is to get proper recurrence relation. Solution should also be O(N * L).
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #191: Prize Strings
You are viewing a single comment's thread. Return to all comments →
This was by no means an easy problem. The most challenging part is to get proper recurrence relation. Solution should also be O(N * L).