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 found this problem. In original you must find the answer with given input (32, 10), and it is just back to back with time complexity, O(num_of_vars^2). But here we have stricter requirements. So, can you share an idea of how to solve it?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #215: Crack-free Walls
You are viewing a single comment's thread. Return to all comments →
I found this problem. In original you must find the answer with given input (32, 10), and it is just back to back with time complexity, O(num_of_vars^2). But here we have stricter requirements. So, can you share an idea of how to solve it?