| Title | Letter set |
| Catalog Type | SLCItem |
| Persistent ID | https://codecheck.io/files/horstmann/codecheck-bj-4-tree-101 |
| Platform Name | CodeCheck |
| Features | Code Completion |
| Description | Your task is to produce a set of all letters in a string. Letters are represented as strings of length 1. For example, if you are given a string |
| Keywords | Tree Structures |
| Author | Cay Horstmann |
| Institution | San José State University |
| Iframe URL | https://codecheck.io/files/horstmann/codecheck-bj-4-tree-101 |
| Protocol | SPLICE, LTI 1.1 |
| Protocol URL | |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Programming Language | Java |
| Natural Language | en |