I’ve been working on a program that counts unique words in a text file. It’s an interesting exercise and explores the larger realm of pattern matching. You can try such scanning on a smaller scale by coding a program that counts the frequency of letters within a string. And that task is presented as this month’s Exercise.
\n
\nStart by prompting the user for string input. Have your code scan the string to determine whether any letters — A to Z, case-insensitive — appear more than once. If so, the duplicated letters are displayed. When no letters repeat, the string is flagged as having all unique letters.<\/p>\n
Here’s a sample run:<\/p>\n
And one to pass the test:<\/p>\n You need not get fancy with the way the repeated letters are flagged. For example, my solution just coughs up a letter the first time it’s duplicated:<\/p>\n If you like, you can write code that counts the duplicated letters and displays a tally, but this solution is optional. Also, it’s not necessary to distinguish between uppercase and lowercase letters; the code should be case-insensitive.<\/p>\n Please try this Exercise on your own before you check out my solution<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":" Scan a string to determine how many times a specific letter appears. Continue reading Enter text: Unique words
\nLetter u repeats<\/code><\/p>\nEnter text: Ugly Ed is an ox
\nString is unique: No two letters repeat.<\/code><\/p>\nEnter text: My solution is nothing fancy.
\nLetter o repeats
\nLetter i repeats
\nLetter s repeats
\nLetter n repeats
\nLetter o repeats
\nLetter t repeats
\nLetter i repeats
\nLetter n repeats
\nLetter n repeats
\nLetter y repeats<\/code><\/p>\n