[TONY] WEEK 5 Solution

best-time-to-buy-and-sell-stock/TonyKim9401.java

@@ -0,0 +1,16 @@
+// TC: O(n)
+// SC: O(1)
+class Solution {
+    public int maxProfit(int[] prices) {
+        int bestProfit = 0;
+        int buyPrice = prices[0];
+        for (int i = 1; i < prices.length; i++) {
+            if (buyPrice > prices[i]) {
+                buyPrice = prices[i];
+                continue;
+            }
+            bestProfit = Math.max(bestProfit, prices[i] - buyPrice);
+        }
+        return bestProfit;
+    }
+}

group-anagrams/TonyKim9401.java

@@ -0,0 +1,25 @@
+// TC: O(n)
+// SC: O(n * m)
+class Solution {
+    public List<List<String>> groupAnagrams(String[] strs) {
+        List<List<String>> output = new ArrayList<>();
+        Map<String, List<String>> map = new HashMap<>();
+
+        for (int i = 0; i < strs.length; i++) {
+            char[] charArray = strs[i].toCharArray();
+            Arrays.sort(charArray);
+            String target = new String(charArray);
+
+            if (map.containsKey(target)) {
+                map.get(target).add(strs[i]);
+            } else {
+                List<String> inside = new ArrayList<>();
+                inside.add(strs[i]);
+                map.put(target, inside);
+            }
+        }
+
+        for (String key : map.keySet()) output.add(map.get(key));
+        return output;
+    }
+}