| Title | Letter frequency (count) |
| Catalog Type | SLCItem |
| Persistent ID | https://codecheck.io/files/horstmann/codecheck-bj-4-array-110 |
| Platform Name | CodeCheck |
| Features | Code Completion |
| Description | Write a method that computes how often each letter A-Z or a-z occurs in a string. Don't distinguish between upper- and lowercase letters. Return an array of length 26. The ith element contains the number of times that the letter 'a' + i or 'A' + i occurs in the string. The string may contain other characters that you should simply skip. |
| Keywords | Arrays and Array Lists |
| Author | Cay Horstmann |
| Institution | San José State University |
| Iframe URL | https://codecheck.io/files/horstmann/codecheck-bj-4-array-110 |
| Protocol | SPLICE, LTI 1.1 |
| Protocol URL | |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Programming Language | Java |
| Natural Language | en |