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.
If I am not mistaken the complexity of your algorithm would be O( N^2 ). Given the fact that in a data structure up to 26 characters would be stored I would suggest maybe using a hashset so it may run in O( N ). Overall, I liked your different approach.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Pangrams
You are viewing a single comment's thread. Return to all comments →
If I am not mistaken the complexity of your algorithm would be O( N^2 ). Given the fact that in a data structure up to 26 characters would be stored I would suggest maybe using a hashset so it may run in O( N ). Overall, I liked your different approach.