# Find the number of ways to reach n from k in an array [on hold]

We have two numbers as input: n and k (k>=2, n>=2 and k<=n). Consider that we have an array of "n" numbers which has the values 1 to n, just like this:{1,2,3,4,5,6,7,....n}. Also, consider that we have two arms: one that points at 1(the left arm), and one that points at k(the right arm). We have to find the number of distinct ways we can increase these two sides(or at least the k side) such that:

The left side(the one that starts at 1) and the right side(the one that starts...

By: StackOverFlow - Sunday, 22 July

# Related Posts

- Older News
- Minimum number of jumps to reach end with constraints StackOverFlow (2 days ago) - I need a bit of help with finding minimum number of jumps needed to reach the end of an array with constraints.I have an array of 20 numbers randomly selected...
- how to declare array pointer first, and initialize later in java StackOverFlow (2 days ago) - When I want to use an array for storing the inputs from Scanner, but don't know how many tokens it contain, aren't there any ways to get all the inputs...
- Sum of 2 numbers being prime StackOverFlow (3 days ago) - I am working on a program where given a number say 4, I need to find out the possible ways to use all the numbers from 1 to 4, in...