Dart Solution using map
\n# Approach\n Describe your approach to solving the problem. \nIf the list has one word we return true;\nIt takes the list as one word name \'w\', if \'w\' isn
\n# Approach\n<!-- Describe your approach to solving the problem. -->\nIf the list has one word we return true;\nIt takes the list as one word name \'w\', if \'w\' isn\'t a multiple of words.length that means the length of the words isn\'t the same, so we return false without checking their contents.\nWe create a map that has the value of each letter, if any value isn\'t a multiple of words.length that means we can chare the same character in all the words, so we return false\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n)\n# Code\n```\nclass Solution {\n  bool makeEqual(List<String> words) {\n      if(words.length <= 1) return true;\n      String w = words.join();\n      if(w.length % words.length!=0) return false;\n      Map<String,int> map = {};\n      for(int i=0;i<w.length;i++){\n          map[w[i]]=(map[w[i]]??0)+1;\n      }\n      for(var entry in map.entries){\n          if(entry.value % words.length !=0) return false;\n      }\n      return true;\n    \n  }\n}\n```
['Dart']