#include <iostream>
#include <map>
#include <unordered_map>
#include <algorithm>

using namespace std ;
//Find the number of groups of anagrams in the vector of strings
//You can sort a string by using the following code
// sort( str1.begin() , str1.end() )

int getGroupNumber( vector<string>& v1 )
{
   map< string, int> map1 ;
   int result = 0 ;



   return result ;

}


int main ()
{
    vector<string> v1 = { "cinema" , "iceman" , "the"    } ;
    cout << getGroupNumber( v1 ) << endl ;

    vector<string> v2 = { "cinema" , "iceman" , "the"  , "nat", "tan"  } ;
    cout << getGroupNumber( v2 ) << endl ;

  return 0;
}