Code submitted below

1. public class EquilibriumPoint { int findEquilibrium(int [] A, int n){ int sum = 0; // initialize sum of whole array int leftsum = 0; // initialize leftsum /* Find sum of the whole array */ for (int i = 0; i < n; ++i){ sum += A[i]; } for (int i = 0; i < n; ++i) { sum -= A[i]; // sum is now right sum for index i if (leftsum…

1. public class SubarrayWithSum { private static void FindSubArrayWithSumS(int[] arr, int s) { int sum = 0; int left, right; left = right = 0; for(int i = 0; i s){ sum -= arr[left]; left++; } // when sum becomes equal to our target sum, we return the indices if(sum == s){ System.out.println(left + " " + right); break;…

1. public class SubarrayWithSum { private static void FindSubArrayWithSumS(int[] arr, int s) { int sum = 0; int left, right; left = right = 0; for(int i = 0; i s){ sum -= arr[left]; left++; } // when sum becomes equal to our target sum, we return the indices if(sum == s){ System.out.println(left + " " + right); break;…