solve task 49 group anagrams

Author: MetlinAlexander

PROGRESS.md

@@ -7,6 +7,7 @@
 | leetcode | easy | 0228. summary ranges | Java | [Solution.java](leetcode/java/easy/0228-summary-ranges/Solution.java) | [notes.md](leetcode/java/easy/0228-summary-ranges/notes.md) |
 | leetcode | easy | 0283. move zeroes | Java | [Solution.java](leetcode/java/easy/0283-move-zeroes/Solution.java) | [notes.md](leetcode/java/easy/0283-move-zeroes/notes.md) |
 | leetcode | easy | 1446. consecutive characters | Java | [Solution.java](leetcode/java/easy/1446-consecutive-characters/Solution.java) | [notes.md](leetcode/java/easy/1446-consecutive-characters/notes.md) |
+| leetcode | medium | 0049. group anagrams | Java | [Solution.java](leetcode/java/medium/0049-group-anagrams/Solution.java) | [notes.md](leetcode/java/medium/0049-group-anagrams/notes.md) |
 | leetcode | medium | 0443. string compression | Java | [Solution.java](leetcode/java/medium/0443-string-compression/Solution.java) | [notes.md](leetcode/java/medium/0443-string-compression/notes.md) |
 | leetcode | medium | 0560. subarray sum equals k | Java | [Solution.java](leetcode/java/medium/0560-subarray-sum-equals-k/Solution.java) | [notes.md](leetcode/java/medium/0560-subarray-sum-equals-k/notes.md) |
 | leetcode | medium | 1493. longest subarray of 1s after deleting one element | Java | [Solution.java](leetcode/java/medium/1493-longest-subarray-of-1s-after-deleting-one-element/Solution.java) | [notes.md](leetcode/java/medium/1493-longest-subarray-of-1s-after-deleting-one-element/notes.md) |

leetcode/java/medium/0049-group-anagrams/Solution.java

@@ -0,0 +1,22 @@
+class Solution {
+    public static String sortString(String str){
+        char[] temp = str.toCharArray();
+        Arrays.sort(temp);
+        return new String(temp);
+    }
+    public List<List<String>> groupAnagrams(String[] strs) {
+        Map<String, ArrayList<String>> anag = new HashMap<>();
+        for(int i = 0; i < strs.length; i++){
+            String sorted = sortString(strs[i]);
+            if(!anag.containsKey(sorted)){
+                anag.put(sorted, new ArrayList<String>());
+            }
+            anag.get(sorted).add(strs[i]);
+        } 
+        List<List<String>> ans = new ArrayList<>();
+        for(String c : anag.keySet()){
+            ans.add(anag.get(c));
+        }
+        return ans;  
+    }
+}

leetcode/java/medium/0049-group-anagrams/notes.md

@@ -0,0 +1,29 @@
+# 443. String Compression
+
+## link
+LeetCode: https://leetcode.com/problems/string-compression/
+
+## Pattern
+- String
+- Sort
+- HashMap
+
+## Idea
+### Rus
+По условию надо сгруппировать анаграмы строк. 
+Сделаем отдельный метод для сортировки строки, в котором преобразуем ее в массив и сортируем. 
+Далее сделаем хешмапу в которой ключом будет сортированная строка. А значением массив строк.
+Так вот идем по строкам. Сначала ее сортируем и ищем. Есть ли такой ключ в хешмапе. Если нет, то создаем массив. Дальше просто кладем текущую строку по этому ключу.
+В конце проходимся по хешмапе и перекладываем все массивы в переменную с ответом.
+### Eng
+By condition, it is necessary to group the anagrams of the strings. 
+Let's make a separate method for sorting a string, in which we convert it into an array and sort it. 
+Next, we will make a hashmap in which the key will be a sorted string. And the value is an array of strings.
+So here we go along the lines. First, we sort it and search for it. Is there such a key in the hashmap? If not, then create an array. Then we just put the current line on this key.
+At the end, we go through the hashmap and transfer all the arrays to the response variable.
+
+## Complexity
+- Time: O(n)
+- Space: O(n*s*log(s))
+
+## Problems