algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-28 12:43:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

algorithms: fix string split time complexity

Browse Source
This commit is contained in:
Yangshun Tay
2022-07-18 07:13:28 +08:00
parent 68ab7330a0
commit 0209ea7ce1
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contents/algorithms/string.md
View File

@ -53,7 +53,7 @@ Here we assume the other string is of length m.
| Find substring | O(n.m) | This is the most naive case. There are more efficient algorithms for string searching such as the [KMP algorithm](https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm) | | Find substring | O(n.m) | This is the most naive case. There are more efficient algorithms for string searching such as the [KMP algorithm](https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm) |
| Concatenating strings | O(n + m) | | | Concatenating strings | O(n + m) | |
| Slice | O(m) | | | Slice | O(m) | |
| Split (by token) | O(m) | | | Split (by token) | O(n + m) | |
| Strip (remove leading and trailing whitespaces) | O(n) | | | Strip (remove leading and trailing whitespaces) | O(n) | |
## Things to look out for during interviews ## Things to look out for during interviews