| Title | Map word lengths to words |
| Catalog Type | SLCItem |
| Persistent ID | https://codecheck.io/files/horstmann/codecheck-bj-4-tree-108 |
| Platform Name | CodeCheck |
| Features | Code Completion |
| Description | Given an array of strings, create a tree map whose keys are the string lengths and whose values are the sets of strings with the length given by the key. For example, given the array [I, like, Java], produce a map that maps 1 to the set containing "I" and 4 to the set containing "like" and "Java". |
| Keywords | Tree Structures |
| Author | Cay Horstmann |
| Institution | San José State University |
| Iframe URL | https://codecheck.io/files/horstmann/codecheck-bj-4-tree-108 |
| Protocol | SPLICE, LTI 1.1 |
| Protocol URL | |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Programming Language | Java |
| Natural Language | en |