     "metadata": {},
     "source": [
      "## Algorithm: Compare Sorted Strings\n",
      "\n",
      "Anagrams contain the same strings but in different orders.  This approach could be slow for large strings due to sorting.\n",
      "\n",
      "* Sort both strings\n",
      "* If both sorted strings are equal\n",
      "    * return True\n",
      "* Else\n",
 
</s> remove     "* Space: Additional O(l + m) is created by the sorting algorithm, where l is the length of one string and m is the length of the other"
 </s> add     "* Space: O(n)" </s> remove     "* Space: Additional O(m), where m is the number of unique characters in the hash map"
 </s> add     "* Space: O(n)"
    "Permutations contain the same strings but in different orders.  This approach could be slow for large strings due to sorting.\n",
     "metadata": {},
     "source": [
      "## Algorithm: Compare Sorted Strings\n",
      "\n",
    "Permutations contain the same strings but in different orders.  This approach could be slow for large strings due to sorting.\n",
      "\n",
      "* Sort both strings\n",
      "* If both sorted strings are equal\n",
      "    * return True\n",
      "* Else\n",
keep keep keep keep replace keep keep keep keep keep
 Tweaked permutations challenge algorithm discussion. 
arrays_strings/permutation/permutation_solution.ipynb