Bug Report for https://neetcode.io/problems/is-anagram
Please describe the bug below and include any steps to reproduce the bug or screenshots if possible.
Space complexity of O(1) is not possible if the time complexity is O(n+m) as it requires a hash table, the space complexity at worst case can even reach O(n+m) when all characters are unique in both the string.
Bug Report for https://neetcode.io/problems/is-anagram
Please describe the bug below and include any steps to reproduce the bug or screenshots if possible.
Space complexity of O(1) is not possible if the time complexity is O(n+m) as it requires a hash table, the space complexity at worst case can even reach O(n+m) when all characters are unique in both the string.