Solve smallest element in an odd number array

src/Main.java

@@ -2,13 +2,15 @@
 import intermediate.FindInMountain;
 import maharishi.CodingTests;
 
+import java.util.Arrays;
+
 public class Main {
     public static void main(String[] args) {
 
-        int[] arr = {};
+        char[] arr = {'a', 'b', 'c'};
         int target = 2;
-        int result = CodingTests.sumOfEvenOdd(arr);
-        System.out.println(result);
+        char[] result = CodingTests.startToLength(arr, 1, 3);
+        System.out.println(Arrays.toString(result));
     }
 
 

src/maharishi/CodingTests.java

@@ -50,4 +50,21 @@ public static int sumOfEvenOdd(int[] nums){
         // odd = X, even = Y so, X - Y
         return sumOfOdd - sumOfEven;
     }
+
+    // Find the set of character arrays that contains length of characters
+    // starting at the start index (zero-based)
+    public static char[] startToLength(char[] letters, int start, int length){
+
+        if (length < 0 || start < 0 ||
+                start + length-1 >= letters.length){
+            return null;
+        }
+        char[] sub=new char[length];
+        int right = start + length; // apply sliding window
+        for (int i = start; i < right; i++){
+            sub[i - start] = letters[i];
+        }
+
+        return sub;
+    }
 }