I'm having trouble making a leap of imagination and solving this on my own.
Here is the problem. I need to step trough the array of ints, starting anywhere in the array and in case when I reach the end of array,I want to go to the first element and continue from there. The array is only 14 ints long. So, let's say I start at position 5 and I want to make 15 steps. It will take 9 steps to arrive to the end of array and the remaining 6 steps should be made starting with position 0.
So, in a way, imagine 14 ints long array that has been bent into a circle, like a clock dial. And I'm moving along a dial in a counter clockwise direction. The starting
position every time will be different
And each time the distance I want to travel will be different. More often, less than a full circle, but some times more than a full circle.