TwoPairsum.java

//sorted rotated array
import java.util.*;
public class TwoPairSum
{
      public static Boolean summ(ArrayList<Integer> list ,int target)
      {
            int bp = -1;
            int n= list.size();
            for(int i = 0;i< n ;i ++)
            {
                  if(list.get(i)> list.get(i+1))
                  {
                        bp=i;
                        break;
                  }
            }
            int lp =bp+1;
            int rp = bp;
            while(lp!=rp)
            {
                  if(list.get(lp) + list.get(rp) == target)
                  {
                        return true;
                  }
                  else if(list.get(lp) + list.get(rp) < target)
                  {
                        lp = (lp-1)%n;
                  }
                  else{
                        rp = (n+rp -1)%n;
                  }
            }
            return false;
      }
	public static void main(String[] args) {
	      ArrayList<Integer> list = new ArrayList<>();
	      list.add(11);
	      list.add(15);
	      list.add(6);
	      list.add(8);
	      list.add(9);
	      list.add(10);
	      System.out.print(summ(list ,16));
	}
}