SHARECHAT 3RD QUESTION: A-Z COUNT
Need help on this question. I used map and binary search still all test cases not passed. Test is over now.
So if anybody can share the working code it would be helpful for me.\
Image:
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
SHARECHAT 3RD QUESTION: A-Z COUNT
Need help on this question. I used map and binary search still all test cases not passed. Test is over now.
So if anybody can share the working code it would be helpful for me.\
Image:
Name |
---|
Just make vector for every character and find lower bound of k for S type queries and (lower bound of (k+1)) — 1 for L type queries. Also, Handle Not found condition. If you did the same and still getting WA to check your implementation.