solves remove palindromic sub sequences

Author: anishLearnsToCode

README.md

@@ -340,8 +340,8 @@
 | 1313 | [Decompress Run-Length Encoded Strings](https://leetcode.com/problems/decompress-run-length-encoded-list)                                            |                                                         [![Java](assets/java.png)](src/DecompressRunLengthEncodedList.java)                                                          |                                                                                                                                   |
 | 1317 | [Convert Integer to Sum Of Two Non-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers)                  |                                                    [![Java](assets/java.png)](src/ConvertIntegerToTheSumOfTwoNoZeroIntegers.java)                                                    |                                                                                                                                   |
 | 1323 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number)                                                                                 |                                                                 [![Java](assets/java.png)](src/Maximum69Number.java)                                                                 |                                                                                                                                   |
-| 1331 | [Rank Transform of An Array](https://leetcode.com/problems/rank-transform-of-an-array)                                                               |                                                                                                                                                                                      |                                                                                                                                   |
-| 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences)                                                     |                                                                                                                                                                                      |                                                                                                                                   |
+| 1331 | [Rank Transform of An Array](https://leetcode.com/problems/rank-transform-of-an-array)                                                               |                                                              [![Java](assets/java.png)](src/RankTransformOfArray.java)                                                               |                                                                                                                                   |
+| 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences)                                                     |                                                          [![Java](assets/java.png)](src/RemovePalindromicSubSequences.java)                                                          |                                                                                                                                   |
 | 1337 | [The K Weakest Rows In A Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix)                                                       |                                                                                                                                                                                      |                                                                                                                                   |
 | 1342 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero)                               |                                                                                                                                                                                      |                                                                                                                                   |
 | 1346 | [Check if N and It's Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist)                                                    |                                                                                                                                                                                      |                                                                                                                                   |

src/RankTransformOfArray.java

@@ -0,0 +1,26 @@
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
+public class RankTransformOfArray {
+    public int[] arrayRankTransform(int[] array) {
+        final Map<Integer, Integer> elementRank = getElementRanks(array);
+        final int[] result = new int[array.length];
+        for (int index = 0 ; index < array.length ; index++) {
+            result[index] = elementRank.get(array[index]);
+        }
+        return result;
+    }
+
+    private Map<Integer, Integer> getElementRanks(int[] array) {
+        final int[] sorted = array.clone();
+        Arrays.sort(sorted);
+        final Map<Integer, Integer> result = new HashMap<>();
+        for (int i = 0, rank = 1 ; i < sorted.length ; i++) {
+            if (!result.containsKey(sorted[i])) {
+                result.put(sorted[i], rank++);
+            }
+        }
+        return result;
+    }
+}

src/RemovePalindromicSubSequences.java

@@ -0,0 +1,12 @@
+public class RemovePalindromicSubSequences {
+    public int removePalindromeSub(String s) {
+        return isPalindrome(s) ? 1 : 2;
+    }
+
+    private boolean isPalindrome(String s) {
+        for (int i = 0 ; i < s.length() / 2 ; i++) {
+            if (s.charAt(i) != s.charAt(s.length() - 1 - i)) return false;
+        }
+        return true;
+    }
+}