Bug Report for is-anagram

[pranjalsaxena]

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.

The recommended complexity section of this problem says this

i.e. O(n+m) time and O(1) space.

But you can either use hashmap approach and have O(n+m) time and O(k) space, where k is number of distinct chars
or you can use sorting and have O(nlogn + mlogm) time and O(1) space.

We can't have both O(n+m) time and O(1) space.

[pranjalsaxena]

I think that k value can be atmost 26 (26 english alphabets) which is a constant, maybe that's why you are treating O(k) as O(1)