add 2191

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -121,6 +121,7 @@
 | 2196 | [Create Binary Tree From Descriptions](https://leetcode.com/problems/create-binary-tree-from-descriptions/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2196.java)                                       || Medium                               | HashTable, Tree                
 | 2194 | [Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2194.java)                                       || Easy                                 ||
 | 2192 | [All Ancestors of a Node in a Directed Acyclic Graph](https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2192.java)                                       || Medium                               | Topological Sort, Graph
+| 2191 | [Sort the Jumbled Numbers](https://leetcode.com/problems/sort-the-jumbled-numbers/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2191.java)                                       || Medium                               | Array, Soring
 | 2190 | [Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2190.java)                                       || Easy                                 ||
 | 2186 | [Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/)                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2186.java)                                       || Medium                               ||
 | 2185 | [Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2185.java)                                       || Easy                                 ||

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2191.java

@@ -0,0 +1,37 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.Arrays;
+
+public class _2191 {
+    public static class Solution1 {
+        public int[] sortJumbled(int[] mapping, int[] nums) {
+            int[][] result = new int[nums.length][2];
+            for (int i = 0; i < nums.length; i++) {
+                result[i][0] = convert(nums[i], mapping);
+                result[i][1] = i;
+            }
+            Arrays.sort(result, (a, b) -> a[0] != b[0] ? a[0] - b[0] : a[1] - b[1]);
+            int[] list = new int[nums.length];
+            for (int i = 0; i < nums.length; i++) {
+                list[i] = nums[result[i][1]];
+            }
+            return list;
+        }
+
+        private int convert(int num, int[] mapping) {
+            char[] charArray = String.valueOf(num).toCharArray();
+            StringBuilder sb = new StringBuilder();
+            for (char c : charArray) {
+                sb.append(mapping[Character.getNumericValue(c)]);
+            }
+            int i = 0;
+            while (i < sb.length() && sb.charAt(i) == '0') {
+                i++;
+            }
+            if (i >= sb.length()) {
+                return 0;
+            }
+            return Integer.parseInt(sb.substring(i));
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2191Test.java

@@ -0,0 +1,28 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2191;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+public class _2191Test {
+    private static _2191.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2191.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{338, 38, 991}, solution1.sortJumbled(new int[]{8, 9, 4, 0, 2, 1, 3, 5, 7, 6}, new int[]{991, 338, 38}));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(new int[]{0, 999999999}, solution1.sortJumbled(
+                new int[]{0, 1, 2, 3, 4, 5, 6, 7, 8, 9},
+                new int[]{0, 999999999}));
+    }
+}