add 1502

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1502|[Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1502.java) | |Easy|Array, Sort|
 |1496|[Path Crossing](https://leetcode.com/problems/path-crossing/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1496.java) | |Easy|String|
 |1493|[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1493.java) | |Medium|Array|
 |1492|[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1492.java) | |Medium|Math|

src/main/java/com/fishercoder/solutions/_1502.java

@@ -0,0 +1,17 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1502 {
+    public static class Solution1 {
+        public boolean canMakeArithmeticProgression(int[] arr) {
+            Arrays.sort(arr);
+            for (int i = 0; i < arr.length - 2; i++) {
+                if (arr[i + 1] - arr[i] != arr[i + 2] - arr[i + 1]) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}

src/test/java/com/fishercoder/_1502Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1502;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1502Test {
+    private static _1502.Solution1 solution1;
+    private static int[] arr;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1502.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        arr = new int[]{3, 5, 1};
+        assertEquals(true, solution1.canMakeArithmeticProgression(arr));
+    }
+
+}