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: 
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:
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3312 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
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.