Update

Author: Zanger67

README.md

@@ -0,0 +1,31 @@
+class Solution {
+    public List<List<Integer>> findWinners(int[][] matches) {
+        HashMap<Integer, Integer> playerTracker = new HashMap<>();
+
+        for (int[] i : matches) {
+            playerTracker.put(i[0], playerTracker.getOrDefault(i[0], 0));       // winner
+            playerTracker.put(i[1], playerTracker.getOrDefault(i[1], 0) + 1);   // loser
+        }
+
+        List<Integer> noLoss = new ArrayList<>();
+        List<Integer> oneLoss = new ArrayList<>();
+        for (Integer player : playerTracker.keySet()) {
+            if (playerTracker.get(player) == 0) {
+                noLoss.add(player);
+            } else if (playerTracker.get(player) == 1) {
+                oneLoss.add(player);
+            }
+        }
+
+        Collections.sort(noLoss);
+        Collections.sort(oneLoss);
+
+        ArrayList<List<Integer>> output = new ArrayList<>();
+        output.add((List<Integer>) noLoss);
+        output.add((List<Integer>) oneLoss);
+
+        return output;
+
+
+    }
+}

my-submissions/m2225.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int[][] sortTheStudents(int[][] score, int k) {
+        Arrays.sort(score, new Comparator<int[]>() {
+            public int compare(int[] a, int[] b) {
+                return -1 * Integer.compare(a[k], b[k]);
+            }
+        });
+
+        return score;
+    }
+}

my-submissions/m2545.java

@@ -0,0 +1,3 @@
+class Solution:
+    def sortTheStudents(self, score: List[List[int]], k: int) -> List[List[int]]:
+        return sorted(score, key=lambda x: x[k], reverse=True)

my-submissions/m2545.py

@@ -0,0 +1,23 @@
+class Solution {
+    public String customSortString(String order, String s) {
+        HashMap<Character, Integer> reference = new HashMap<>();
+        for (int i = 0; i < order.length(); i++) {
+            reference.put(order.charAt(i), i);
+        }
+
+        Character[] output = new Character[s.length()];
+        for (int i = 0; i < s.length(); i++) {
+            output[i] = s.charAt(i);
+        }
+
+        Arrays.sort(output, (a, b) -> reference.getOrDefault(a, Integer.MAX_VALUE) - reference.getOrDefault(b, Integer.MAX_VALUE));
+
+        StringBuilder sb = new StringBuilder();
+
+        for (char c : output) {
+            sb.append(c);
+        }
+
+        return sb.toString();
+    }
+}

my-submissions/m791 v1 Arrays Sort Comparator.java

@@ -0,0 +1,26 @@
+class Solution {
+    public String customSortString(String order, String s) {
+        int[] charCounter = new int[26];
+
+        for (char c : s.toCharArray()) {
+            charCounter[c - 'a']++;
+        }
+
+        StringBuilder sb = new StringBuilder();
+        for (char c : order.toCharArray()) {
+            for (int i = 0; i < charCounter[c - 'a']; i++) {
+                sb.append(c);
+            }
+            charCounter[c - 'a'] = 0;
+        }
+
+        for (int i = 0; i < charCounter.length; i++) {
+            while (charCounter[i] > 0) {
+                sb.append((char) ('a' + i));
+                charCounter[i]--;
+            }
+        }
+
+        return sb.toString();
+    }
+}