GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-10 03:18:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Tweaked permutations challenge algorithm discussion.

Browse Source
This commit is contained in:
Donne Martin
2015-07-05 09:03:19 -04:00
parent d4d7c29c9d
commit 11bd2e9768
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
arrays_strings/permutation/permutation_solution.ipynb
View File

@@ -64,7 +64,7 @@
"source": [ "source": [
"## Algorithm: Compare Sorted Strings\n", "## Algorithm: Compare Sorted Strings\n",
"\n", "\n",
"Anagrams contain the same strings but in different orders. This approach could be slow for large strings due to sorting.\n", "Permutations contain the same strings but in different orders. This approach could be slow for large strings due to sorting.\n",
"\n", "\n",
"* Sort both strings\n", "* Sort both strings\n",
"* If both sorted strings are equal\n", "* If both sorted strings are equal\n",
@@ -74,7 +74,7 @@
"\n", "\n",
"Complexity:\n", "Complexity:\n",
"* Time: O(n log n) from the sort, in general\n", "* Time: O(n log n) from the sort, in general\n",
"* 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" "* Space: O(n)"
] ]
}, },
{ {
@@ -121,7 +121,7 @@
"\n", "\n",
"Complexity:\n", "Complexity:\n",
"* Time: O(n)\n", "* Time: O(n)\n",
"* Space: Additional O(m), where m is the number of unique characters in the hash map" "* Space: O(n)"
] ]
}, },
{ {