Java: Check if a specified number appears in every pair of adjacent element of a given array of integers

Last update on February 20 2025 11:45:12 (UTC/GMT +8 hours)

Specified Number in Adjacent Pairs

Write a Java program that checks if a specified number appears in every pair of adjacent integers of a given array of integers.

Pictorial Presentation:

Sample Solution:

Java Code:

import java.util.*;

public class Exercise99 {
    public static void main(String[] args) {
        int[] array_nums = {10, 20, 10, 20, 40, 20, 50};
        int result = 0; // Initialize a result variable

        int x = 20; // The value to check for

        // Iterate through the array, stopping at the second-to-last element
        for (int i = 0; i < array_nums.length - 1; i++) {
            // Check if the current element and the next element are not equal to the value 'x'
            if (array_nums[i] != x && array_nums[i + 1] != x) {
                result = 1; // If the condition is met, set the result to 1
            }
        }

        // If result is still 0, it means no adjacent pairs without 'x' were found
        if (result == 0) {
            System.out.printf(String.valueOf(true)); // Print true
        } else {
            System.out.printf(String.valueOf(false)); // Print false
        }
    }
}

Sample Output:

true

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to check if a specified number appears in every third element of an array.
• Write a Java program to verify if a number appears at least once in every segment of three elements.
• Write a Java program to check if a number appears in pairs but never in a group of three.
• Write a Java program to determine if every pair of adjacent numbers sums up to a specified value.

Java Code Editor:

Previous: Write a Java program to check if the value 20 appears three times and no 20’s are next to each other in an given array of integers.
Next: Write a Java program to count the two elements of two given arrays of integers with same length, differ by 1 or less.