312026676 why this code fail on test case number 3 my approach — I assume that if in final grid there exist a ball i.e v[i][j] == 1 but (v[i-1][j] != 1 && v[i][j-1] != 1 )(except i ==0 || j ==0 (0 based index)). then the answer is false otherwise true..

can anybody explain me this... i am not getting the implementation..2024B - Buying Lemonade

2059B - Cost of the Array can anyone help me with k<n case ... i don't know how to approach .it.

can anyone also tell me how can i approach div 2 B problem as i am unable to do it..