CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-02-03 02:24:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

contents/algorithms: fix incorrect time complexity for anagrams (#692)

Browse Source 
Co-authored-by: Atharva <atharvakhadake759@gmail.com>
This commit is contained in:
Atharva
2025-06-06 08:31:48 +05:30
committed by GitHub
parent 3d61290d73
commit 9e4909cbf7
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
apps/website/contents/algorithms/string.md
View File

@@ -95,7 +95,7 @@ An anagram is word switch or word play. It is the result of rearranging the lett
To determine if two strings are anagrams, there are a few approaches:
- Sorting both strings should produce the same resulting string. This takes O(n.log(n)) time and O(log(n)) space.
- Sorting both strings should produce the same resulting string. This takes O(n.log(n)) time and O(n) space.
- If we map each character to a prime number and we multiply each mapped number together, anagrams should have the same multiple (prime factor decomposition). This takes O(n) time and O(1) space. Examples: [Group Anagram](https://leetcode.com/problems/group-anagrams/)
- Frequency counting of characters will help to determine if two strings are anagrams. This also takes O(n) time and O(1) space.