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.
This is an AP series problem untill the remaining money becomes less than or equal to minimum cost. So, it should be solvable in O(1) time complexity without any loops.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Halloween Sale
You are viewing a single comment's thread. Return to all comments →
This is an AP series problem untill the remaining money becomes less than or equal to minimum cost. So, it should be solvable in O(1) time complexity without any loops.