Petros Mylonas

[Pmylonas13]

No description provided.

[adam-searle]

Quite allot of repeated/uneeded code here. A more concise approach would be like the following:

public boolean stepFour(int num) {
    for (int i = 0; i < favouriteNumbers.length; i++) {
        if (favouriteNumbers[i] == num) {
            return true;  // Return true immediately if the number is found
        }
    }
    return false;  // Return false if the number is not found after checking the entire array
}