And your "solution" (the latest one that I can see) seems way too simple and incorrect. It fails for even the first test that's mentioned in the description:

Expected: { '1': [ 'C' ], '2': [ 'A', 'B', 'D' ] }, instead got: { '1': [ 'A', 'B', 'C' ], '2': [ 'A', 'B', 'D' ] } 

Make sure to read the description carefully to understand what it's asking for. If you're stuck, try debugging it: https://docs.codewars.com/training/troubleshooting

It's probably not correct then.

its not working, when i type correct answer it catching error

Good😊

This one was fun & simple.

Still, the order of the characters is an issue:
Expected 236=[L, X, G, H]}
as error: 236=[G, X, H, L]}>

"
expected:<{432=[A, B, D], 53=[C], 11=[P, R, S], 236=[L, X, G, H]}> but was:<{432=[A, B, D], 53=[C], 11=[P, R, S], 236=[G, X, H, L]}>
"

OP solved it, closing

Nice Kata, thank you, but only one question: according to example tests the output should be in increasing order, but solutions with both increasing or decreasing order pass the test. Don’t you need to mention this in the description?

IMHO in C++ your map type msv could be better. If at one point you have to sort the keys with comparing the 'int' corresponding value (see the solution, 80% of them begin with that), then you would declare this comparator IN THE msv type !

Same!

Good one.. enjoyed it !

Well, I've written a really nice solution, but it outputs the letters in a different order to that expected (not mentioned in the kata description, incidentally!)

Because I'm so happy with the code I've written, I don't want to solve this kata, now. It does everything according to the description, but doesn't pass the tests which expects the letters to be ordered. Shame!

nice kata!

Thank you, and I'm sorry.