add 1460

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1460|[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1460.java) | |Easy|Array|
 |1457|[Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1457.java) | |Medium|Bit Manipulation, Tree, DFS|
 |1456|[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1456.java) | |Medium|String, Sliding Window|
 |1455|[Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1455.java) | |Easy|String|

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

@@ -0,0 +1,28 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _1460 {
+    public static class Solution1 {
+        public boolean canBeEqual(int[] target, int[] arr) {
+            Map<Integer, Integer> map = new HashMap<>();
+            for (int num : target) {
+                map.put(num, map.getOrDefault(num, 0) + 1);
+            }
+            for (int num : arr) {
+                if (!map.containsKey(num)) {
+                    return false;
+                } else {
+                    map.put(num, map.get(num) - 1);
+                }
+            }
+            for (int key : map.keySet()) {
+                if (map.get(key) != 0) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}

src/test/java/com/fishercoder/_1460Test.java

@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1460;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1460Test {
+    private static _1460.Solution1 solution1;
+    private static int[] target;
+    private static int[] arr;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1460.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        target = new int[]{1, 2, 3, 4};
+        arr = new int[]{2, 4, 1, 3};
+        assertEquals(true, solution1.canBeEqual(target, arr));
+    }
+
+}