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.
The fastest solution is O(n) and it requires only 26 bit slots for storage. There is no need to find the shortest string which will make the process takes longer time. O(n) is already the fastest solution because you need to read every characters.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Gemstones
You are viewing a single comment's thread. Return to all comments →
The fastest solution is O(n) and it requires only 26 bit slots for storage. There is no need to find the shortest string which will make the process takes longer time. O(n) is already the fastest solution because you need to read every characters.