Suraj Jain

Best resource I have found on bitcoin and blockchain for beginner youtube.com/watch?v=xwA2TkcAQgQ, it has complete playlist and covers in lot of depth

I will try to make a challenge out of it

It is not really compliacted

Can someone help me

@Leo Can you help me?

@JanDvorak

, output a single line containing a single integer, which is the minimum possible size of maximum block of consecutive days of the same status achievable.

@Mego Thanks

that it all

a flip mean we can change 0 to 1 , or 1 to 0

I would make it min

no i wont be

please give me link i would see there myself, but i am not able to find such a simple problem on other competetive sight

if you knew this problem from someelse site

and nothing else

so that i could debug it

I am not saying do my homework or this , i do not even want your code, i was just asking why is mine failing which test cases

If i post it here, then

and mine comes under it

@Mego Here it says general discussion for codegolf.stackexchange.com

and mine is giving correct answer for 5 of them

each having 1000's of test cases

See there are 9 input files

i have done the code

nothing else

in which my fails

It is ok, i Want test cases

sorry

a flip mean we can change 0 to 1 , or 1 to 0

And we are allowed k number of flips

11000111000

like

it is just a string of 1's and 0's will be given

Sir, @mego I saw your profile and it is there you solve programming challenges and puzzle , this is a math puzzle

@Mego

and then asked for help

Some test cases are giving false and i have debugged for hours

and it is working too

I have made the code

#include<stdio.h>
#include<stdlib.h>
#include<string.h>




int main(){



   int test_cases;


   scanf("%d" , &test_cases);


   while(test_cases--){


   int length;
   int flips;

    scanf("%d %d" , &length , &flips);

    int string[length];
    int occurence[length+1];
    memset(occurence,0,sizeof(occurence));


    int i = 0;
    int way1 = 0;
    int way0= 0;
    int count1 = 1;
    int count0 = 0;
    int temp;
    int count = 1;

    int thatmax = 0;




    while(i<length){




        scanf("%1d" , &string[i]);

No i have done it

Can someone ?

still some are failing

it is giving correct answers to many test cases

i have debugged it long enough still not able to guess where it is going wrong

but there are some test cases it is failing in

I have done the code