Question

Microsoft | OA Coding Questions and Solutions | Set - 27 | 2022

Answer 1

Given an array A of N integers, return true if A contains at least two elements which differ by 1, and false otherwise.

 

Example,
A = [7] , return false
A = [4,3], return true (3,4)
A = [11, 1, 8, 12, 14] , return true (11,12)
A = [5, 5, 5, 5, 5], return false
A = [4, 10, 8, 5, 9], return true (4,5), (8,9), (9,10)

Answer 2

Python solution

arr = list(set(arr)) # make list of unique element
arr.sort() # sort the list
for i in range(len(arr)-1):
if arr[i+1] - arr[i] == 1: return True
return False

Answer 3

Java solution:

 

public static void main(String[] args) {
	int[] nums1 = {7};
	int[] nums2 = {4,3};
	int[] nums3 = {11, 1, 8, 12, 14};
	int[] nums4 = {5 ,5 ,5, 5, 5};
	int[] nums5 = {4, 10, 8, 5, 9};
	System.out.println(solve(nums1));
	System.out.println(solve(nums2));
	System.out.println(solve(nums3));
	System.out.println(solve(nums4));
	System.out.println(solve(nums5));
}

private static boolean solve(int[] nums) {
	Set<Integer> set = new HashSet<>();
	for(int n : nums) {
		if(set.contains(n-1) || set.contains(n+1))
			return true;
		set.add(n);
	}
	return false;
}