Java: Check if a specified number appears in every pair of adjacent element of a given array of integers
Java Basic: Exercise-99 with Solution
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:

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.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join