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.
your code will print Yes for this
but it is not done at exact k=100
are you just considering that if s can be converted to t in even number of operations for this example in 6 steps which is less than k than you can delete and append the last char until k become exact 100
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Append and Delete
You are viewing a single comment's thread. Return to all comments →
what about this hackerha hackerrank
your code will print Yes for this but it is not done at exact k=100
are you just considering that if s can be converted to t in even number of operations for this example in 6 steps which is less than k than you can delete and append the last char until k become exact 100