@@ -0,0 +1,1274 @@
+package algorithm.implementation;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0A%0D%0A/**%0D%0A *%0D%0A * @version $Revision$%0D%0A * @version $Date$%0D%0A * @author $Author$%0D%0A * @owner Sandro Mario Zbinden%0D%0A */%0D%0Apublic class ServiceLane %7B%0D%0A    public static class Solution %7B%0D%0A%0D%0A        public static int serviceLane(int%5B%5D ar, int low, int high) %7B%0D%0A            int min = 3;%0D%0A            for (int i = low; i %3C= high; i++) %7B%0D%0A                min = Math.min(min, ar%5Bi%5D);%0D%0A                if (min == 1) %7B%0D%0A                    break;%0D%0A                %7D%0D%0A            %7D%0D%0A            return min;%0D%0A        %7D%0D%0A%0D%0A        public static void main(String%5B%5D args) %7B%0D%0A            try (Scanner in = new Scanner(System.in)) %7B%0D%0A                int n = in.nextInt();%0D%0A                int testcases = in.nextInt();%0D%0A                int%5B%5D ar = new int%5Bn%5D;%0D%0A                for (int i = 0; i %3C n; i++) %7B%0D%0A                    ar%5Bi%5D = in.nextInt();%0D%0A                %7D%0D%0A                for (int testcase = 0; testcase %3C testcases; testcase++) %7B%0D%0A                    int i = in.nextInt();%0D%0A                    int j = in.nextInt();%0D%0A                    System.out.println(serviceLane(ar, i, j));%0D%0A                %7D%0D%0A            %7D%0D%0A        %7D%0D%0A    %7D%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        Solution.main(null);%0D%0A    %7D%0D%0A%7D%0D%0A

Add solution for ServiceLane problem