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 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 166 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.