| Title | Finding Adjacent Duplicates in a Sequence of Numbers |
| Catalog Type | SLCItem |
| Persistent ID | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/while_loops_j_check_adjacent__664e4c8091363872f0ba3818?index=0 |
| Platform Name | PCEX |
| Features | — |
| Description | Construct a program that checks whether a sequence of numbers, entered one at a time, contains adjacent duplicates. The user enters -1 to indicate the end of the input.\nFor example, 4 is a duplicate in the sequence of numbers 1, 3, 4, 4, -1. |
| Keywords | — |
| Author | Mohammad Hassany |
| Institution | University of Pittsburgh |
| Iframe URL | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/while_loops_j_check_adjacent__664e4c8091363872f0ba3818?index=0 |
| Protocol | SPLICE |
| Protocol URL | |
| License | MIT |
| Programming Language | JAVA |
| Natural Language | en |