# Task

You are a lonely frog. 

You live on an integer array.

The meaning of your life is to jump and jump..

Now, here comes your new task. 

You are given an integer array `arr` and a positive integer `n`.

You will jump following the rules below:

- Your initial position at `arr[0]`. arr[0] will always be `0`.

- You will jump according to the number of current position(arr[i])
  - That is, if the number is a positive integer, let say 3, you will jump forward 3 steps; If the number is a negative integer, let say -3, you will jump backward 3 steps; If the number is 0, you will stay here for a little rest.

- The number of current position(arr[i]) will increase decrease by 1 after each turn (jump or stay).
  - That is, if the number of current position(arr[i]) is greater than or equal to `n`, the number will decrease 1; if the number at current position(arr[i]) is less than `n`, the number will increase 1.

You will stop jumping when you reach the exit (your position greater than or equal to arr.length). Please tell me, at the moment, how many elements in `arr` are equal to `n`?

# Note

- `3 <= arr.length <= 1000`, `1 <= n <= 9`

- Frog will never jump backward out of `arr`.

# Example

For `arr = [0,3,0,1,-3], n = 3`, the output should be `2`.
```
 Let us jump softly:
 
 [0,3,0,1,-3]
  ^--You are here, current number is 0, you stay here. 
     currect number 0 < n, so 0 -> 1
 [1,3,0,1,-3]
  ^--You are here, current number is 1, you will jump forward 
     to position 1. current number 1 < n, so 1 -> 2
 [2,3,0,1,-3]
    ^--You are here, current number is 3, you will jump forward 
       to position 4. current number 3 >= n, so 3 -> 2
 [2,2,0,1,-3]
           ^--You are here, current number is -3, you will jump backward
              to position 1. current number -3 < n, so -3 -> -2
 [2,2,0,1,-2]
    ^--You are here, current number is 2, you will jump forward 
       to position 3. current number 2 < n, so 2 -> 3
 [2,3,0,1,-2]
        ^--You are here, current number is 1, you will jump forward
           to position 3. current number 1 < n, so 1 -> 2
 [2,3,0,2,-2]
           ^--You are here, current number is -2, you will jump backward
              to position 2. current number -2 < n, so -2 -> -1
 [2,3,0,2,-1]
      ^--You are here, current number is 0, you stay here.
         current number 0 < n, so 0 -> 1
 [2,3,1,2,-1]
      ^--You are here, current number is 1, you will jump forward 
         to position 3. current number 1 < n, so 1 -> 2
 [2,3,2,2,-1]
        ^--You are here, current number is 2, you will jump forward to position 5.
     current number 2 < n, so 2 -> 3
 [2,3,2,3,-1] exit
               ^--You are here, you reach to the exit.
 
 At the moment, arr[1] and arr[3] are equal to n.
 So, the output should be 2.
```
For `arr = [0,-1,-2,-3,-4], n = 4`, the output should be `2`.
```
 Let's us jump fast ;-)
 
 [0,-1,-2,-3,-4]
  ^
 [1,-1,-2,-3,-4]
  ^
 [2,-1,-2,-3,-4]
     ^
 [2, 0,-2,-3,-4]
  ^
 [3, 0,-2,-3,-4]
        ^
 [3, 0,-1,-3,-4]
  ^
 [4, 0,-1,-3,-4]
           ^
 [4, 0,-1,-2,-4]
  ^
 [3, 0,-1,-2,-4]
              ^
 [3, 0,-1,-2,-3]
  ^
 [4, 0,-1,-2,-3]
           ^
 [4, 0,-1,-1,-3]
     ^
 [4, 1,-1,-1,-3]
     ^
 [4, 2,-1,-1,-3]
        ^
 [4, 2, 0,-1,-3]
     ^
 [4, 3, 0,-1,-3]
           ^
 [4, 3, 0, 0,-3]
        ^
 [4, 3, 1, 0,-3]
        ^
 [4, 3, 2, 0,-3]
           ^
 [4, 3, 2, 1,-3]
           ^
 [4, 3, 2, 2,-3]
              ^
 [4, 3, 2, 2,-2]
     ^
 [4, 4, 2, 2,-2]
              ^
 [4, 4, 2, 2,-1]
        ^
 [4, 4, 3, 2,-1]
              ^
 [4, 4, 3, 2, 0]
           ^
 [4, 4, 3, 3, 0] exit
                 ^
 At the moment, arr[0] and arr[1] are equal to n.
 So, the output should be 2.
```

For `arr = [0,-1,-2,-3,-4], n = 3`, the output should be `0`.
```
 Let's jump fast ;-)
 
 [0,-1,-2,-3,-4]
  ^
 [1,-1,-2,-3,-4]
  ^
 [2,-1,-2,-3,-4]
     ^
 [2, 0,-2,-3,-4]
  ^
 [3, 0,-2,-3,-4]
        ^
 [3, 0,-1,-3,-4]
  ^
 [2, 0,-1,-3,-4]
           ^
 [2, 0,-1,-2,-4]
  ^
 [3, 0,-1,-2,-4]
        ^
 [3, 0, 0,-2,-4]
     ^
 [3, 1, 0,-2,-4]
     ^
 [3, 2, 0,-2,-4]
        ^
 [3, 2, 1,-2,-4]
        ^
 [3, 2, 2,-2,-4]
           ^
 [3, 2, 2,-1,-4]
     ^
 [3, 3, 2,-1,-4]
           ^
 [3, 3, 2, 0,-4]
        ^
 [3, 3, 3, 0,-4]
              ^
 [3, 3, 3, 0,-3]
  ^
 [2, 3, 3, 0,-3]
           ^
 [2, 3, 3, 1,-3]
           ^
 [2, 3, 3, 2,-3]
              ^
 [2, 3, 3, 2,-2]
     ^
 [2, 2, 3, 2,-2]
              ^
 [2, 2, 3, 2,-1]
        ^
 [2, 2, 2, 2,-1] exit
                  ^
 
 At the moment, there is no element equal to n.
 So, the output should be 0.
```

[Base idea taken from [here](https://adventofcode.com/2017/day/5)]

Source: codewars | Difficulty: EASY
Tags: Fundamentals

Starter code: def jumping(arr, n):
	

Solutions:
def jumping(arr, n):
	i = 0
	while i < len(arr):
		x = arr[i]
		arr[i] += 1 if x < n else -1
		i += x
	return arr.count(n)


def jumping(arr, n):
	(i, arr) = (0, arr[:])
	arr[0] += 1
	while i < len(arr):
		delta = arr[i]
		arr[i] += (arr[i] < n) - (arr[i] >= n)
		i += delta
	return arr.count(n)


def jumping(arr, n):
	(l, pos) = (len(arr), 0)
	while pos < l:
		(arr[pos], pos) = (arr[pos] + (arr[pos] < n or -1), pos + arr[pos])
	return arr.count(n)


def jumping(a, n):
	i = 0
	while i < len(a):
		temp = a[i]
		a[i] += 1 if a[i] < n else -1
		i += temp
	return a.count(n)


def jumping(arr, n):
	c = 0
	while c < len(arr):
		T = arr[c] // 1
		c += T
		arr[c - T] += -1 if arr[c - T] >= n else 1
	return arr.count(n)


def jumping(arr, n):
	i = 0
	print(arr)
	while i < len(arr):
		k = arr[i]
		if k >= n:
			arr[i] -= 1
		elif k < n:
			arr[i] += 1
		i += k
	return sum([i == n for i in arr])


def jumping(arr, n):
	pos = 0
	new_pos = 0
	answer = 0
	while True:
		try:
			new_pos = pos + arr[pos]
			if n > arr[pos]:
				arr[pos] += 1
			else:
				arr[pos] -= 1
			pos = new_pos
		except:
			for place in arr:
				if place == n:
					answer += 1
			break
	return answer


def jumping(arr, n):
	ind = 0
	while ind < len(arr):
		here = arr[ind]
		if here < n:
			arr[ind] += 1
		if here >= n:
			arr[ind] -= 1
		ind += here
	return len([i for i in arr if i == n])


def jumping(arr, n):
	ind = 0
	add = 0
	while ind < len(arr):
		if arr[ind] >= n:
			add = -1
		else:
			add = 1
		arr[ind] += add
		ind += arr[ind] - add
	return arr.count(n)