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 Time complexity of Hash map solution is O(N) we are checking the lengths of the strings and returning false if the lengths are not equal, when the lengths are equal its O(N + N) = O(N)
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 Time complexity of Hash map solution is O(N) we are checking the lengths of the strings and returning false if the lengths are not equal, when the lengths are equal its O(N + N) = O(N)