Test Writing: Count Matching Neighbors

Created By: Chris Taylor

/ Version: 2023.7.0

Complete the following recursive method that returns a count of how many characters have neighboring characters that match. For example, "ama" here "m" has matching neighbors since they are both "a".

Test Design Challenge

You're challenge is to write tests for this problem described above.

• Provide a method named test that accepts no arguments and does not return a value.
• If the implementation of the class described above is incorrect, your test method should throw an exception.
• If it is correct, do not throw an exception.
• You may want to use Java's assert method