December Long Challenge 2017 GIT01

I’v seen a lot of people solved this problem with a similar approach i.e take one character at a time and then check for the (i+j)%2 == 0 condition. I for one was stuck at the 2-D array thing and couldn’t solve the problem. Are there any similar problems?

I didn’t check one character at a time but create 3 different arrays and solve it, my solution I think, it will help you!