Added 3 solutions

varunu28 · varunu28 · commit f600d3d215f6 · 2020-01-25T14:52:47.000-08:00
diff --git a/Easy/Maximum 69 Number.java b/Easy/Maximum 69 Number.java
@@ -0,0 +1,12 @@
+class Solution {
+  public int maximum69Number (int num) {
+    char[] chars = String.valueOf(num).toCharArray();
+    for (int i = 0; i < chars.length; i++) {
+      if (chars[i] == '6') {
+        chars[i] = '9';
+        break;
+      }
+    }
+    return Integer.parseInt(String.valueOf(chars));
+  }
+}
diff --git a/Easy/Rank Transform of an Array.java b/Easy/Rank Transform of an Array.java
@@ -0,0 +1,22 @@
+class Solution {
+  public int[] arrayRankTransform(int[] arr) {
+    PriorityQueue<Integer> pq = new PriorityQueue<>();
+    Map<Integer, Integer> map = new HashMap<>();
+    int rank = 1;
+    for (int num : arr) {
+      pq.add(num);
+    }
+    while (!pq.isEmpty()) {
+      int num = pq.poll();
+      if (!map.containsKey(num)) {
+        map.put(num, rank);
+        rank++;
+      }
+    }
+    int[] rankArr = new int[arr.length];
+    for (int i = 0; i < arr.length; i++) {
+      rankArr[i] = map.get(arr[i]);
+    }
+    return rankArr;
+  }
+}
diff --git a/Medium/Break a Palindrome.java b/Medium/Break a Palindrome.java
@@ -0,0 +1,24 @@
+class Solution {
+  public String breakPalindrome(String palindrome) {
+    // If empty or of length 1 => return empty
+    if (palindrome.length() <= 1) {
+      return "";
+    }
+    char[] chars = palindrome.toCharArray();
+    for (int i = 0; i < chars.length; i++) {
+      if (chars[i] != 'a') {
+        // Skip if the string is of odd length and it is the middle index
+        if (palindrome.length() % 2 != 0 && i == palindrome.length() / 2) {
+          continue;
+        }
+        chars[i] = 'a';
+        break;
+      }
+      // If all chars all 'a' update last char to 'b'
+      if (i == chars.length - 1) {
+        chars[i] = 'b';
+      }
+    }
+    return String.valueOf(chars);
+  }
+}
