Java: A Pair with a Given Sum in the Rotated Sorted Array

Difficulty Level: HARD

Problem Statement:

Given an array arr[] of distinct elements size N that is sorted and then around an unknown point, the task is to check if the array has a pair with a given sum X.

Input:

arr[] = {11, 15, 26, 38, 9, 10}, X = 36

Output:

True
There’s a pair (26, 10) with sum 36