bubble sort solutions

Author: beccadaniel

leetcode/bubble sort/sort-colors/folashade-daniel.java

@@ -0,0 +1,49 @@
+class Solution {
+
+    // bubble sort algorithm
+    public void sortColors(int[] nums) {
+
+        for (int i = 0; i < nums.length-1; i++) {
+
+            boolean swapped = false;
+            for (int j = 0; j < nums.length-1; j++) {
+                if (nums[j] > nums[j+1]) {
+                    int temp = nums[j];
+                    nums[j] = nums[j+1];
+                    nums[j+1] = temp;
+                    swapped = true;
+                }
+            }
+
+            if (!swapped) {
+                break;
+            }
+        }
+    }
+
+    public void sortColors(int[] nums) {
+        int count0 = 0;
+        int count1 = 0;
+        int count2 = 0;
+
+        for (int i = 0; i < nums.length; i++) {
+            if (nums[i] == 0) {
+                count0++;
+            } else if (nums[i] == 1) {
+                count1++;
+            } else {
+                count2++;
+            }
+        }
+
+        for (int j = 0; j < nums.length; j++) {
+            if (j < count0) {
+                nums[j] = 0;
+            } else if (j < count1 + count0) {
+                nums[j] = 1;
+            } else {
+                nums[j] = 2;
+            }
+        }
+    }
+}

leetcode/bubble sort/valid-anagram/folashade-daniel.java

@@ -0,0 +1,17 @@
+class Solution {
+    public boolean isAnagram(String s, String t) {
+
+        if (s.length() != t.length()) {
+            return false;
+        }
+
+        HashMap<Character, Integer> smap = new HashMap<>();
+        HashMap<Character, Integer> tmap = new HashMap<>();
+        for (int i = 0; i < s.length(); i++) {
+            smap.put(s.charAt(i), smap.getOrDefault(s.charAt(i), 0) + 1);
+            tmap.put(t.charAt(i), tmap.getOrDefault(t.charAt(i), 0) + 1);
+        }
+
+        return smap.equals(tmap);
+    }
+}