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.
Damn this is so hard , I was able to solve this problem for any n>1 but as long as m<= 4 , in this cas the solution is one line (2**n -1)**(m-1) .
I know this because I wasn't respecting the limiting condition on width <=4 , but I don't know how I can extend it for this condition + also idk how to remove the invalid cases from that
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Lego Blocks
You are viewing a single comment's thread. Return to all comments →
Damn this is so hard , I was able to solve this problem for any n>1 but as long as m<= 4 , in this cas the solution is one line
(2**n -1)**(m-1).I know this because I wasn't respecting the limiting condition on width <=4 , but I don't know how I can extend it for this condition + also idk how to remove the invalid cases from that