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 think it's looking to count all possible sub-strings of a string.
so if the string length is n, the number of sub-strings will be (n*(n+1))/2.
you can see the 2 commented out in the solution - not sure why
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Special String Again
You are viewing a single comment's thread. Return to all comments →
i think it's looking to count all possible sub-strings of a string. so if the string length is n, the number of sub-strings will be (n*(n+1))/2. you can see the 2 commented out in the solution - not sure why