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.
Test case 14 consists of the letters 'a' through 'y', each appearing 4000 times, in random order. It is expecting a "YES" return, even though by the definitions set forth this is an invalid string.
Either something went wrong in the storage backend for the test cases and a letter got chopped off somehow, or this problem is expecting an incorrect answer.
A correct answer can simply use a character frequency count and some conditionals.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Sherlock and the Valid String
You are viewing a single comment's thread. Return to all comments →
Test case 14 consists of the letters 'a' through 'y', each appearing 4000 times, in random order. It is expecting a "YES" return, even though by the definitions set forth this is an invalid string.
Either something went wrong in the storage backend for the test cases and a letter got chopped off somehow, or this problem is expecting an incorrect answer.
A correct answer can simply use a character frequency count and some conditionals.