svce-acm / a-december-of-algorithms Goto Github PK

I can't understand the explanation for the 2nd sample input in the question "closest cell" in Dec 31.
"For this input program should return 2 because the closest cell (‘2’) is 2 spaces away from the ‘1’ by moving left to wrap to the other side and then moving down once",
Does it mean, moving left twice? Because 2 can be reached when you do that

Hi, What is the last date for submitting the solutions?

I am not able to understand this question. If we brute-force the string it would take a long time for execution. But since the output is around 13000 seconds for the first input, I guess there will be some formula.. but, I am not able to find any. Can you give me a hint?

I am not able to understand the problem statement . Do we have to write simple algorithm for binary search?
what is input format?
what is output format?
please explain

I am new to git hub can you please guide me for submitting solutions.