| Title | ZipperWordGenerator |
| Catalog Type | SLCItem |
| Persistent ID | https://codecheck.io/files/horstmann/codecheck-bj-4-recur-104 |
| Platform Name | CodeCheck |
| Features | Code Completion |
| Description | You are given two strings of equal length. Your task is to generate all zipper words that can be produced from them. A zipper word is made by interleaving the characters at the same index from each string. Some indexes may be skipped. However, a zipper word has length at least 2. For example, if the two strings are |
| Keywords | Recursion |
| Author | Cay Horstmann |
| Institution | San José State University |
| Iframe URL | https://codecheck.io/files/horstmann/codecheck-bj-4-recur-104 |
| Protocol | SPLICE, LTI 1.1 |
| Protocol URL | |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Programming Language | Java |
| Natural Language | en |