| Title | Count perfect squares |
| Catalog Type | SLCItem |
| Persistent ID | https://codecheck.io/files/horstmann/codecheck-bj-4-loop-104 |
| Platform Name | CodeCheck |
| Features | Code Completion |
| Description | Your task is to write a method countPerfectSquares that counts all perfect squares in a given range. For example, the call countPerfectSquares(5, 25) should return 3 (since 9, 16, and 25 are perfect squares between 5 and 25). |
| Keywords | Loops |
| Author | Cay Horstmann |
| Institution | San José State University |
| Iframe URL | https://codecheck.io/files/horstmann/codecheck-bj-4-loop-104 |
| Protocol | SPLICE, LTI 1.1 |
| Protocol URL | |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Programming Language | Java |
| Natural Language | en |