print anagram

Author: sachuverma

DSA Crack Sheet/README.md

@@ -87,6 +87,8 @@
 - [Program to generate all possible valid IP addresses from given string](https://www.geeksforgeeks.org/program-generate-possible-valid-ip-addresses-given-string/ "view topic")
 - [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window3132/1 "view question") - [Cpp Solution](./solutions/Smallest%20distinct%20window.cpp)
 - [Rearrange characters](https://practice.geeksforgeeks.org/problems/rearrange-characters/0# "view question") - [Cpp Solution](./solutions/Rearrange%20characters.cpp)
+- [Minimum characters to be added at front to make string palindrome](https://www.geeksforgeeks.org/minimum-characters-added-front-make-string-palindrome/ "view topic")
+- [Print Anagrams Together](https://practice.geeksforgeeks.org/problems/print-anagrams-together/1# "view question") - [Cpp Solution](./solutions/Print%20Anagrams%20Together.cpp)
 - []( "view question") - [Cpp Solution](./solutions/.cpp)
 
 ### Searching & Sorting

DSA Crack Sheet/solutions/Print Anagrams Together.cpp

@@ -0,0 +1,56 @@
+/*
+Print Anagrams Together
+=======================
+
+Given an array of strings, return all groups of strings that are anagrams. The groups must be created in order of their appearance in the original array. Look at the sample case for clarification.
+
+Example 1:
+Input:
+N = 5
+words[] = {act,god,cat,dog,tac}
+Output: 
+god dog
+act cat tac
+Explanation:
+There are 2 groups of
+anagrams "god", "dog" make group 1.
+"act", "cat", "tac" make group 2.
+
+Example 2:
+Input:
+N = 3
+words[] = {no,on,is}
+Output: 
+no on
+is
+Explanation:
+There are 2 groups of
+anagrams "no", "on" make group 1.
+"is" makes group 2. 
+
+Your Task:
+The task is to complete the function Anagrams() that takes a list of strings as input and returns a list of groups such that each group consists of all the strings that are anagrams.
+
+Expected Time Complexity: O(N*|S|*log|S|), where |S| is the length of the strings.
+Expected Auxiliary Space: O(N*|S|), where |S| is the length of the strings.
+
+Constraints:
+1<=N<=100
+*/
+
+vector<vector<string>> Anagrams(vector<string> &string_list)
+{
+  vector<vector<string>> ans;
+  unordered_map<string, vector<string>> hash;
+
+  for (auto &i : string_list)
+  {
+    string ana = i;
+    sort(ana.begin(), ana.end());
+    hash[ana].push_back(i);
+  }
+
+  for (auto &i : hash)
+    ans.push_back(i.second);
+  return ans;
+}