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.
What will be the time complexity of the recursive solution (for which only 30% of the testcases pass and the rest show TLE) ? I feel it will be O(M^(log n)), can someone please confirm?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Stone Division, Revisited
You are viewing a single comment's thread. Return to all comments →
What will be the time complexity of the recursive solution (for which only 30% of the testcases pass and the rest show TLE) ? I feel it will be O(M^(log n)), can someone please confirm?