solves reformat the string

Author: anishLearnsToCode

README.md

@@ -359,7 +359,7 @@
 | 1403 | [Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order)                             |                                                     [![Java](assets/java.png)](src/MinimumSubSequenceInNonIncreasingOrder.java)                                                      |                                                                                                                                   |
 | 1408 | [String Matching In An Array](https://leetcode.com/problems/string-matching-in-an-array)                                                             |                                                             [![Java](assets/java.png)](src/StringMatchingInAnArray.java)                                                             |                                                                                                                                   |
 | 1413 | [Minimum Value To Get Positive Step By Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)                       |                                                     [![Java](assets/java.png)](src/MinimumValueToGetPositiveStepByStepSum.java)                                                      |                                                                                                                                   |
-| 1417 | [Reformat The String](https://leetcode.com/problems/reformat-the-string)                                                                             |                                                                                                                                                                                      |                                                                                                                                   |
+| 1417 | [Reformat The String](https://leetcode.com/problems/reformat-the-string)                                                                             |                                                                [![Java](assets/java.png)](src/ReformatTheString.java)                                                                |                                                                                                                                   |
 | 1422 | [Maximum Score After Splitting A String](https://leetcode.com/problems/maximum-score-after-splitting-a-string)                                       |                                                                                                                                                                                      |                                                                                                                                   |
 | 1426 | [Counting Elements](https://leetcode.com/problems/counting-elements)                                                                                 |                                                                                                                                                                                      |                                                                                                                                   |
 | 1427 | [Performing String Shifts](https://leetcode.com/problems/perform-string-shifts)                                                                      |                                                                                                                                                                                      |                                                                                                                                   |

src/ReformatTheString.java

@@ -0,0 +1,22 @@
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class ReformatTheString {
+    public String reformat(String s) {
+        Queue<Character> digits = new LinkedList<>();
+        Queue<Character> alphabets = new LinkedList<>();
+        for (int index = 0 ; index < s.length() ; index++) {
+            if (Character.isAlphabetic(s.charAt(index))) {
+                alphabets.add(s.charAt(index));
+            } else digits.add(s.charAt(index));
+        }
+        if (Math.abs(digits.size() - alphabets.size()) > 1) return "";
+        StringBuilder result = new StringBuilder();
+        result.append(alphabets.size() > digits.size() ? alphabets.poll() : "");
+        while (!digits.isEmpty() && !alphabets.isEmpty()) {
+            result.append(digits.poll()).append(alphabets.poll());
+        }
+        result.append(!digits.isEmpty() ? digits.poll() : "");
+        return result.toString();
+    }
+}