Help needed in Poker Problem

Can anyone help in this problem from Project Euler?

https://github.com/shim1998/Competitive-Programming/blob/master/poker.cpp
My solution is counting 1 extra answer than the desired output :frowning:
I feel there is a test case i didn’t consider but can’t figure it out :cry: