Snakes, Mongooses and the Ultimate Election SNELECT problem


It seems very strange to me while solving this question in beginner section Snakes, Mongooses and the Ultimate Election. Here are the links of my solutions that are been accepted and rejected.

The only difference between two of them is that in the failed one, the sizeof the array is 105 and the passed one it is 1000.
Even the constraints said:

1 ≤ T ≤ 100

1 ≤ |s| ≤ 100

So I think that solution should be acceptable if I choose 105 size

Any hint what I am missing…

P.S. Its a .c file that I have uploaded. So I request to jump to the end of the file where you will find the relevant code for this problem…

1 Like

@vijju123, @admin. Please have a look at this question… Others are also welcome to comment and post the answer…

Your code has multiple int mains. Its very hard to debug. I think there is something else to instead of size of array. The constraints and Test Data are correct and following the constraints.

@vijju123 Its a .c file that I have upload everytime. The main code relevant to this issue is at the end of the file.