Can I say my solution is in O(1) space if I use a hash array of fixed size say of size 52(for lowercase and uppercase alphabets) to count the number of each alphabet that is present in a string?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Can I say my solution is in O(1) space if I use a hash array of fixed size say of size 52(for lowercase and uppercase alphabets) to count the number of each alphabet that is present in a string?
Name |
---|
If you assume that the alphabet size is constant, then the space requirement is O(1). However, if a general case for any alphabet is considered, then it is O(m) where m is the number of characters.