Palindrome permutation

src/main/java/algorithms/curated170/easy/LargestUniqueNumber.java → src/main/java/algorithms/curated170/easy/largestuniquenumber/LargestUniqueNumber.java

@@ -1,4 +1,4 @@
-package algorithms.curated170.easy;
+package algorithms.curated170.easy.largestuniquenumber;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/algorithms/curated170/easy/largestuniquenumber/LargestUniqueNumberFaster.java

@@ -0,0 +1,19 @@
+package algorithms.curated170.easy.largestuniquenumber;
+
+
+public class LargestUniqueNumberFaster {
+  public int largestUniqueNumber(int[] A) {
+        int has [] = new int[1001];
+        for(int i=0;i<A.length;i++){
+            has[A[i]]+=1;
+        }
+        int res=-1;
+        for(int i=1000;i>=0;i--){
+            if(has[i]==1){
+                res=i;
+                break; 
+            }
+        }
+        return res; 
+    }
+}

src/main/java/algorithms/curated170/easy/palindromepermutation/PalindromePermutationArray.java

@@ -0,0 +1,27 @@
+package algorithms.curated170.easy.palindromepermutation;
+
+
+public class PalindromePermutationArray {
+class Solution {
+    public boolean canPermutePalindrome(String s) {
+        // 
+        if (s == null || s.length() == 0) {
+            return true;
+        }
+        int[] map = new int[128];
+        int count = 0;
+        for (int i = 0; i < s.length(); i ++) {
+            map[s.charAt(i)] ++;
+        }
+        for (int key = 0; key < map.length; key ++) {
+            if (count <= 1) {
+                count += map[key] % 2;
+            } else {
+                break;
+            }
+
+        }
+        return count <= 1;
+    }
+}
+}

src/main/java/algorithms/curated170/easy/palindromepermutation/PalindromePermutationBoolean.java

@@ -0,0 +1,28 @@
+package algorithms.curated170.easy.palindromepermutation;
+
+public class PalindromePermutationBoolean {
+
+    public boolean canPermutePalindrome(String s) {
+
+        if (s == null || s.length() == 0) {
+            return true;
+        }
+        int[] map = new int[128];
+
+        for (int i = 0; i < s.length(); i++) {
+            map[s.charAt(i)]++;
+        }
+
+        boolean sawSingle = false;
+        for (int key = 0; key < map.length; key++) {
+            if (map[key] % 2 == 1) {
+                if (sawSingle) {
+                    return false;
+                }
+                sawSingle = true;
+            }
+        }
+        return true;
+
+    }
+}

src/main/java/algorithms/curated170/easy/PalindromePermutation.java → src/main/java/algorithms/curated170/easy/palindromepermutation/PalindromePermutationHashMap.java

@@ -1,8 +1,8 @@
-package algorithms.curated170.easy;
+package algorithms.curated170.easy.palindromepermutation;
 
 import java.util.HashMap;
 
-public class PalindromePermutation {
+public class PalindromePermutationHashMap {
      public boolean canPermutePalindrome(String s) {
      HashMap<Character, Integer> map = new HashMap<>();
      for (int i = 0; i < s.length(); i++) {