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.
He is counting the letters occurrence in each string, the first condition ensure that same letters in the same string will only be counted once.
The second condition is just confirming the answer: if a letter have n counts accross n strings -> number of gem-element increases
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 →
He is counting the letters occurrence in each string, the first condition ensure that same letters in the same string will only be counted once. The second condition is just confirming the answer: if a letter have n counts accross n strings -> number of gem-element increases